|elimination methods... firstname.lastname@example.org (V.C. SREEDHAR) (1995-05-28)|
|Re: elimination methods... email@example.com (Michael Wolfe) (1995-06-23)|
|Re: elimination methods... firstname.lastname@example.org (1995-06-30)|
|Re: elimination methods... email@example.com (1995-07-05)|
|From:||Michael Wolfe <firstname.lastname@example.org>|
|Organization:||Oregon Graduate Institute - Computer Science & Engineering|
|Date:||Fri, 23 Jun 1995 04:02:16 GMT|
I have taught compiler optimization courses as short courses several times;
the audience is almost entirely commercial compiler vendors, often for
processors that we don't usually consider (signal processing, etc.). I always
ask questions like what data flow analysis methods are used. The sampling is
not scientific, but there are always quite a few who use elimination methods
(interval analysis) and even some who use syntax-based methods, in addition
to those who use iterative methods. I ask the interval or syntax-based group
what they do in case of irreducible graphs, and the answers are either fall
back to iterative methods, or use node splitting, or give up.
no science here.
- Michael Wolfe
Return to the
Search the comp.compilers archives again.