Code Generation based on formal BURS theory and heuristic search

Albert Nymeyer, Joost P. Katoen

    Research output: Book/ReportReportAcademic


    BURS theory provides a powerful mechanism to efficiently generate pattern matches in a given expression tree. BURS, which stands for bottom-up rewrite system, is based on term rewrite systems, to which costs are added. We formalise the underlying theory, and derive an algorithm that computes all pattern matches. This algorithm terminates if the term rewrite system is finite. We couple this algorithm with the well-known search algorithm A ∗ that carries out pattern selection. The search algorithm is directed by a cost heuristic that estimates the minimum cost of code that has yet to be generated. The advantage of using a search algorithm is that we need to compute only those costs that may be part of an optimal rewrite sequence (and not the costs of all possible rewrite sequences as in dynamic programming). A system that implements the algorithms presented in this work has been built.
    Original languageEnglish
    Place of PublicationEnschede
    PublisherUniversity of Twente
    Number of pages40
    Publication statusPublished - 1995

    Publication series

    NameMemoranda Informatica
    PublisherUniversity of Twente
    ISSN (Print)0924-3755
    NameMemorandum TIOS
    PublisherUniversity of Twente, Tele-Informatics and Open Systems Group


    • Compiler generators
    • Code generation
    • Term rewrite systems
    • Search algorithms
    • Formal techniques


    Dive into the research topics of 'Code Generation based on formal BURS theory and heuristic search'. Together they form a unique fingerprint.

    Cite this