k-visit attribute grammars

Hanne Riis, Sven Skyum

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

    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 languageEnglish
    JournalTheory of Computing Systems
    Volume15
    Issue1
    Pages (from-to)17-28
    Number of pages12
    ISSN1432-4350
    DOIs
    Publication statusPublished - 1981

    Fingerprint

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

    Cite this