|And speaking of fast compilers... firstname.lastname@example.org (1992-11-12)|
|Re: And speaking of fast compilers... email@example.com (1992-11-17)|
|Range Checking (was: And speaking of ...) grover@brahmand.Eng.Sun.COM (1992-11-19)|
|From:||grover@brahmand.Eng.Sun.COM (Vinod Grover)|
|Organization:||Sun Microsystems, Mt. View, Ca.|
|Date:||Thu, 19 Nov 1992 07:26:00 GMT|
|Keywords:||performance, optimize, design|
firstname.lastname@example.org (Cheryl Lins) writes:
>Range and bounds checking are variations on the constant propagation
With proper design, range checking could also be viewed as common
subexpression elimination, code motion, and strength reduction. (In fact
partial redundancy elimination; PL.8 compiler used strength reduction to
eliminate some of the range checks). The intermediate representation could
be augmented with "check_range", "check_nil", etc. expressions for
traditional optimizations to be used.
More powerful techniques are based on abstract interpretation (Cousot &
Cousot [?], and Karr [Acta Informatica 197x); but may not be practical for
use in production quality compilers.
Return to the
Search the comp.compilers archives again.