Code Generation = A* + BURS
Nymeyer, A. and Katoen, J.P. and Westra, Y. and Alblas, H. (1996) Code Generation = A* + BURS. In: Compiler Construction, 6th International Conference, CC'96, April 24-26, 1996, Linkoping, Sweden.
| PDF 184Kb |
| Abstract: | A system called BURS that is based on term rewrite systems and a search algorithm A* are combined to produce a code generator that generates optimal code. The theory underlying BURS is re-developed, formalised and explained in this work. The search algorithm uses a cost heuristic that is derived from the termrewrite system to direct the search. 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. |
| Item Type: | Conference or Workshop Item |
| Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |
| Research Group: | |
| Link to this item: | http://purl.utwente.nl/publications/66279 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Repository Staff Only: item control page

Show download statistics for this publication
Show download statistics for this publication