List of labels, extended with a standard bottom element
represents part of the domination relation: each label in a list is dominated by all its successors. This is a newtype only so we can give it a fancy Show instance.
The fact that goes into the entry of a dominator analysis: the first node is dominated only by the entry point, which is represented by the empty list of labels.
This data structure is a *rose tree* in which each node may have arbitrarily many children. Each node dominates all its descendants.
Map from a FactBase for dominator lists into a dominator tree.
Takes FactBase from dominator analysis and returns a map from each label to its immediate dominator, if any
© The University of Glasgow and others
Licensed under a BSD-style license (see top of the page).