Higher order attribute grammars

  • Authors:
  • H. H. Vogt;S. D. Swierstra;M. F. Kuiper

  • Affiliations:
  • Department of Computer Science, University of Utrecht, P.OBox 80.089, 3508 TB Utrecht, The Netherlands;Department of Computer Science, University of Utrecht, P.OBox 80.089, 3508 TB Utrecht, The Netherlands;Department of Computer Science, University of Utrecht, P.OBox 80.089, 3508 TB Utrecht, The Netherlands

  • Venue:
  • PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new kind of attribute grammars, called higher order attribute grammars, is defined. In higher order attribute grammars the structure tree can be expanded as a result of attribute computation. A structure tree may be stored in an attribute. The term higher order is used because of the analogy with higher order functions, where a function can be the result or parameter of another function. A relatively simple method, using OAGs, is described to derive an evaluation order on the defining attribute occurrences which comprises all possible direct and indirect attribute dependencies. As in OAGs, visit-sequences are computed from which an efficient algorithm for attribute evaluation can be derived.