MGS 2016: LL and LR parsing with abstract machines

This course can serve as both an introduction to some classic compiler theory and to abstract machines (in the style of the SECD machine, but simpler). The two main parser construction techniques will be covered: LL and LR. These techniques underlie modern parser generator tools such as ANTLR, yacc/bison, or Menhir. For both LL and LR, we construct a non-deterministic stack machine from a given grammar and then refine it (where possible) into a deterministic machine that can be implemented efficiently.

You can join the Facebook group for this module here.

Slides on LL and LR parsing with abstract machines

"Grammar notation quick reference sheet

Exercise sheet