The module builds upon the knowledge of fundamentals of automata theory, formal language and formal translation theories.
Students gain knowledge of various variants and applications of LR parsing and are introduced to special applications of parsers,
such as incremental and parallel parsing.

Requirements:

Knowledge of fundamentals of the theory of formal languages and translations. Knowledge of finite and pushdown automata, construction
of an LL parser, and compiler directed by an LL parser.