Staszek2312 / burg

Bottom Up Rewrite Generator

burg

Bottom Up Rewrite Generator

The bottom-up tree pattern matching is a classic technique used in code generator generator. Many papers and books have decribed it, here are some of them:

1. Code generation using tree matching and dynamic programming [Aho, A. V. et al]

2. Optimal code generation for expression trees [Aho, A. V., Johnson, S. C.]

3. Compilers: Principles, Techniques, and Tools [Aho, A.V., Sethi, R., Ullman, J. D.]

4. Efficient retargetable code generation using bottom-up tree pattern matching [Balachandran, A. et al]

5. An improvement to bottom-up tree pattern matching [Chase, D. R.]

6. BURG: Fast optimal instruction selection and tree pasring [Fraser, C. W. et al]

7. Engineering a simple, efficient code-generator generator [Fraser, C. W. et al]

8. Pattern matching in trees [Hoffman, C. M. et al]

9. Simple and efficient BURS table generation [Proebsting, T. A.]

10. iburg [Dave Hanson]

LICENSE

GNU Public License v3 or later. See LICENSE file for copyright conditions.