Code generation using tree matching and dynamic programming

  • Authors:
  • Alfred V. Aho;Mahadevan Ganapathi;Steven W. K. Tjiang

  • Affiliations:
  • AT&T Bell Labs, Murray Hill, NJ;Stanford Univ., Stanford, CA;AT&T Bell Labs, Murray Hill, NJ

  • Venue:
  • ACM Transactions on Programming Languages and Systems (TOPLAS)
  • Year:
  • 1989

Quantified Score

Hi-index 0.01

Visualization

Abstract

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.