Re: LALR Grammar Analyzer reads EBNF Notation

"Jan Neumueller" <nasan@slayers.de>
30 Apr 2001 22:20:16 -0400

          From comp.compilers
Related articles
LALR Grammar Analyzer reads EBNF Notation paul@parsetec.com (Paul Mann) (2001-04-12)
Re: LALR Grammar Analyzer reads EBNF Notation nasan@slayers.de (Jan Neumueller) (2001-04-30)
| List of all articles for this month |
From: "Jan Neumueller" <nasan@slayers.de>
Newsgroups: comp.compilers
Date: 30 Apr 2001 22:20:16 -0400
Organization: T-Online
References: 01-04-072
Keywords: parse
Posted-Date: 30 Apr 2001 22:20:16 EDT

Hi!


> LALR grammar analyzer which reads EBNF notation.
>
> This is freeware available at:
> www.parsetec.com/products.html
>
> Useful features are:
> [Feature-List]


Sounds good ^.^




> It is the most concise EBNF notation I have seen,
> more concise that ISO EBNF.
>
> For example: [x | y | z] /',' ...
>
> indicates an optional comma-separated list of
> x or y or z. All of the following would be valid:
>
> /* nothing */
> x
> x, x, x
> y, z, x, y, z, z, y, x
>
> I would like to see a more concise notation for this
> if anyone has one.


Well I think this is better (it's in Wirth-EBNF):
[ ( x | y | z ) { "," ( x | y | z ) } ]


It is not so short, but I think it visualizes the syntax much better.


Jan Neumueller

Post a followup to this message

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