Content deleted Content added
Line 56:
<i>More needed here describing the dominance-frontier based algorithm for computing "minimal" SSA, and other things.</i>
The definitive paper on this is "Efficiently computing static single assignment form and the
control dependence graph", by R. Cryton, J. Ferrante, B. Rosen, M. Wegman and F. Zadek,
<i>ACM Trans. on Programming Languages and Systems</i> 13(4) 1991 pp451-490. Also useful is
chapter 19 of the book "Modern compiler implementation in Java" by Andrew Appel
(Cambridge University Press, 2002).
=== Converting out of SSA form ===
| |||