Attributed Abstract Program Trees

Henk Alblas, Frans J. Faase

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

4 Downloads (Pure)

Abstract

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
Pages217-230
Number of pages14
ISBN (Print)90-6196-326-5
Publication statusPublished - 1987

Publication series

NameCWI Tract
PublisherCWI (Centrum voor Wiskunde en Informatica)
Volume42

Fingerprint

Specifications
Semantics
Context free grammars
Specification languages
Computer programming languages

Cite this

Alblas, H., & Faase, F. J. (1987). Attributed Abstract Program Trees. In P. R. J. Asveld, & A. Nijholt (Eds.), Essays on concepts, formalisms, and tools: A collection of papers dedicated to Leo A.M. Verbeek (pp. 217-230). (CWI Tract; Vol. 42). Amsterdam, The Netherlands: Centre for Mathematics and Computer Science.
Alblas, Henk ; Faase, Frans J. / Attributed Abstract Program Trees. Essays on concepts, formalisms, and tools: A collection of papers dedicated to Leo A.M. Verbeek. editor / P.R.J. Asveld ; A. Nijholt. Amsterdam, The Netherlands : Centre for Mathematics and Computer Science, 1987. pp. 217-230 (CWI Tract).
@inbook{f40854d637cd413eb4381a1e2cfdc2ce,
title = "Attributed Abstract Program Trees",
abstract = "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.",
author = "Henk Alblas and Faase, {Frans J.}",
year = "1987",
language = "English",
isbn = "90-6196-326-5",
series = "CWI Tract",
publisher = "Centre for Mathematics and Computer Science",
pages = "217--230",
editor = "P.R.J. Asveld and A. Nijholt",
booktitle = "Essays on concepts, formalisms, and tools",

}

Alblas, H & Faase, FJ 1987, Attributed Abstract Program Trees. in PRJ Asveld & A Nijholt (eds), Essays on concepts, formalisms, and tools: A collection of papers dedicated to Leo A.M. Verbeek. CWI Tract, vol. 42, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, pp. 217-230.

Attributed Abstract Program Trees. / Alblas, Henk; Faase, Frans J.

Essays on concepts, formalisms, and tools: A collection of papers dedicated to Leo A.M. Verbeek. ed. / P.R.J. Asveld; A. Nijholt. Amsterdam, The Netherlands : Centre for Mathematics and Computer Science, 1987. p. 217-230 (CWI Tract; Vol. 42).

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

TY - CHAP

T1 - Attributed Abstract Program Trees

AU - Alblas, Henk

AU - Faase, Frans J.

PY - 1987

Y1 - 1987

N2 - 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.

AB - 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.

M3 - Chapter

SN - 90-6196-326-5

T3 - CWI Tract

SP - 217

EP - 230

BT - Essays on concepts, formalisms, and tools

A2 - Asveld, P.R.J.

A2 - Nijholt, A.

PB - Centre for Mathematics and Computer Science

CY - Amsterdam, The Netherlands

ER -

Alblas H, Faase FJ. Attributed Abstract Program Trees. In Asveld PRJ, Nijholt A, editors, Essays on concepts, formalisms, and tools: A collection of papers dedicated to Leo A.M. Verbeek. Amsterdam, The Netherlands: Centre for Mathematics and Computer Science. 1987. p. 217-230. (CWI Tract).