Re: finding all dominator trees

On Monday 04 Dec 2006 13:28, diablovision@yahoo.com wrote:
> Because, in truth, the dominance relation doesn't make any sense unless
> you have either or both of the following conditions:
>
> 1. a unique entry node.
> 2. an acyclic graph.


Several people, including myself, assumed that when Amir
referred to "dominators in a graph", he meant a control
flow graph (with a unique entry node from which the meaning
of dominance can be defined). He actually wants to compute
the set of dominator trees for the set of control flow graphs
which can be constructed from a given graph by taking each node
in turn to be the entry node (and, presumably, ignoring nodes
which are not reachable from that node). Each of these CFGs
has the same nodes and edges, but a different entry node,
and therefore a different dominance relation and dominator tree.


--
Martin


martin@gkc.org.uk http://www.cse.dmu.ac.uk/~mward/ Erdos number: 4
Don't email: d3457f@gkc.org.uk

Return to the comp.compilers page.
Search the comp.compilers archives again.