From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,ea4f04ec8d41f5b7
X-Google-Attributes: gid103376,public
From: bobduff@world.std.com (Robert A Duff)
Subject: Re: Ada83 equivalents for Ada95
Date: 1996/05/11
Message-ID: <Dr7tno.Lvu@world.std.com>#1/1
X-Deja-AN: 154215394
references: <md5:492A761845FE7D43B3C33CDDC6DB8CD0>
 <3193BA1E.31C1@csehp3.mdc.com>
organization: The World Public Access UNIX, Brookline, MA
newsgroups: comp.lang.ada
Date: 1996-05-11T00:00:00+00:00
List-Id: <comp.lang.ada>


In article <3193BA1E.31C1@csehp3.mdc.com>,
James A. Squire <m193884@CSEHP3.MDC.COM> wrote:
>No.  I wanted to be able to show "what you have to go through to do
><this> in Ada83" and do comparisons.

Oh.  Sorry I missed the point.

I think the Rationale has some comparisons that might be of interest.
It's at:

  ftp://sw-eng.falls-church.va.us/public/adaic/docs/standard/95lrm_rat/v6.0

Also, it's not too hard to come up with such examples.  Write something
using a protected type, and then write the same thing using rendezvous.
Use a conditional entry call to illustrate one nice thing about Ada 95.

Write a hierarchy of tagged types, with dispatching operations, and
compare it to the equivalent variant record with case statements.

Write a package, with a private type, and a child package.  Compare to
the equivalent Ada 83 code, which either combines everything into one
package, or else exports private information to clients.

Write some code that deals with money, using decimal types, and try to
write the same thing in Ada 83.

Etc.

- Bob