{{About|computer language theory|the ancient Germanic tribe|Burs (Dacia)| revenue service and government parastatal|Botswana Unified Revenue Service}}
'''BURS''' (bottom-up rewrite system) theory tackles the problem of taking a complex [[expression (computer science)|expression]] tree or [[intermediate language]] term and finding a good [[Translation#Machine translation|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]].<ref> [https://doi.org/10.1007%2F978-3-540-70881-0_37 "BURS-Based Instruction Set Selection"] by Dmitri Boulytchev </ref>
==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. <references />
==External links== * https://strategoxt.org/Transform/BURG – short description of BURG including additional references to BURS and BURG
{{DEFAULTSORT:Burs}} [[Category:Computer languages]]
{{Compu-sci-stub}}