Code Generation = A* + BURS

Albert Nymeyer; Joost-Pieter Katoen; Ymte Westra; Henk Alblas

Code Generation = A* + BURS

Albert Nymeyer, Joost-Pieter Katoen, Ymte Westra, Henk Alblas

Research output: Book/Report › Report › Academic

94 Downloads (Pure)

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.

Original language	English
Place of Publication	Enschede
Publisher	University of Twente
Number of pages	14
Publication status	Published - 1995

Publication series

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

Access to Document

Nymeyer1995codeFinal published version, 194 KB

1 Conference contribution

Code Generation = A* + BURS
Nymeyer, A., Katoen, J.-P., Westra, Y. & Alblas, H., 1996, Compiler Construction: 6th International Conference, CC'96 Linköping, Sweden, April 24–26, 1996. Proceedings. Gyimóthy, T. (ed.). Berlin, Heidelberg: Springer, p. 160-177 18 p. (Lecture Notes in Computer Science; vol. 1060).
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Open Access
File
6 Citations (Scopus)

110 Downloads (Pure)

Cite this

@book{8e49748a760f4802a82520c0cbc6d27c,

title = "Code Generation = A* + BURS",

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.",

author = "Albert Nymeyer and Joost-Pieter Katoen and Ymte Westra and Henk Alblas",

year = "1995",

language = "English",

series = "Memoranda Informatica",

publisher = "University of Twente",

number = "95-43",

address = "Netherlands",

}

TY - BOOK

T1 - Code Generation = A* + BURS

AU - Nymeyer, Albert

AU - Katoen, Joost-Pieter

AU - Westra, Ymte

AU - Alblas, Henk

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

M3 - Report

T3 - Memoranda Informatica

BT - Code Generation = A* + BURS

PB - University of Twente

CY - Enschede

ER -

Code Generation = A* + BURS

Abstract

Publication series

Access to Document

Fingerprint

Research output

Code Generation = A* + BURS

Cite this