Re: Parsing Ada?

["Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>]

On Tue, 02 Jun 2015 13:33:07 +0200, Jacob Sparre Andersen wrote:

> I would prefer to compile the grammar to Ada source text,
> which I then could compile into the program.

That is the core of the problem, then. Why would you do such thing? To
parse Ada you only need a recursive descent parser which is a couple of
hours to write.

> What open source parsers/parser generators are there for use in Ada
> programs?  And what are your experiences with them?

I never bothered to write an Ada program parser because I considered it
trivial. All small compilers I wrote, from some very strange languages used
in automation, are recursive descent plus expression parser (if necessary).

This goes for each case statement at each level of the recursive descent
parser:

http://www.dmitry-kazakov.de/ada/components.htm#12.4.4

I don't know how many would be, a half of dozen, I suppose. Ada is a well
structured regular language.

This is for getting/skipping an expression:

http://www.dmitry-kazakov.de/ada/components.htm#12.9

This is to skip blanks in the source:

http://www.dmitry-kazakov.de/ada/components.htm#12.4.2

That's it. No structures/trees ever needed unless you generate them
yourself.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de