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,2ca464c92c72e0e9 X-Google-Attributes: gid103376,public From: Robert A Duff Subject: Re: Ada grammar Date: 2000/05/30 Message-ID: #1/1 X-Deja-AN: 629140817 Sender: bobduff@world.std.com (Robert A Duff) References: <07a73f60.478cecce@usw-ex0102-015.remarq.com> <8euivq$qso$1@nnrp1.deja.com> <004d942d.2e326cd2@usw-ex0104-026.remarq.com> <3919D285.E046DC9F@acenet.com.au> <391B6BC1.5F9A0982@acenet.com.au> <8fjcc1$daq$1@nnrp1.deja.com> <188b596a.6e3c13b9@usw-ex0102-015.remarq.com> Organization: The World Public Access UNIX, Brookline, MA Newsgroups: comp.lang.ada Date: 2000-05-30T00:00:00+00:00 List-Id: bradders writes: > Many thanks to everyone who replied and offered their advice. > I've remained quiet up 'til now as a lot of information has been > flying about and I'm trying to take it all in. The first point > to make is that I have already written commercial parsers for C, > C++, Java, Delphi and Powerbuilder so I know what I'm doing and > Ada doesn't scare me ;-)(yet) An Ada parser isn't all that hard. It's probably easier than C (because of the typedef problem), but harder than Pascal. So long as you don't need to do name resolution, that is -- just parsing. - Bob