Transforming denotational semantics into practical attribute grammars

Ganzinger, Harald

doi:10.1007/3-540-10250-7_18

Cited by 10 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A more modular use of manual assistance occurs in the implementations of Gaudel [18] and Christiansen and Jones [14], that are based on abstract data types. See also [10,17].…”

Section: Influences On the Implementationmentioning

confidence: 99%

Control Flow Aspects of Semantics-Directed Compiling

Sethi¹

1983

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

This paper is a demonstration of a semantics-directed compiler generator. We focus on the part of a compiler between syntax analysis and code generation. A language is specified by adding semantic rules in a functional notation to the syntax of the language. Starting with a small sublanguage of while statements, statement constructs of the C programming language are added in stages. Using a small ad hoc code generator, a compiler is automatically constructed from the semantics. The semantic description is analogous to a syntax-directed construction of a flow diagram for a program. By analogy with grammars and parser generators, minimal knowledge of the underlying theory is required.For the control flow aspects of languages, efficient compilers can quickly be generated.

show abstract

“…A more modular use of manual assistance occurs in the implementations of Gaudel [18] and Christiansen and Jones [14], that are based on abstract data types. See also [10,17].…”

Section: Influences On the Implementationmentioning

confidence: 99%

Control Flow Aspects of Semantics-Directed Compiling

Sethi¹

1983

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

show abstract

Compiler generation from relational semantics

Dam

Jensen

1986

Esop 86

View full text Add to dashboard Cite

We consider the problem of automatically deriving correct compilers from relational semantic specifications of programming languages. A relational semantics is an assignment of initial-state final-state relations (defined by means of proof rules) to programs. Compilers are generated in three steps. First, the language definition is transformed into a stack semantics in which the sto~age of semantic values is made explicit. Next, stack rules are assembled into a socalled language scheme containing exactly one rule for each language construct. We consider languages for which non-deterministic branches may be replaced by deterministic ones. Finally, rules are expanded for the purpose of recursion detection, thus obtaining schemes which may be used for code generation in a syntax-directed compiler. I. IntroductionIn this paper we consider relational semantic specifications of programming languages and the problem of deriving correct compilers from such specifications in an automatic way. In relational semantics meaning is given to programs as relations between initial and final states. The term "relational semantics" seems to have originated with the relational theories of Hoare and Lauer in [Hoare/ Lauer 73]. Their semantics, however, have a much less operational flavour than the one considered here, in that they e.g. use invariant properties for the semantics of loops. Our relational semantics is much closer to the deductive systems proposed by Greif and Meyer ([Greif/Meyer 81]) as an alternative to the semantics of Hoare and Lauer. Also Plotkin proposed the use of relational semantics in his work on structural operational semantics ([Plotkin 81]), and in fact our understanding of relational semantics has been heavily influenced by his work.

show abstract

SAL: Simple Applicative Language

Texts in Theoretical Computer Science an EATCS Series

View full text Add to dashboard Cite

Transforming denotational semantics into practical attribute grammars

Cited by 10 publications

References 18 publications

Control Flow Aspects of Semantics-Directed Compiling

Control Flow Aspects of Semantics-Directed Compiling

Compiler generation from relational semantics

SAL: Simple Applicative Language

Contact Info

Product

Resources

About