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.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,ee3ed96a2a873454,start
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2003-02-12 07:37:37 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!bloom-beacon.mit.edu!iad-peer.news.verio.net!news.verio.net!newsfeed.vmunix.org!news-peer.gradwell.net!not-for-mail
Mime-Version: 1.0
X-Newsreader: knews 1.0b.1
From: porton@ex-code.com (Victor Porton)
Subject: I created a new parser generator
Newsgroups: comp.lang.ada
Content-Type: text/plain; charset=us-ascii
Message-ID: <E18iyw9-0001BW-00@porton.narod.ru>
Date: Wed, 12 Feb 2003 20:36:37 +0500
Organization: Extreme Code Software (http://ex-code.com)
X-URL: http://www.ex-code.com/
NNTP-Posting-Date: 12 Feb 2003 15:37:36 GMT
NNTP-Posting-Host: 195.149.39.13
X-Trace: 1045064256 news.gradwell.net 350 mail2news/195.149.39.13
X-Complaints-To: news-abuse@gradwell.net
Xref: archiver1.google.com comp.lang.ada:34024
Date: 2003-02-12T15:37:36+00:00
List-Id: <comp.lang.ada>

I created a library which allows to write parsers of arbitrary streams 
(e.g. streams of unicode characters or even streams of container 
objects) entirely in Ada. (You write Ada files yourself, not a
program would convert to Ada from a special parser language, there a no 
such language).

Library is very extensive and customizable (probably more than any 
other parser toolkit). It is important for reliability that there are
no problems with look ahead (as in many other parser generators) for
the price of that the library is may be slower.

This library has a deficiency: generally (in the worst case) for each
extractor subtype you create (what is sometimes needed to introduce a 
new syntax construct) you need three things: define the subtype itself, 
define an instance of it and define a function which returns access to 
that instance. This is only for the case of complex recursion of syntax
constructs. Well, if you are interested I can as well introduce a 
meta-language to eliminate this problem.

Are you interested despite of this deficiency? If there are the market 
(i.e. c.l.a will answer yes), I will publish it both as GPL and
commercially.

Now it is pre-alpha and Extreme Code uses it internally.