From: bagpiper@pnet02.gryphon.com (Michael Hunter)
Subject: Re: Non-static constant propagation in optimizing Ada compilers
Date: 7 Jan 90 04:20:28 GMT [thread overview]
Message-ID: <24390@gryphon.COM> (raw)
joe@petsd.UUCP (Joe Orost) writes:
>Ada compilers must be able to compute arithmetic expressions exactly. It
>says so in the language definition. Should an optimizing compiler use this
>"infinite precision" arithmetic when it is performing non-static constant
>propagation? What do you think? For example:
really!!!! or just between model numbers within the range of the type? Can
anybody give LRM section numbers?
Michael
Mike Hunter - Box's and CPU's from HELL: iapx80[012]86, PR1ME 50 Series, 1750a
UUCP: {ames!elroy, <routing site>}!gryphon!pnet02!bagpiper
INET: bagpiper@pnet02.gryphon.com
next reply other threads:[~1990-01-07 4:20 UTC|newest]
Thread overview: 2+ messages / expand[flat|nested] mbox.gz Atom feed top
1990-01-07 4:20 Michael Hunter [this message]
-- strict thread matches above, loose matches on Subject: below --
1990-01-05 1:37 Non-static constant propagation in optimizing Ada compilers Joe Orost
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox