Compiler I WS 2001/2002 - Slide 77
Objectives:
Understand the LAG condition
In the lecture:
- Explain the LAG(k) condition,
- motivate it by depth-first left-to-right tree walks,
- explain the algorithm using the example of CI-73.
Suggested reading:
Kastens / Übersetzerbau, Section 5.2.3
Assignments:
- Check LAG(k) condition for AGs (Exercise 20)
Questions:
- At the end of each iteration of the i-loop one of three conditions hold. Formulate them.
©2001 by Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 10.04.2006