Computation Sequences: A Way to Characterize Classes of Attribute Grammars

    Research output: Contribution to journalJournal articleResearchpeer-review

    Abstract

    A computation sequence for a derivation tree specifies a way of walking through the tree evaluating all the attributes of all nodes. By requiring that each derivation tree has a computation sequence with a certain property, it is possible to give simple characterizations of well-known subclasses of attribute grammars. Especially the absolutely noncircular attribute grammars are considered
    Original languageEnglish
    JournalActa Informatica
    Volume19
    Issue number3
    Pages (from-to)255-268
    ISSN0001-5903
    Publication statusPublished - 1983

    Cite this