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,ea81c3e062ea7ba4
X-Google-Attributes: gid103376,public
From: Mats Weber <Mats.Weber@elca-matrix.ch>
Subject: Re: Actual  Ada style: type names and unary +
Date: 1998/01/22
Message-ID: <34C79644.D3D279B8@elca-matrix.ch>#1/1
X-Deja-AN: 318388756
Content-Transfer-Encoding: 7bit
References: <34c177d8.17705498@SantaClara01.news.InterNex.Net>
 <34c23271.734660@SantaClara01.news.InterNex.Net>
Content-Type: text/plain; charset=us-ascii
Organization: ELCA Matrix SA
Mime-Version: 1.0
Reply-To: Mats.Weber@elca-matrix.ch
Newsgroups: comp.lang.ada
Date: 1998-01-22T00:00:00+00:00
List-Id: <comp.lang.ada>


> If someone with a true Ada parser
> would do a fuller study of a large, diverse body of existing Ada
> source code, it would be a contribution to knowledge and an aid in
> stepping beyond theological argument, IMHO.

There is an Ada lexical analyzer in the code I just posted under the subject:
RTF_Ada_File utility (but it is very slow). There also is one in the GNAT
sources, of course.