Static single-assignment form: Difference between revisions

Revision as of 02:42, 19 March 2005

Revision as of 00:18, 20 March 2005

Line 61:

<!-- Need an example -->

Dominance frontiers capture the precise places at which we need &phi; functions: if the node A defines a certain variable, then that definition and that definition alone will reach every node A dominates. Only when we leave these nodes and enter the dominance frontier must bewe account for other flows bringing in other definitions of the same variable. Moreover, no other &phi; functions are needed in the control flow graph to deal with A's definitions, and we can do with no less.

<!-- Describe the algorithm for finding dominance frontiers in the future -->