k-visit Attribute Grammars

    Research output: Contribution to journalJournal articleResearchpeer-review

    Abstract

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

    Cite this

    Nielson, Hanne Riis ; Skyum, S. / k-visit Attribute Grammars. In: Mathematical Systems Theory. 1981 ; Vol. 15, No. 1. pp. 17-28.
    @article{62cbbcc5128a4372b9304b684c1144e0,
    title = "k-visit Attribute Grammars",
    abstract = "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",
    author = "Nielson, {Hanne Riis} and S. Skyum",
    year = "1981",
    language = "English",
    volume = "15",
    pages = "17--28",
    journal = "Mathematical Systems Theory",
    issn = "0025-5661",
    publisher = "Springer Verlag",
    number = "1",

    }

    Nielson, HR & Skyum, S 1981, 'k-visit Attribute Grammars', Mathematical Systems Theory, vol. 15, no. 1, pp. 17-28.

    k-visit Attribute Grammars. / Nielson, Hanne Riis; Skyum, S.

    In: Mathematical Systems Theory, Vol. 15, No. 1, 1981, p. 17-28.

    Research output: Contribution to journalJournal articleResearchpeer-review

    TY - JOUR

    T1 - k-visit Attribute Grammars

    AU - Nielson, Hanne Riis

    AU - Skyum, S.

    PY - 1981

    Y1 - 1981

    N2 - 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

    AB - 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

    M3 - Journal article

    VL - 15

    SP - 17

    EP - 28

    JO - Mathematical Systems Theory

    JF - Mathematical Systems Theory

    SN - 0025-5661

    IS - 1

    ER -