Optimal Code Generation for Expression Trees

  • Authors:
  • A. V. Aho;S. C. Johnson

  • Affiliations:
  • Bell Laboratories, Murray Hill, New Jersey;Bell Laboratories, Murray Hill, New Jersey

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1976

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper discusses algorithms which transform expression trees into code for register machines. A necessary and sufficient condition for optimality of such an algorithm is derived, which applies to a broad class of machines. A dynamic programming algorithm is then presented which produces optimal code for any machine in this class; this algorithm runs in time linearly proportional to the size of the input.