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,ca0b11ae1c9a00cb
X-Google-Attributes: gid103376,public
From: Andi Kleen <ak@muc.de>
Subject: Re: Papers saying Ada as an overly complex language and hard to
 implement
Date: 1998/02/17
Message-ID: <m3sopipi4w.fsf@fred.muc.de>#1/1
X-Deja-AN: 325844417
Distribution: world
Sender: andi@fred.muc.de
References: <34E7B551.115C289F@cs.utexas.edu> <dewar.887600858@merv>
 <Pine.BSF.3.96.980216123342.22587A-100000@shell5.ba.best.com>
 <dewar.887669672@merv>
 <Pine.BSF.3.96.980216154526.16866B-100000@shell5.ba.best.com>
Organization: [posted via] Leibniz-Rechenzentrum, Muenchen (Germany)
Newsgroups: comp.lang.ada
Date: 1998-02-17T00:00:00+00:00
List-Id: <comp.lang.ada>


Brian Rogoff <bpr@shell5.ba.best.com> writes:
> 
> Agreed that parsing is "in the noise", but I think the difficulty of
> writing a correct parser which handles all of C++ is well known. That's a 
> question which comes up on the compiler newsgroup frequently, and so far 
> I don't think there is a freely available or PD parser which handles 
> anything beyond ATT v2.x. Also, parsers are used in other source analysis 
> programs than compilers, so the ease of writing a parser for a language
> has some impact on other tools. 

Both the g++ 2.8.0 parser (which is bison based) and the parser used on the
TenDRA system (which is build around a home-grown parser generator) 
parse reasonable recent C++ and are freely available.

-Andi