Programming Languages and Compilers WS 2013/14 - Slide 406
Objectives:
Exercise formal definition
In the lecture:
- Show synthesized, inherited attributes.
- Check consistency and completeness.
Questions:
- Add a computation such that a pair of sets AI(X), AS(X) is no longer disjoint.
- Add a computation such that the AG is inconsistent.
- Which computations can be omitted whithout making the AG incomplete?
- What would the effect be if the order of the three computations on the bottom left of the slide was altered?
©2009 by Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 07.10.2013