k-visit attribute grammars

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

Standard

k-visit attribute grammars. / Riis, Hanne; Skyum, Sven.

In: Theory of Computing Systems, Vol. 15, No. 1, 1981, p. 17-28.

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

Harvard

Riis, H & Skyum, S 1981, 'k-visit attribute grammars', Theory of Computing Systems, vol. 15, no. 1, pp. 17-28. https://doi.org/10.1007/BF01786970

APA

Riis, H., & Skyum, S. (1981). k-visit attribute grammars. Theory of Computing Systems, 15(1), 17-28. https://doi.org/10.1007/BF01786970

CBE

Riis H, Skyum S. 1981. k-visit attribute grammars. Theory of Computing Systems. 15(1):17-28. https://doi.org/10.1007/BF01786970

MLA

Riis, Hanne and Sven Skyum. "k-visit attribute grammars". Theory of Computing Systems. 1981, 15(1). 17-28. https://doi.org/10.1007/BF01786970

Vancouver

Riis H, Skyum S. k-visit attribute grammars. Theory of Computing Systems. 1981;15(1):17-28. https://doi.org/10.1007/BF01786970

Author

Riis, Hanne ; Skyum, Sven. / k-visit attribute grammars. In: Theory of Computing Systems. 1981 ; Vol. 15, No. 1. pp. 17-28.

Bibtex

@article{a7468023785f403e9a5c1332a1cdb648,
title = "k-visit attribute grammars",
abstract = "It is shown that any well-defined attribute grammar isk-visit for somek. Furthermore it is shown that given a well-defined grammarG and an integerk, it is decidable whetherG isk-visit. Finally we show that thek-visit grammars specify a proper hierarchy with respect to translations.",
author = "Hanne Riis and Sven Skyum",
year = "1981",
doi = "10.1007/BF01786970",
language = "English",
volume = "15",
pages = "17--28",
journal = "Theory of Computing Systems",
issn = "1432-4350",
publisher = "Springer New York LLC",
number = "1",

}

RIS

TY - JOUR

T1 - k-visit attribute grammars

AU - Riis, Hanne

AU - Skyum, Sven

PY - 1981

Y1 - 1981

N2 - It is shown that any well-defined attribute grammar isk-visit for somek. Furthermore it is shown that given a well-defined grammarG and an integerk, it is decidable whetherG isk-visit. Finally we show that thek-visit grammars specify a proper hierarchy with respect to translations.

AB - It is shown that any well-defined attribute grammar isk-visit for somek. Furthermore it is shown that given a well-defined grammarG and an integerk, it is decidable whetherG isk-visit. Finally we show that thek-visit grammars specify a proper hierarchy with respect to translations.

U2 - 10.1007/BF01786970

DO - 10.1007/BF01786970

M3 - Journal article

VL - 15

SP - 17

EP - 28

JO - Theory of Computing Systems

JF - Theory of Computing Systems

SN - 1432-4350

IS - 1

ER -