Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!zaphod.mps.ohio-state.edu!usc!henry.jpl.nasa.gov!elroy.jpl.nasa.gov!gryphon!pnet02!bagpiper From: bagpiper@pnet02.gryphon.com (Michael Hunter) Newsgroups: comp.lang.ada Subject: Re: Non-static constant propagation in optimizing Ada compilers Message-ID: <24390@gryphon.COM> Date: 7 Jan 90 04:20:28 GMT Sender: root@gryphon.COM Organization: People-Net [pnet02], Redondo Beach, CA. Lines: 14 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, }!gryphon!pnet02!bagpiper INET: bagpiper@pnet02.gryphon.com