Compilation Methods SS 2013 - Slide 226
Objectives:
Overview on DFA algorithms
In the lecture:
- The variants of the algorithm of C-2.25 are explained.
- The improvement is discussed.
- The idea of hierarchical approaches is explained.
Suggested reading:
Kastens / Übersetzerbau, Section 8.2.5, 8.2.6
Questions:
- For a backward problem the blocks could be considered in reversed topological order. Why is that not a good idea?
©2009 Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 07.05.2013