Programming Languages and Compilers WS 2013/14 - Slide 305
Objectives:
Understand the construction schema
In the lecture:
Explanation of the method:
- Demonstrate the construction of a left-derivation and the top-down construction of a derivation tree by this animation.
- Relate grammar constructs to function constructs.
- Each function plays the role of an acceptor for a symbol.
- accept function for reading and checking of the next token (scanner).
- Computation of decision sets on PLaC-3.6.
- Decision sets must be pairwise disjoint!
Suggested reading:
Kastens / Übersetzerbau, Section 4.2
Questions:
- A parser algorithm is based on a stack automaton. Where is the stack of a recursive descent parser? What corresponds to the states of the stack automaton?
- Where can actions be inserted into the functions to output production sequences in postfix or in prefix form?
©2009 by Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 15.11.2013