Re: Q: recent Ada grammar for Ada tools ?

[Robert A Duff <bobduff@shell01.TheWorld.com>]

Georg Bauhaus <bauhaus+rm.tsoh@maps.futureapps.de> writes:

> Wouldn't the sources of the LRM have the grammar rules marked up such
> that they can be extracted?

Yes.  In fact, that's already done -- Annex P, "Syntax Summary"
is just that.

However, the RM grammar is not what you want for AYACC, which I believe
is a LALR(1) parser generator.  The RM grammar is ambiguous, for one
thing.  E.g., what is "X(Y)" in the following:

    A := X(Y);

function_call, type_conversion, indexed_component?
If it's a function_call, what is "X" -- name or
implicit_dereference?

According to the grammar, it can be any of the above,
and some I didn't mention.

Here's an interesting part of the RM grammar:

    prefix ::= name | implicit_dereference
    implicit_dereference ::= name

>...I have never seen the sources and
> I don't know whether they are publicly available at all (like the
> processed sources are).

Surely they're publicly available somewhere?
Maybe Randy can tell us.

- Bob