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.

Original language | English |
---|

Place of Publication | Enschede |
---|

Publisher | University of Twente |
---|

Number of pages | 14 |
---|

Publication status | Published - 1995 |
---|

Name | Memoranda Informatica |
---|

Publisher | University of Twente |
---|

No. | 95-43 |
---|

ISSN (Print) | 0924-3755 |
---|

Name | Memorandum TIOS |
---|

Publisher | University of Twente, Tele-Informatics and Open Systems Group |
---|

No. | 95-17 |
---|