k-visit Attribute Grammars

Publication: Research - peer-reviewJournal article – Annual report year: 1981

View graph of relations

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 languageEnglish
JournalMathematical Systems Theory
Publication date1981
Volume15
Journal number1
Pages17-28
ISSN0025-5661
StatePublished

ID: 3972894