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=0.2 required=5.0 tests=BAYES_00,INVALID_MSGID, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,eb425f6e2a82939b X-Google-Attributes: gid103376,public From: kilgallen@eisner.decus.org (Larry Kilgallen) Subject: Re: Ada compiler in BASIC? Date: 2000/04/16 Message-ID: <2000Apr16.192006.1@eisner>#1/1 X-Deja-AN: 612023938 References: <8db57c$g94$1@nnrp1.deja.com> <8dc7c2$j7f$1@nnrp1.deja.com> X-Trace: news.decus.org 955927208 3271 KILGALLEN [216.44.122.34] Organization: LJK Software Reply-To: Kilgallen@eisner.decus.org.nospam Newsgroups: comp.lang.ada Date: 2000-04-16T00:00:00+00:00 List-Id: In article <8dc7c2$j7f$1@nnrp1.deja.com>, Robert Dewar writes: > In article <8db57c$g94$1@nnrp1.deja.com>, > e_erpelding@hotmail.com wrote: >> I am trying to find the Byte magazine >> article about an Ada compiler written >> in BASIC. The article included the source >> code even! Does anyone know the issue >> it appeared in? Or, even better, is it on >> the net somewhere? > > > It would not be too hard to write an Ada 83 > compiler where the maximum line length (an > implementation dependent choice) was 2 :-) Are you proposing an implementation that accepted abbreviations for some of the longer common Ada words, like "end" ?