Computation Sequences: A Way to Characterize Classes of Attribute Grammars

Hanne Riis Nielson

doi:10.1007/BF00265558

Computation Sequences: A Way to Characterize Classes of Attribute Grammars

Hanne Riis Nielson

Research output: Contribution to journal › Journal article › Research › peer-review

Abstract

A computation sequence for a derivation tree specifies a way of walking through the tree evaluating all the attributes of all nodes. By requiring that each derivation tree has a computation sequence with a certain property, it is possible to give simple characterizations of well-known subclasses of attribute grammars. Especially the absolutely noncircular attribute grammars are considered

Original language	English
Journal	Acta Informatica
Volume	19
Issue number	3
Pages (from-to)	255-268
ISSN	0001-5903
DOIs	https://doi.org/10.1007/BF00265558
Publication status	Published - 1983

Access to Document

10.1007/BF00265558

OpenUrl availability

Full text

Cite this

@article{f8e290d992164b0b9a31531c2509b0b8,

title = "Computation Sequences: A Way to Characterize Classes of Attribute Grammars",

abstract = "A computation sequence for a derivation tree specifies a way of walking through the tree evaluating all the attributes of all nodes. By requiring that each derivation tree has a computation sequence with a certain property, it is possible to give simple characterizations of well-known subclasses of attribute grammars. Especially the absolutely noncircular attribute grammars are considered",

author = "Nielson, \{Hanne Riis\}",

year = "1983",

doi = "10.1007/BF00265558",

language = "English",

volume = "19",

pages = "255--268",

journal = "Acta Informatica",

issn = "0001-5903",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - Computation Sequences: A Way to Characterize Classes of Attribute Grammars

AU - Nielson, Hanne Riis

PY - 1983

Y1 - 1983

N2 - A computation sequence for a derivation tree specifies a way of walking through the tree evaluating all the attributes of all nodes. By requiring that each derivation tree has a computation sequence with a certain property, it is possible to give simple characterizations of well-known subclasses of attribute grammars. Especially the absolutely noncircular attribute grammars are considered

AB - A computation sequence for a derivation tree specifies a way of walking through the tree evaluating all the attributes of all nodes. By requiring that each derivation tree has a computation sequence with a certain property, it is possible to give simple characterizations of well-known subclasses of attribute grammars. Especially the absolutely noncircular attribute grammars are considered

U2 - 10.1007/BF00265558

DO - 10.1007/BF00265558

M3 - Journal article

SN - 0001-5903

VL - 19

SP - 255

EP - 268

JO - Acta Informatica

JF - Acta Informatica

IS - 3

ER -

Computation Sequences: A Way to Characterize Classes of Attribute Grammars

Abstract

Access to Document

OpenUrl availability

Fingerprint

Cite this