Anonymous

Compiler Design: Difference between revisions

From dankwiki
56 bytes added ,  06:51, 29 April 2009
Line 38: Line 38:
** Global value numbering is much more complete that basic common subexpression elimination
** Global value numbering is much more complete that basic common subexpression elimination
** Partial redundancy elimination can be unified with global value numbering
** Partial redundancy elimination can be unified with global value numbering
** Lazy code motion is described in Muchnick p. 407-415


===Loops===
===Loops===