Re: Parsing Ada?

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

On Wed, 3 Jun 2015 17:39:40 -0500, Randy Brukardt wrote:

> "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de> wrote in message 
> news:7cpxfz18lg2r$.ymcopru7qn8x.dlg@40tude.net...
>> 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.
> 
> There's a lot more to the equation than a parse, though. And if you can 
> write a correct recursive descent parser for all of Ada in a "couple of 
> hours", you're a genius *and* can type at an inhuman rate.

No for all Ada of course, only for the things which are neither expressions
(including fully qualified names) nor comments. It would be insane to use a
recursive descent parser for expressions. But the result would be a full
Ada parser.

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