Programming Languages and Compilers WS 2013/14 - Slide 317
Objectives:
Understand LR conflicts
In the lecture:
Explain: In certain situations the given input
token t can not determine
- Reduce-reduce: which reduction is to be taken;
- Shift-reduce: whether the next token is to be shifted, a reduction is to be made.
Suggested reading:
Kastens / Übersetzerbau, Section 4.3
Questions:
- Why can a shift-shift conflict not exist?
- In LR(0) automata items do not have a right-context set. Explain why a state with a reduce item may not contain any other item.
©2009 by Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 07.10.2013