| || 27 ||Oct
|| 10 ||Nov
For this lab, you are to take a control flow graph
and its dominator tree
(Lab 2) and construct a dominance frontier graph.
Commit your code by the beginning of class on the due date.
- There is no DomFronVertex class; instead, store your
answer in the List instance variable frontier in
- Your code for computing dominance frontiers can go inside DomVertex as well.
- In DomVertex, write a main method that tests
your program on at least three reasonable graphs.
I need to be able to run that method to demo your work.
Last modified 13:02:27 CDT 27 October 2011
by Ron K. Cytron