Modular well-definedness analysis for attribute grammars

23Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a modular well-definedness analysis for attribute grammars. The global properties of completeness and non-circularity are ensured with checks on grammar modules that require only additional information from their dependencies. Local checks to ensure global properties are crucial for specifying extensible languages. They allow independent developers of language extensions to verify that their extension, when combined with other independently developed and similarly verified extensions to a specified host language, will result in a composed grammar that is well-defined. Thus, the composition of the host language and user-selected extensions can safely be performed by someone with no expertise in language design and implementation. The analysis is necessarily conservative and imposes some restrictions on the grammar. We argue that the analysis is practical and the restrictions are natural and not burdensome by applying it to the Silver specifications of Silver, our boot-strapped extensible attribute grammar system. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kaminski, T., & Van Wyk, E. (2013). Modular well-definedness analysis for attribute grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7745 LNCS, pp. 352–371). https://doi.org/10.1007/978-3-642-36089-3_20

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