Related articles |
---|
Code Opt. in One-pass Compilation yeh@ga.unc.edu (1996-07-24) |
Re: Code Opt. in One-pass Compilation 0002083004@mcimail.com (Tom Hawker) (1996-07-26) |
Re: Code Opt. in One-pass Compilation hbaker@netcom.com (1996-07-27) |
Re: Code Opt. in One-pass Compilation domjan@inf.ethz.ch (1996-07-31) |
Re: Code Opt. in One-pass Compilation p.froehlich@amc.cube.net (1996-08-04) |
Re: Code Opt. in One-pass Compilation henry@zoo.toronto.edu (Henry Spencer) (1996-08-09) |
From: | Tom Hawker <0002083004@mcimail.com> |
Newsgroups: | comp.compilers |
Date: | 26 Jul 1996 23:23:27 -0400 |
Organization: | MCI |
References: | 96-07-176 |
Keywords: | optimize |
Wei Jen Yeh wrote:
>
> I wonder if anybody knows of books/papers that discuss optimizations
> that can be performed for one-pass compilers (that generate code
> as it parses the source program). TIA.
See Aho and Ullman's Dragon books as well as their 2-volume theory set.
They discuss one-pass compilation and the possible optimizations. If I
remember correctly, the UCSD P-system used a one-pass compiler that can
optimize whole functions, but they didn't do some of the more complex
DAG-type optimizations because the underlying virtual architecture did
not need it.
Tom Hawker
tom_hawker@mcimail.com
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.