Re: C++ Grammar

Chris F Clark <>
17 Aug 2001 00:13:00 -0400

          From comp.compilers

Related articles
[4 earlier articles]
Re: C++ Grammar (Aaron Gray) (2001-08-15)
Re: C++ Grammar (Gabriel Dos Reis) (2001-08-15)
Re: C++ Grammar (Aaron Gray) (2001-08-15)
Re: C++ Grammar (Gabriel Dos Reis) (2001-08-16)
Re: C++ Grammar (2001-08-17)
Re: C++ Grammar (Jerry Evans) (2001-08-17)
Re: C++ Grammar (Chris F Clark) (2001-08-17)
Re: C++ Grammar (Ira D. Baxter) (2001-08-18)
Re: C++ Grammar (2001-08-18)
Re: C++ Grammar (Aaron Gray) (2001-08-20)
C++ Grammar 75024.3236@CompuServe.COM (Chris Hockett) (1996-03-25)
| List of all articles for this month |

From: Chris F Clark <>
Newsgroups: comp.compilers
Date: 17 Aug 2001 00:13:00 -0400
Organization: Compilers Central
References: 01-08-037 01-08-046 01-08-055 01-08-058
Keywords: C++, parse
Posted-Date: 17 Aug 2001 00:13:00 EDT

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 Clark Internet :
Compiler Resources, Inc. Web Site :
3 Proctor Street voice : (508) 435-5016
Hopkinton, MA 01748 USA fax : (508) 435-4847 (24 hours)

Post a followup to this message

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