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: tmoran@bix.com
Subject: Re: Ada83 equivalents for Ada95
Date: 1996/05/10
Message-ID: <4n00nj$130@news1.delphi.com>#1/1
X-Deja-AN: 154149374
organization: Delphi Internet Services Corporation
newsgroups: comp.lang.ada
Date: 1996-05-10T00:00:00+00:00
List-Id: <comp.lang.ada>


In <31927190.35AA@csehp3.mdc.com> James A. Squire asked:
>Has anybody gone to the trouble of translating code that uses features
>new to Ada95 back into its Ada83 equivalent?  If anyone knows of such
>examples that are available on the Internet, please let me know (email
  I too would be interested in seeing examples of techniques others
have used to approximate Ada 95 features in Ada 83.  Sometimes I'd
like to design something using Ada 95 constructs, but there is as
yet no adequate Ada 95 compiler for the target, while there is a
good Ada 83 compiler.  It would be nice to code with an eye toward
easing future changeover.  Surely this must be a common problem,
for which lots of folks have developed a set of techniques.