Programming Languages and Compilers WS 2013/14 - Slide 410

Objectives:
Understand the concept of attribute partitions

In the lecture:
Explain the concepts

context switch,
attribute partitions: sequence of disjoint sets which alternate between synthesized and inherited

Suggested reading:
Kastens / Übersetzerbau, Section 5.2

Assignments:
Construct AGs that are as simple as possible and each exhibits one of the following properties:

There are some trees that have a dependence cycle, other trees don't.
The cycles extend over more than one context.
There is an X that has a partition with k=2 but not with k=1.
There is no partition, although no tree exists that has a cycle. (caution: difficult puzzle!)

Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 07.10.2013