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

Alblas, H.

Gyimóthy, Tibor

Katoen, Joost P.

Nymeyer, Albert

Westra, Ymte

CiteSeerX

Crossref

University of Twente Research Information

English

A formal basic for the heuristic determination of minimum cost paths.

Algorithms for table-driven generators using tree-pattern matching.

An improvement to bottom-up tree pattern matching.

An overview of the production-quality compiler compiler project.

Automatic derivation of code generators from machine descriptions.

BEG—a generator for efﬁcient back ends.

BURG—fast optimal instruction selection and tree parsing.

BURS automata generation.

Code generation based on formal BURS theory and heuristic search.

Code generation in a machine-independent compiler.

Code generation using tree matching and dynamic programming.

Code selection by inversion of order-sorted derivors.

Code selection by regularly controlled term rewriting.

Code selection techniques: pattern matching, tree parsing, and inversion of derivors.

Efﬁcient retargetable code generation using bottom-up tree pattern matching.

Encoding optimal pattern selection in a table-driven bottom-up tree-pattern matcher.

Engineering a simple, efﬁcient codegenerator generator.

Formalization and Automatic Derivation of Code Generators.

High-quality code generation via bottom-up tree pattern matching.

ı-Llopart. Rewrite systems, pattern matching, and code generation.

More efﬁcient bottom-up multi-pattern matching in trees.

Optimal code generation for expression trees: An application of BURS theory.

Pattern matching in trees.

Performance of table-driven code generators using treepattern matching.

Principles of artiﬁcial intelligence.

Problem-solving methods in artiﬁcial intelligence.

Rewrite systems.

The codegen user’s manual.

Tree automata for code selection.

Tree Templates and Subtree Transformational Grammars.

Twotree patternmatchers for code selection.

Using dynamic programming to generate optimised code in a Graham-Glanville style code generator.

Code Generation = A* + BURS