Programming Languages and Compilers WS 2013/14 - Slide 323
Objectives:
Implementation of LR tables
In the lecture:
Explanation of
- compression techniques, derived from general table compression,
- Singleton reduction states yield an effective optimization.
Questions:
- Why are there no error entries in the nonterminal part?
- Why are there unreachable entries?
- Why does a parser need a shift-reduce operation if the optimization of LR(0)-reduction states is applied?
©2009 by Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 07.10.2013