Compilation Methods SS 2009 - Slide 408
Objectives:
Overlapping life-times modelled by interference graphs
In the lecture:
- Explain the interference graph using the example of C-4.9.
- Demonstrate the heuristics.
Suggested reading:
Kastens / Übersetzerbau, Section 7.5.4
Questions:
- Why is DFA necessary to determine overlapping life-times? Why can't one check each block separately? Give an example where that simplified approach would yield wrong results.
- Show a graph that is k-colorable that is not colored successfully by this heuristic.
©2009 Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 30.03.2009