Programming Languages and Compilers WS 2013/14 - Slide 413
Objectives:
Understand interleaved visit-sequences
In the lecture:
Explain
- interleaving of visit-sequences for adjacent contexts,
- partitions are "interfaces" for context switches,
- implementation using procedures and calls
Suggested reading:
Kastens / Übersetzerbau, Section 5.2.2
Assignments:
- Construct a set of visit-sequences for a small tree grammar, such that the tree walk solves a certain task.
- Find the description of the design pattern "Visitor" and relate it to visit-sequences.
Questions:
- Describe visit-sequences which let trees being traversed twice depth-first left-to-right.
©2009 by Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 07.10.2013