From: David Pereira <dmrpereira@gmail.com>
Subject: Re: Ada 2012 grammar
Date: Thu, 24 Oct 2013 15:29:00 -0700 (PDT)
Date: 2013-10-24T15:29:00-07:00 [thread overview]
Message-ID: <849989b3-a161-42ce-84d1-e194a6cac3f8@googlegroups.com> (raw)
In-Reply-To: <qjnh8glnjdnx.18103uc3iehvi.dlg@40tude.net>
Quinta-feira, 24 de Outubro de 2013 21:19:28 UTC+1, Dmitry A. Kazakov escreveu:
> On Thu, 24 Oct 2013 08:01:13 -0700 (PDT), David Pereira wrote:
>
>
>
> > I would like to extend it to some new contract constructs, but writing a
>
> > complete parser is a huge (and extremely time-consuming) task that I would
>
> > like to avoid :).
>
>
>
> Difficult for parsing are only expressions. The language itself is very
>
> simple to parse using recursive descent parser, e.g. to generate an AST. To
>
> write a table-driven parse would be one-day work or so.
>
>
>
> Ada expressions parser can be found here:
>
>
>
> http://www.dmitry-kazakov.de/ada/components.htm#12.9
>
>
>
> However it is Ada 95. The difference AFAIK to Ada 2005 is reserved words
>
> like "interface" to filter out from identifiers. To Ada 2012 it is
>
> conditional expressions. Not difficult to add.
>
>
>
> I would not bother either with grammars.
>
>
>
> --
>
> Regards,
>
> Dmitry A. Kazakov
>
> http://www.dmitry-kazakov.de
Hi Dmitry,
Thanks for the pointer. I will carefully look at it.
Regards,
David
prev parent reply other threads:[~2013-10-24 22:29 UTC|newest]
Thread overview: 11+ messages / expand[flat|nested] mbox.gz Atom feed top
2013-10-24 15:01 Ada 2012 grammar David Pereira
2013-10-24 16:49 ` G.B.
2013-10-24 21:11 ` David Pereira
2013-10-26 2:07 ` Stephen Leake
2013-10-26 5:57 ` Shark8
2013-11-11 14:55 ` Stephen Leake
2013-10-24 16:55 ` Dan'l Miller
2013-10-24 17:05 ` Marc C
2013-10-24 21:12 ` David Pereira
2013-10-24 20:19 ` Dmitry A. Kazakov
2013-10-24 22:29 ` David Pereira [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox