From Wikipedia, the free encyclopedia - View original article

Jump to: navigation, search
This article is about computer language theory. For the ancient Germanic tribe, see Burs (Dacia).

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]


  1. ^ "BURS-Based Instruction Set Selection" by Dmitri Boulytchev

External links[edit]