Compilation Methods SS 2009 - Slide 214
Objectives:
Recognize natural loops
In the lecture:
- Apply the definitions of C-2.13a to this example;
- discuss nesting of loops.
Suggested reading:
Kastens / Übersetzerbau, Section 8.2.2
Questions:
- Can you give a program structure with repeat-loops, loop-exits, and if-statements for this graph, such that loop S2 is nested in S3?
©2009 Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 30.03.2009