LL(k) vs Strong_LL(k)

Fanta <anha2k47@gmail.com>
21 Oct 2006 02:26:24 -0400

          From comp.compilers

Related articles
LL(k) vs Strong_LL(k) anha2k47@gmail.com (Fanta) (2006-10-21)
Re: LL(k) vs Strong_LL(k) schmitz@i3s.unice.fr (Sylvain Schmitz) (2006-10-21)
Re: LL(k) vs Strong_LL(k) anha2k47@gmail.com (Fanta) (2006-10-24)
Re: LL(k) vs Strong_LL(k) Juan.Miguel.Vilar@gmail.com (Juan Miguel Vilar) (2006-10-26)
| List of all articles for this month |

From: Fanta <anha2k47@gmail.com>
Newsgroups: comp.compilers
Date: 21 Oct 2006 02:26:24 -0400
Organization: Compilers Central
Keywords: parse, theory, question

Hi everybody.
  I've proved that the families of LL(k) language and families of
Strong LL(k) (SLL(k)) language are equal. It's very meaningful for
LL(k) grammar analysis. But I wonder if it is a new result or not, is
there any person who already proofed if before. Coud anyone tell me.
Thank you very much.



Post a followup to this message

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