Extending Attribute Grammars to Support Programming-in-the-Large

2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Attribute grammars add specification of static semantic properties to context-free grammars, which, in turn, describe the syntactic structure of program units. However, context-free grammars cannot express programming-in-the-large features common in modern programming languages, including unordered collections of units, included units, and sharing of included units. We present extensions to context-free grammars, and corresponding extensions to attribute grammars, suitable for defining such features. We explain how batch and incremental attribute-evaluation algorithms can be adapted to support these extensions, resulting in a uniform approach to intraunit and interunit static semantic analysis and translation of multiunit programs. © 1994, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Micallef, J., & Kaiser, G. E. (1994). Extending Attribute Grammars to Support Programming-in-the-Large. ACM Transactions on Programming Languages and Systems (TOPLAS), 16(5), 1572–1612. https://doi.org/10.1145/186025.186091

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free