Compilation Methods SS 2009 - Slide 208
Objectives:
Understand the notion of control-flow graphs
In the lecture:
Examples are given.
- The definition is explained.
- The example of C-2.9 is explained.
- The representation of loops in control-flow graphs is compared to source language representation.
- Algorithms that recognize loops in control-flow graphs are presented in the next section.
Questions:
- Why is the loop structure of source programs not preserved on the level of intermediate languages?
©2009 Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 30.03.2009