Name
Abstract | ||
|---|---|---|
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 ... |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/s002360050099 | Acta Inf. |
Keywords | DocType | Volume |
bottom up,code generation,pattern matching,search algorithm,heuristic search | Journal | 34 |
Issue | ISSN | Citations |
8 | 0001-5903 | 14 |
PageRank | References | Authors |
0.90 | 24 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Albert Nymeyer | 1 | 106 | 9.98 |
| Joost-Pieter Katoen | 2 | 4444 | 289.65 |