k-visit attribute grammars

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

  • Department of Computer Science
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.
Original languageEnglish
JournalTheory of Computing Systems
Pages (from-to)17-28
Number of pages12
Publication statusPublished - 1981

See relations at Aarhus University Citationformats

ID: 37175699