ES parsing tools (Re: Short Functions)

Brendan Eich brendan at
Thu Jun 9 20:07:24 PDT 2011

Proving two CFGs generate the same language is in general undecideable.

Refactoring the spec's LR(1) grammar (carefully, showing your work) to an LL(1) grammar with ordered choice, plus testing your work, would be ok by me.


On Jun 9, 2011, at 8:48 PM, Breton Slivka <zen at> wrote:

> (and I was doing so well with picking the right "from" email address)
> On Mon, May 30, 2011 at 5:55 AM, Brendan Eich <brendan at> wrote:
>> The validation we'd need would be
>> that both grammars produce sentences only and exactly in the same language.
>> /be
> Relating to my own grammar experiments, what would be sufficient
> validation that a language with an experimental grammar is
> "Compatible" with the existing language? Passing all the
> V8/spidermonkey tests? or something more akin to a mathematical proof
> of correctness?
> _______________________________________________
> es-discuss mailing list
> es-discuss at

More information about the es-discuss mailing list