Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
LL(1) Parsing
This lecture introduces LL(1) parsing, a parsing technique that can be easily implemented manually based on the grammar, showing the correspondence between grammar and code through concatenation, alternative, repetition, and nonterminal recursive procedures. It covers the formalization and automation of LL(1) parsers, rewriting grammars for recursive descent parsers, and the computation of 'first' and 'nullable' sets. The lecture also discusses the rules and constraints for LL(1) grammars, the iterative solution for computing constraints, and the LL(1) parsing table. Examples and exercises are provided to illustrate the concepts and algorithms.