Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.compilers    |    Compiler construction, theory, etc. (Mod    |    2,753 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 829 of 2,753    |
|    Juan Miguel Vilar to Fanta    |
|    Re: LL(k) vs Strong_LL(k)    |
|    26 Oct 06 00:30:25    |
      From: Juan.Miguel.Vilar@gmail.com              Fanta wrote:       > Dear Schmitz,       >       > Thanks for your words. But I wrote " the I've proved that the families       > of LL(k) language and families of Strong LL(k) (SLLk)) language are       > equal". It's here "language", not "grammar". By that sentence, I mean:       > for any LL(k) grammar G, there's a SLL(k) grammar G', such that: L(G)       > = L(G'). And ofcouse, each SLL(k) grammar is also a LL(k) grammar.       >       > Thank you very much.              You can find a proof for it in "Parsing Theory" of Seppo Sippu and       Eljas Soisalon-Soininen.              Regards,              Juan Miguel              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca