I created a new parser generator

[porton@ex-code.com (Victor Porton)]

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.