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 1,483 of 2,753 |
| Borneq to All |
| How test if language is LL(k) or LR(k) ? |
| 23 Oct 08 13:13:12 |
From: a.moderacja@gmail.com 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. --- SoupGate-Win32 v1.05 * Origin: you cannot sedate... all the things you hate (1:229/2) |
(c) 1994, bbs@darkrealms.ca