k-visit Attribute Grammars

Hanne Riis Nielson; S. Skyum

doi:10.1007/BF01786970

k-visit Attribute Grammars

Hanne Riis Nielson, S. Skyum

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

Abstract

It is shown that any well-defined attribute grammar is k-visit for some k. Furthermore, it is shown that given a well-defined grammar G and an integer k, it is decidable whether G is k-visit. Finally it is shown that the k-visit grammars specify a proper hierarchy with respect to translations

Original language	English
Journal	Mathematical Systems Theory
Volume	15
Issue number	1
Pages (from-to)	17-28
ISSN	0025-5661
DOIs	https://doi.org/10.1007/BF01786970
Publication status	Published - 1981

Access to Document

10.1007/BF01786970

OpenUrl availability

Full text

Cite this

@article{62cbbcc5128a4372b9304b684c1144e0,

title = "k-visit Attribute Grammars",

abstract = "It is shown that any well-defined attribute grammar is k-visit for some k. Furthermore, it is shown that given a well-defined grammar G and an integer k, it is decidable whether G is k-visit. Finally it is shown that the k-visit grammars specify a proper hierarchy with respect to translations",

author = "Nielson, {Hanne Riis} and S. Skyum",

year = "1981",

doi = "10.1007/BF01786970",

language = "English",

volume = "15",

pages = "17--28",

journal = "Mathematical Systems Theory",

issn = "0025-5661",

number = "1",

}

TY - JOUR

T1 - k-visit Attribute Grammars

AU - Nielson, Hanne Riis

AU - Skyum, S.

PY - 1981

Y1 - 1981

N2 - It is shown that any well-defined attribute grammar is k-visit for some k. Furthermore, it is shown that given a well-defined grammar G and an integer k, it is decidable whether G is k-visit. Finally it is shown that the k-visit grammars specify a proper hierarchy with respect to translations

AB - It is shown that any well-defined attribute grammar is k-visit for some k. Furthermore, it is shown that given a well-defined grammar G and an integer k, it is decidable whether G is k-visit. Finally it is shown that the k-visit grammars specify a proper hierarchy with respect to translations

U2 - 10.1007/BF01786970

DO - 10.1007/BF01786970

M3 - Journal article

SN - 0025-5661

VL - 15

SP - 17

EP - 28

JO - Mathematical Systems Theory

JF - Mathematical Systems Theory

IS - 1

ER -

k-visit Attribute Grammars

Abstract

Access to Document

OpenUrl availability

Fingerprint

Cite this