home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!vnet.ibm.com
- From: jnestoriak@vnet.ibm.com (John Nestoriak III)
- Message-ID: <19921211.142820.329@almaden.ibm.com>
- Date: Fri, 11 Dec 92 17:24:26 EST
- Newsgroups: comp.lang.ada
- Subject: Re: FORTRAN bug(was Re: C++ vs. Ada -- Is Ada loosing?)
- Disclaimer: These views are mine, mine, mine. IBM can't have 'em.
- News-Software: UReply 3.0
- References: <1992Dec9.060218.23940@seas.gwu.edu> <1992Dec11.132942.24054@mksol.dseg.ti.com> <1992Dec11.163811@lglsun.epfl.ch>
- <1992Dec11.210404.2480@inmet.camb.inmet.com>
- Lines: 16
-
- In <1992Dec11.210404.2480@inmet.camb.inmet.com> Tucker Taft writes:
- >One of our goals for Ada 9X has been to give system programmers
- >back this feeling of satisfaction, so that you can do "code generation
- >in your head" for most Ada constructs. In other words,
- >you can predict about how many machine instructions (and
- >generally which ones ;-) will be generated for each
- >construct in your program. For a real-time embedded language,
- >this seems particulary important.
-
- Are there plans to add bitwise operations to Ada 9X? Lack of
- built in shift operators was a disappointing discovery for me.
- I know that Ada is a high order language and therefor less suitable
- for manipulating bits than say C, but there are high level functions
- that need to manipulate bits. I'm thinking in particular of
- compression routines. The project I work on is Ada but we had to
- implement compression using C.
-