Code Generation Based on Formal BURS Theory and Heuristic Search

摘要

BURS, which stands for bottom-up rewrite system, is based on term rewritesystems, to which costs are added. We formalized the underlying theory, and derive an algorithm that computes all pattern matches. We couple this algorithm with the well-known search algorithm A(star) 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. (Copyright (c) University and Twente, 1995).