Programming Languages and Compilers WS 2013/14 - Slide 313
Objectives:
Example for states, transitions, and automaton construction
In the lecture:
Use the example to explain
- the start state,
- the creation of new states,
- transitions into successor states,
- transitive closure of item set,
- push and pop of states,
- consequences of left-recursive and right-recursive productions,
- use of right context to decide upon a reduction,
Suggested reading:
Kastens / Übersetzerbau, Section 4.3
Questions:
- Describe the subgraphs for left-recursive and right-recursive productions. How do they differ?
- How does a LR(0) automaton decide upon reductions?
©2009 by Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 07.10.2013