Code Generation Using Tree Matching And Dynamic Programming英文电子书.pdfVIP

Code Generation Using Tree Matching and Dynamic Programming ALFRED V. AH0 ATT Bell Laboratories MAHADEVAN GANAPATHI Stanford University and STEVEN W. K. TJIANG ATT Bell Laboratories Compiler-component generators, such as lexical analyzer generators and parser generators, have long been used to facilitate the construction of compilers. A tree-manipulation language called twig has been developed to help construct efficient code generators. Twig transforms a tree-translation scheme into a code generator that combines a fast top-down tree-pattern matching algorithm with dynamic programming. Twig has been used to specify and construct code generators for several experimental compilers targeted for different machines. Categories and Subject Descriptors: D.3.4 [Programming Languages]: Processors-code genera- tion, compilers, optimization compiler generators; F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems-pattern matching; F.4.2 [Mathematical Logic and Formal Languages]: Grammars and Other Rewriting Systems-parallel rewriting systems General Terms: Algorithms Additional Key Words and Phrases: Code generation, code generator-generator, code optimization, dynamic programming, pattern matching 1. INTRODUCTION Research in code generation has yielded theoretical insights and practical tech- niques [7, 21, 371. On the theoretical front, efficient algorithms for generating provably optimal code on broad classes of uniform-register machines have been developed for expressions with no common subexpressi