Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!wuarchive!uunet!world!iecc!compilers-sender
From: pardo@june.cs.washington.edu (David Keppel)
Newsgroups: comp.compilers
Subject: Re: Tree rewriting code generators
Keywords: code, design, bibliography
Message-ID: <1991May3.222030.16275@beaver.cs.washington.edu>
Date: 3 May 91 22:20:30 GMT
References: <9104271611.aa07675@ics.uci.edu> <9105031226.AA20452@sirius.hut.fi>
Sender: compilers-sender@iecc.cambridge.ma.us
Reply-To: pardo@june.cs.washington.edu (David Keppel)
Organization: Computer Science & Engineering, U. of Washington, Seattle
Lines: 25
Approved: compilers@iecc.cambridge.ma.us

>> [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.