Compiler I WS 2001/2002 - Slide 53
Objectives:
Implementation of LR tables
In the lecture:
Explanation of
- pair of tables and their entries,
- unreachable entries,
- 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?
©2001 by Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 10.04.2006