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=2.1 required=5.0 tests=BAYES_05,INVALID_DATE,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!ucbvax!decwrl!labrea!sri-unix!trent
From: trent@unix.SRI.COM (Ray Trent)
Newsgroups: comp.lang.ada
Subject: Compiling Ada
Message-ID: <29329@sri-unix.SRI.COM>
Date: 5 Apr 89 20:38:51 GMT
Reply-To: trent@unix.sri.com (Ray Trent)
Organization: SRI, Menlo Park, CA.
List-Id: <comp.lang.ada>

A while ago, there was some discussion about ways in which Ada is 
difficult to compile. One of the comments was something about needing
an infinite look ahead lexical analyser (parser?). If anyone out there 
remembers the specific reason for this (something to do with attributes
conflicting with character literals, maybe?), I would appreciate it
if they could send me email.

Also, I'd be interested in a general discussion about compiling Ada.
Anyone have any good stories? :-)


-- 
"When you're down, it's a long way up
 When you're up, it's a long way down
 It's all the same thing
 And it's no new tale to tell"                      ../ray\..