Attributed Abstract Program Trees

Henk Alblas, Frans J. Faase

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

    6 Downloads (Pure)


    Traditionally, an attribute grammar is presented as a context-free grammar which is augmented with attributes and attribute evaluation rules. This makes attribute grammars a suitable means for the specification of the semantics of programming languages in the context of derivation trees. For the specification of semantic integrity constraints in the context of abstract program trees the concept of attribute grammars has to be re-defined. For this purpose, a language for the specification of context-free tree grammars is defined. This language is extended to an attribute tree grammar specification language.
    Original languageEnglish
    Title of host publicationEssays on concepts, formalisms, and tools
    Subtitle of host publicationA collection of papers dedicated to Leo A.M. Verbeek
    EditorsP.R.J. Asveld, A. Nijholt
    Place of PublicationAmsterdam, The Netherlands
    PublisherCentre for Mathematics and Computer Science
    Number of pages14
    ISBN (Print)90-6196-326-5
    Publication statusPublished - 1987

    Publication series

    NameCWI Tract
    PublisherCWI (Centrum voor Wiskunde en Informatica)


    Dive into the research topics of 'Attributed Abstract Program Trees'. Together they form a unique fingerprint.

    Cite this