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.
Original language | English |
---|---|
Journal | Theory of Computing Systems |
Volume | 15 |
Issue | 1 |
Pages (from-to) | 17-28 |
Number of pages | 12 |
ISSN | 1432-4350 |
DOIs | |
Publication status | Published - 1981 |