How test if language is LL(k) or LR(k) ?

Borneq <a.moderacja@gmail.com>
Thu, 23 Oct 2008 13:13:12 -0700 (PDT)

          From comp.compilers

Related articles
How test if language is LL(k) or LR(k) ? a.moderacja@gmail.com (Borneq) (2008-10-23)
Re: How test if language is LL(k) or LR(k) ? cfc@shell01.TheWorld.com (Chris F Clark) (2008-10-28)
Re: How test if language is LL(k) or LR(k) ? sh006d3592@blueyonder.co.uk (Stephen Horne) (2008-10-29)
Re: How test if language is LL(k) or LR(k) ? rpboland@gmail.com (Ralph Boland) (2008-10-31)
Re: How test if language is LL(k) or LR(k) ? cfc@shell01.TheWorld.com (Chris F Clark) (2008-11-06)
Re: How test if language is LL(k) or LR(k) ? torbenm@pc-003.diku.dk (2008-11-07)
Re: How test if language is LL(k) or LR(k) ? ulf.schwekendiek@googlemail.com (ulf.schwekendiek@googlemail.com) (2008-11-07)
[4 later articles]
| List of all articles for this month |

From: Borneq <a.moderacja@gmail.com>
Newsgroups: comp.compilers
Date: Thu, 23 Oct 2008 13:13:12 -0700 (PDT)
Organization: Compilers Central
Keywords: parse, LL(1), LR(1), question
Posted-Date: 23 Oct 2008 18:06:39 EDT

Where k is not specified.
I would not testing if is LL(1),LL(2),LL(3) to infinity but test if
language if LL(k) and would be nice if algorithm return k, find k for
LL(k) LR(K) in finite time.


Post a followup to this message

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