BURS
From Wikipedia, the free encyclopedia
This article is about computer language theory. For the ancient Germanic tribe, see Burs (Dacia).
 |
This article is an orphan, as few or no other articles link to it. Please introduce links to this page from related articles; suggestions may be available. (February 2009) |
BURS (bottom-up rewrite system) theory tackles the problem of taking a complex expression tree or intermediate language term and finding a good translation to machine code for a particular architecture. Implementations of BURS often employ dynamic programming to solve this problem.
BURS can also be applied to the problem of designing an instruction set for an application-specific instruction-set processor. [1]
[edit] See also
- BURG - efficient implementation of BURS
[edit] References
- A. V. Aho, M. Ganapathi, and S. W. K. Tjiang. Code generation using tree matching and dynamic programming. ACM Transactions on Programming Languages and Systems, 11(4):491-516, October 1989.
- Robert Giegerich and Susan L. Graham, editors. Code Generation - Concepts, Tools, Techniques. Workshops in Computing. Springer-Verlag, Berlin, Heidelberg, New York, 1992.
- ^ "BURS-Based Instruction Set Selection" by Dmitri Boulytchev
[edit] External links
- http://www.stratego-language.org/Transform/BURG - short description of BURG including additional references to BURS and BURG
 |
This computer science article is a stub. You can help Wikipedia by expanding it. |
