Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Effectiveness of compilers today andreasa@dhhalden.no (1993-02-14) |
| Superoptimizers (was Re: Effectiveness of compilers today) drw@zermelo.mit.edu (1993-02-18) |
| Re: Superoptimizers (was Re: Effectiveness of compilers today) preston@dawn.cs.rice.edu (1993-02-19) |
| Re: Superoptimizers (was Re: Effectiveness of compilers today) pardo@cs.washington.edu (1993-02-21) |
| Newsgroups: | comp.compilers |
| From: | pardo@cs.washington.edu (David Keppel) |
| Keywords: | optimize, bibliography |
| Organization: | Computer Science & Engineering, U. of Washington, Seattle |
| References: | 93-02-082 93-02-111 |
| Date: | Sun, 21 Feb 1993 02:02:27 GMT |
>drw@zermelo.mit.edu (Dale R. Worley) writes:
>>[Can a program grovel the ASTs of a set of programs and extract
>> "common" combinations of operations that should be candidates for
>> superoptimizer investigation?]
preston@dawn.cs.rice.edu (Preston Briggs):
>[Davidson and Fraser 84 automatic generation of peephole optimizers.]
See also:
%A Robert R. Henry
%T Code Generation by Table Lookup
%R 87-07-07
%I University of Washington Computer Science
%D 1987
%X The code generator is ``trained'' by feeding it sample input DAGs.
Special patterns are generated for DAGs that occur frequently. Thus,
the machine description is augmented with (virtual) instructions that
correspond to frequently-occuring DAGs.
;-D on ( Dr. Seuss-peroptmizers ) Pardo
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.