k-visit Attribute Grammars

Hanne Riis Nielson, S. Skyum

    Research output: Contribution to journalJournal articleResearchpeer-review


    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
    Issue number1
    Pages (from-to)17-28
    Publication statusPublished - 1981


    Dive into the research topics of 'k-visit Attribute Grammars'. Together they form a unique fingerprint.

    Cite this