sseiden@ics.uci.edu (04/28/91)
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]
--
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.mwb3092@cs.rit.edu (Maureen W Baran) (05/01/91)
I'm hoping to use twig for the backend of a Modula 2 compiler for my
master's project.
Another reference:
Tjiang, S. W. K. Twig reference manual. Computing Science Tech. Rep. 120,
AT&T Laboratories, Murray Hill, N.J., 1985.
You can get a copy (mine was free) by writing the following address:
AT&T Bell Laboratories
Room No. ID-423
101 John F. Kennedy Parkway
Short Hills, NJ 07078-0905
If you'd like the software, you have to sign a Beta Test Site Agreement.
For information about making the arrangements, contact Judith L. Macor,
Software Distribution Service, (908)582-7710. The address is:
Judith L. Macor, Library Network
AT&T Bell Laboratories
600 Mountain Avenue
Murray Hill, New Jersey 07974
Twig is provided on an "as-is" basis with minimal support from AT&T.
Maureen Baran
(716)477-7969
--
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.boyland@aspen.berkeley.edu (John Boyland) (05/01/91)
|> 1) References to journal articles not listed below. [6] 1. E. Pelegri-Llopart and S. L. Graham, Optimal Code Generation for Expression Trees: An Application of BURS Theory. POPL 88, pp294-308 [BURS: bottom up [tree] rewrite system] |> 2) Information about people/organizations working in this area. Pelegri-Llopart and Farnum both worked with tree transformation systems for compilation. Farnum concentrated on optimization. Their theses are available as technical reports from UC Berkeley. (1988 and 1990 respectively). Farnum continues to work in tree transformation systems. (cfarnum@valhalla.wright.edu) I am currently working in the area for my own research. John (boyland@sequoia.berkeley.edu) -- Send compilers articles to compilers@iecc.cambridge.ma.us or {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.
sja@sirius.hut.fi (Sakari Jalovaara) (05/03/91)
> [3] Fraser C W, Wendt A L "Automatic generation of fast optimiz- > ing code generators" SIGPLAN Not. v23 #7, pp79-84, Jul. 1988 Check out a descendent of this code generator, described in Wendt A L "Fast Code Generation Using Automatically-Generated Decision Trees", SIGPLAN Not. v25 #6, June 1990 The paper mentions quite impressive CG speed. ++sja -- Send compilers articles to compilers@iecc.cambridge.ma.us or {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.
pardo@june.cs.washington.edu (David Keppel) (05/04/91)
>> [3] Fraser C W, Wendt A L "Automatic generation of fast optimiz- >> ing code generators" SIGPLAN Not. v23 #7, pp79-84, Jul. 1988 Sakari Jalovaara <sja@sirius.hut.fi> writes: >Wendt A L "Fast Code Generation Using Automatically-Generated Decision >Trees", SIGPLAN Not. v25 #6, June 1990 > >The paper mentions quite impressive CG speed. See also %A Chris W. Fraser %A Robert R. Henry %T Hard-Coding Bottom-Up Code Generation Tables to Save Time and Space %R Technical Report 90-01-03 %I UWCSD %C Seattle, WA %D JAN 1990 I think it's even faster. ;-D on ( Code fast, fast code ) Pardo -- Send compilers articles to compilers@iecc.cambridge.ma.us or {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.
pardo@june.cs.washington.edu (David Keppel) (05/07/91)
pardo@june.cs.washington.edu (David Keppel) writes: >[Fast tree-rewriting code generators] I gave a citation for a UW technical report. The journal version is: %A Chris W. Fraser %A Robert R. Henry %T Hard-Coding Bottom-Up Code Generation Tables to Save Time and Space %J Software--Practice and Experience %V 21 %N 1 %D January 1991 %P 1-12 You'll probably have an easier time finding this in the `computers' section of your grocer's freezer! ;-D on ( The posting-rewriting text generator ) Pardo -- Send compilers articles to compilers@iecc.cambridge.ma.us or {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.