- BURS
BURS (bottom-up rewrite system) theory tackles the problem of taking a complex expression tree or
intermediate language term and finding a good translation tomachine code for a particulararchitecture . Implementations of BURS often employdynamic programming to solve this problem.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 andSusan L. Graham , editors. "Code Generation - Concepts, Tools, Techniques". Workshops in Computing. Springer-Verlag, Berlin, Heidelberg, New York, 1992.ee also
*
BURG - efficient implementation of BURSExternal links
*http://www.stratego-language.org/Transform/BURG - short description of BURG including additional references to BURS and BURG
Wikimedia Foundation. 2010.