Compiler I WS 2001/2002 - Slide 76
Objectives:
Example for visit-sequences (CI-75)
In the lecture:
- Show tree walk
Questions:
- Check that adjacent visit-sequences interleave correctly.
- Check that all dependencies between computations are obeyed.
- Write procedures that implement these visit-sequences.
©2001 by Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 10.04.2006