Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #1037
| From | Rui Maciel <rui.maciel@gmail.com> |
|---|---|
| Newsgroups | comp.programming |
| Subject | Re: How to construct LL(k) tables? |
| Date | 2011-11-13 14:11 +0000 |
| Organization | Aioe.org NNTP Server |
| Message-ID | <j9oj7c$7l5$1@speranza.aioe.org> (permalink) |
| References | <j9ogdn$r8i$1@news.onet.pl> |
Borneq wrote: > To construct LL(1) table M: > for each production A->alpha do: > for each terminal a from FIRST(alpha) (a<>eps) add production A->alpha > to M[A,a] > if eps is in FIRST(alpha), for each b from FOLLOW(A) add A->alpha to > M[A,b] > > If grammar is not LL(1) in one table position will be more than one > production. Can I construct LL(k) tables simply by splitting cells with > more than one production? Which is algorithm to production choosing ? Hi, Borneq. I believe that you will get better answers by posting your question to comp.compilers, as those who follow that group tend to be directly involved with the implementation and even research of that type of problems. Hope this helps in any way, Rui Maciel
Back to comp.programming | Previous | Next — Previous in thread | Find similar
How to construct LL(k) tables? Borneq <borneq@antyspam.hidden.pl> - 2011-11-13 14:24 +0100 Re: How to construct LL(k) tables? Rui Maciel <rui.maciel@gmail.com> - 2011-11-13 14:11 +0000
csiph-web