|Compile-time arithmetics needed firstname.lastname@example.org (1994-01-05)|
|Re: Compile-time arithmetics needed email@example.com (1994-01-05)|
|Re: Compile-time arithmetics needed firstname.lastname@example.org (1994-01-10)|
|From:||email@example.com (Maximilian Spring)|
|Organization:||Technical University of Berlin, Germany|
|Date:||Wed, 5 Jan 1994 11:43:23 GMT|
I am looking for algorithms for efficient basic arithmetics (+, -, *, /
for real & integers and modulus for integers) for constant folding, where
range overflows are detectable. I am writing a compiler in Modula-2, so
that my main focus is the error detection and not the arithmetics
Any help would be appreciated.
Thanks in advance,
[There was an article by McKeeman in the June 1993 JCLT. Detecting overflow
is easy albeit tedious. -John]
Return to the
Search the comp.compilers archives again.