BURG, IBURG, WBURG, GBURG: so many trees to rewrite, so little time (invited talk)

Tree-rewriting systems represent an excellent rule-based solution for many problems. Code-generator generators that rely on bottom-up tree parsing have automated one of the tasks of producing a retargetable compiler. BURG, IBURG, etc., represent general-purpose bottom-up tree-parsing systems that have been used extensively in compiler development. In this talk, I will give an overview of the algorithms behind these tools and compare their relative strengths. In addition, I will summarize the challenges faced trying to get these tools adopted in production compilers.