Tree rewriting code generators

I am interested in soliciting opinions that people might have about code
generation via tree rewriting. In [1] (and also in the dragon book) a
system for specifying tree rewriting schemes called Twig is described. I
am working on a system similar to Twig. I'm wondering who else is working
in this area, and what kind of progress has been made. I seek the
following:


1) References to journal articles not listed below.
2) Information about people/organizations working in this area.
3) Comments from personal experience.
3) An answer to the question : "Has anybody used a language such
      as Twig to write a REAL compiler?".


References:


[1] Aho A V, Ganapathi M, Tjiang S W K "Code generation using
tree matching and dynamic programming", TOPLAS v11 #4, pp491-516,
Oct 1989


[2] Christopher T W, Hatcher P J "High quality code generation
via bottom up tree pattern matching" Proceedings of the 13th an-
nual ACM symposium on principles of programming languages, pp119-
130, 1986


[3] Fraser C W, Wendt A L "Automatic generation of fast optimiz-
ing code generators" SIGPLAN Not. v23 #7, pp79-84, Jul. 1988


[4] Fraser C W "A language for writing code generators", SIGPLAN
Not. v24 #7, pp238-245, Jul. 1987


[5] Schwartz R A, Yates J S "Dynamic programming and industrial
strength instruction selection: code generation by tiring but not
exhaustive, search" SIGPLAN Not. v23 #10, pp131-140, Oct. 1988


                                                Thanks in advance,
                                                Steve Seiden
                                                sseiden@ics.uci.edu
[Previous questions about Twig haven't produced any response. -John]
--

Return to the comp.compilers page.
Search the comp.compilers archives again.