Compile-time arithmetics needed

sepp@cs.tu-berlin.de (Maximilian Spring)
Wed, 5 Jan 1994 11:43:23 GMT

          From comp.compilers
Related articles
Compile-time arithmetics needed sepp@cs.tu-berlin.de (1994-01-05)
Re: Compile-time arithmetics needed preston@dawn.cs.rice.edu (1994-01-05)
Re: Compile-time arithmetics needed glew@ichips.intel.com (1994-01-10)
| List of all articles for this month |
Newsgroups: comp.compilers
From: sepp@cs.tu-berlin.de (Maximilian Spring)
Keywords: arithmetic, comment
Organization: Technical University of Berlin, Germany
Date: Wed, 5 Jan 1994 11:43:23 GMT

Hello everybody,


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
themselves.


Any help would be appreciated.


Thanks in advance,


Max Spring.
[There was an article by McKeeman in the June 1993 JCLT. Detecting overflow
is easy albeit tedious. -John]
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.