|Are there any pure grammar examples available? firstname.lastname@example.org (Russ Freeman) (1998-07-20)|
|Re: Are there any pure grammar examples available? email@example.com (Bob Collins) (1998-07-21)|
|Re: Are there any pure grammar examples available? firstname.lastname@example.org (1998-07-21)|
|Re: Are there any pure grammar examples available? email@example.com (1998-07-24)|
|From:||"Russ Freeman" <firstname.lastname@example.org>|
|Date:||20 Jul 1998 17:04:35 -0400|
Has anyone come across such a thing as a pure language grammar? What I
mean by pure is a language grammar that has not been "re-jigged" to
make parsing easier (e.g. LL(1)).
It strikes me that such a form would be more useful as a basis for
designing a clean and regular AST. Otherwise it seems that your design
may be bastardized to overcome limitations of parsing tools.
I'd be interested if anyone has heard of such a thing and
*particularly* if an example exists somewhere.
Return to the
Search the comp.compilers archives again.