Extended Attribute Grammars

Abstract

<p>Two new formalisms are introduced: extended attribute grammars, which are capable of defining completely the syntax of programming languages, and extended attributed trans!ation grammars, which are additionally capable of defining their semantics by translation. These grammars are concise and readable, and their suitability for language definition is demonstrated by a realistic example. The suitability of a large class of these grammars for compiler construction is also established, by borrowing the techniques already developed for attribute grammars and affix grammars.</p><p>Revised version of Glasgow Report No.10</p>

Christiansen Grammar Evolution: Grammatical Evolution With Semantics

“…This paper follows that used in [3], which is very similar to typical attribute grammars and extended attribute grammars [5]. It is slightly more declarative, and explicitly specifies, for every attribute, whether it is inherited (↓) or synthesized ().…”

A Generic Framework for Automated Quality Assurance of Software Models Supporting Languages of Multiple Paradigms

“…Using a meta-language to describe the programming language syntax has a further advantage in relation to QA; overcoming the identified issue that "even such a clear and well-designed languages as Pascal contained hidden semantic irregularities which were revealed only by formalization of its semantics" [36].…”

Flow logics for constraint based analysis

“…The rules of the syntax are extended with conditions expressing how the attributes of the symbols depend on one another; these conditions have to be fulfilled by the attributes of all instances of the rule in the syntax tree. There are different approaches to the specification of attribute grammars spanning a spectrum from extended attribute grammars [26] that are mainly used for verifying the values of attributes, to the classical attribute grammars (e.g. [27]) that are mainly used for computing the values of attributes.…”

“…To specify the extended attribute grammar [26] we shall give the symbol e five attribute positions with the following domains: with Vrr E {rr I (ra, (Tr, md)) E W1}: In the notation of extended attribute grammars the symbol e and its attributes are written as…”

“…In this paper we first present an example flow logic in succinct form. We then show that minor transformations (little more than a redefinition of I-4TEX macros) allow us to obtain a specification in the form of an extended attribute grammar [26]. Other transformations (mainly for making program points explicit) suffice for obtaining a specification in the form of a circular attribute grammar or a control flow analysis (a set based analysis).…”