Re: C++ Grammar

Aaron Gray writes:
> I have been looking at algorithms for generating an [LA]LR(k) parser
> generator, and think that I might be able to implement one soon, the area
> came into my head in a flash of realization, it is very simple, add an NFA
> at the front end of the PDA, so you have the ability to "delay" deteminacy
> until it is determinate, so to speak.


Well, that's not exactly [LA]LR(k), but it is another useful class of
languages--it's the [LA]LR-regular class.


> I am looking at creating my own YACC alike but [LA]LR(K) ....


Any particular reason why you are thinking of creating your own parser
generator? You can already find [LA]LR(k) and LR-regular parser
generators, several with syntax very close to yacc. See a recent
posting by Vladmir Makarov about MSTA, for example.


Hope this helps,
-Chris


*****************************************************************************
Chris Clark Internet : compres@world.std.com
Compiler Resources, Inc. Web Site : http://world.std.com/~compres
3 Proctor Street voice : (508) 435-5016
Hopkinton, MA 01748 USA fax : (508) 435-4847 (24 hours)

Return to the comp.compilers page.
Search the comp.compilers archives again.