| Descriptive tools: extended Backus-Naur form.
| Regular grammars and finite automata: finite automata, state diagrams and regular
expressions.
| Context-free grammars and pushdown auromata: examples.
| Lexical analysis: modules and interfaces (decomposition of the grammar, lexical analyzer
interface), construction of the lexical analyzer (state diagrams, reserved words method).
| LL parsers: the LL(1) parsing algorithm for extended BNF grammars.
| LL parsers: computation of FIRST and FOLLOW sets.
| LL parsers: examples of recursive-descent applications.
| Theoretical results concerning the LL(k) and LR(k) grammars.
| LR parsers: LR(0) states, SLR(1) grammars.
| LR parsers: LALR(1) grammars.
| LR parsers: the LALR(1) algorithm.
| LR parsers: shift-reduce transitions, chain production elimination.
| LR parsers: LR table compression.
| Basic concepts of attribute grammars.
