|
Authored by: BJ on Saturday, May 19 2012 @ 05:30 AM EDT |
I have several copies of Aho, Sethi, Ullman: Compilers.
Principles,
Techniques and Tools (1986), and the even predating Aho,
Ullman:
Principles of Compiler Design (the original
Dragon-book).
Both mention peephole optimization in paragraphs
stretching out over
maybe 4 pages.
From the former (p.554) "peephole
optimization, a method for trying to improve the performance of the target
program by examining a short sequence of target instructions (called
the peephole)." (emphasis mine - bjd).
What are "peeping" and
"examining" in this context other than pattern matching?
Or to put
it stronger: if you don't do simulation, what else could you do
beside searching, i.e. pattern matching.
bjd
[ Reply to This | Parent | # ]
|
|
Authored by: Anonymous on Saturday, May 19 2012 @ 09:51 AM EDT |
Peephole optimization is as old as the hills (McKeeman, CACM 1965). It's one of
the easiest and cheapest backend optimizations, so very early compilers were
able to take advantage of it.[ Reply to This | Parent | # ]
|
|
|
|
|