Compilation Methods SS 2013 - Slide 222b
Objectives:
Understand the iterative DFA algorithm
In the lecture:
The topics on the slide are explained.
Examples are given.
- Initialization variants are explained.
- The algorithm is explained.
Suggested reading:
Kastens / Übersetzerbau, Section 8.2.5, 8.2.6
Questions:
- How is the initialization related to the size of the solution for the two variants union and intersect?
- Why does the algorithm terminate?
©2009 Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 07.05.2013