From cowan Tue Dec 12 10:37:07 1995
Subject: Re: LR(k)
From: John Cowan <cowan@ccil.org>
To: lojban@cuvmb.cc.columbia.edu (Lojban List)
Date: Tue, 12 Dec 1995 10:37:07 -0500 (EST)
In-Reply-To: <199512082149.QAA07311@locke.ccil.org> from "Paulo Barreto" at Dec 8, 95 02:37:00 pm
X-Mailer: ELM [version 2.4 PL24]
Content-Type: text
Content-Length:        560
Status: OR
Message-ID: <DnXAJtuVskN.A.qtF.nu0kLB@chain.digitalkingdom.org>

la paulos. cusku di'e

> This is a grammar problem, not a language one. Knuth's theorem states
> that *all* deterministic context-free languages have an LR(1) grammar.

I'm not familiar with the theorem.  Surely not all languages are LALR(1),
though, which is what standard Yaccs implement.  I looked into using an
LR(2) parser at one time, but it only ran on OS/2, which I no longer run,
and is proprietary.  (It was downward compatible with Yacc, but called
a routine yylex2() when necessary.)

-- 
John Cowan					cowan@ccil.org
		e'osai ko sarji la lojban.