SIMPLE: A language-independent tree IR

[Florian Weimer]

Joe Buck <jbuck@synopsys.COM> writes:

> Perhaps this is best handled in a framework like SIMPLE by using different
> OPs.  That is, if lang-1 says that overflow of signed integer arithmetic
> is undefined but lang-2 requires an exception to be thrown, then a
> different OP would be used; alternatively, the latter could be defined in
> terms of the former plus extra code.

The operator approach has the disadvantage that one day, there might
be a front end which requires detailed overflow checking in integer
calculations.  Ada is rather harmless in this regard because integer
arithmetic is performed in the base range of a given type, so you can
use just a few of these base types (usually four).