| Descriptive tools: strings and rewriting systems, grammars.
| Descriptive tools: derivations and parse trees, exttended BNF notation
| Regular grammars and finite automata: finite automata.
| Regular grammars and finite automata: state diagrams and regular expressions.
| Context-free grammars and pushdown automata.
| Top-down analysis and LL(k) grammars: LL(k) grammars, the LL(k) algorithm
| Top-down analysis and LL(k) grammars: elimination of left recursion, left factoring.
| LL parsers: strong LL(k) grammars, the LL(1) parsing algorithm.
| LL parsers: the LL(1) parsing algorithm in the interpretive variant, computation of FIRST and FOLLOW sets.
| Bottom-up analysis and LR(k) grammars: situations and closure of a nonterminal, the LR(k) algorithm.
| Bottom-up analysis and LR(k) grammars: the LR(k) algorithm.
| LR parsers: the LR(0) parsing algorithm, LR(0) states.
| Natural language processing: syntactic analysis, semantic interpretation, representation methods.
| Natural language processing: neural models for language representation.
