M. V. Zelkowitz and W. G. Bail. Optimization of structured programs. Software---Practice and Experience, 4(1):51--57, January 1974. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Tree-Based Code Optimization - McConnell (1992) (3 citations) (Correct)
....run 34 structure. Conjoining SSA form and control dependence yields optimization algorithms that are able to deal with control more effectively, and so are more powerful than traditional algorithms. Despite the advantages of ASTs, optimizing compilers have rarely used them. Zelkowitz and Bail [ZB74] discuss how to do CSE and code motion in a structured programming language using an AST. The Bliss compiler [WJW 75] uses an AST for some optimizations and to locate loops, but uses a CFG for most optimizations. The Modula 2 compiler of Powell [Pow84] uses an AST for CSE and code motion. The ....
M. V. Zelkowitz and W. G. Bail. Optimization of structured programs. Software---Practice and Experience, 4(1):51--57, January 1974.
Tree-Based Code Optimization - Mcconnell (1993) (3 citations) (Correct)
....of ASTs, as well as the optimization of register allocation. Despite the advantages of ASTs, optimizing compilers have rarely used them. Zelkowitz and Bail describe a compiler for a structured programming language that performs common subexpression elimination and code motion using an AST [ZB74] The Bliss compiler uses an AST for a few optimizations and to locate loops, but otherwise uses a CFG [WJW 75] Powell describes a Modula 2 compiler that performs common subexpression elimination and code motion using an AST [Pow84] These compilers all use language specific ASTs for ....
M. V. Zelkowitz and W. G. Bail. Optimization of structured programs. Software--- Practice and Experience, 4(1):51--57, January 1974.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC