Re: 1 - 1, 1 -1, 1-1, 1 - -1 and -2147483648

Jean-Marc Bourguet <jm@bourguet.org>
31 Jan 2006 12:47:34 -0500

          From comp.compilers
Related articles
1 - 1, 1 -1, 1-1, 1 - -1 and -2147483648 devriese@cs.tcd.ie (Edsko de Vries) (2006-01-31)
Re: 1 - 1, 1 -1, 1-1, 1 - -1 and -2147483648 torbenm@app-0.diku.dk (2006-01-31)
Re: 1 - 1, 1 -1, 1-1, 1 - -1 and -2147483648 rsc@swtch.com (Russ Cox) (2006-01-31)
Re: 1 - 1, 1 -1, 1-1, 1 - -1 and -2147483648 jm@bourguet.org (Jean-Marc Bourguet) (2006-01-31)
Re: 1 - 1, 1 -1, 1-1, 1 - -1 and -2147483648 mailbox@dmitry-kazakov.de (Dmitry A. Kazakov) (2006-01-31)
Re: 1 - 1, 1 -1, 1-1, 1 - -1 and -2147483648 gneuner2@comcast.net (George Neuner) (2006-01-31)
Re: 1 - 1, 1 -1, 1-1, 1 - -1 and -2147483648 rivers@dignus.com (Thomas David Rivers) (2006-01-31)
Re: 1 - 1, 1 -1, 1-1, 1 - -1 and -2147483648 david@tribble.com (David R Tribble) (2006-01-31)
Re: 1 - 1, 1 -1, 1-1, 1 - -1 and -2147483648 henry@spsystems.net (2006-01-31)
Re: 1 - 1, 1 -1, 1-1, 1 - -1 and -2147483648 gah@ugcs.caltech.edu (glen herrmannsfeldt) (2006-02-02)
[2 later articles]
| List of all articles for this month |
From: Jean-Marc Bourguet <jm@bourguet.org>
Newsgroups: comp.compilers
Date: 31 Jan 2006 12:47:34 -0500
Organization: Compilers Central
References: 06-01-131
Keywords: lex arithmetic
Posted-Date: 31 Jan 2006 12:47:34 EST

"Edsko de Vries" <devriese@cs.tcd.ie> writes:


> Is there a good solution that solves both problems?


I don't know if you consider it "good", but doing compile time
evaluation of constant expressions with an unbounded precision package
would solve the issue. It immediately extend to having unbounded
precision integers at runtime when you'll add it.


--
Jean-Marc


Post a followup to this message

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