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,417 of 2,753    |
|    Gilbert Mirenque to All    |
|    Recursive Descent Parsers only with LL(1    |
|    20 Aug 08 10:33:54    |
      From: formatzeh@gmx.de              Hello NG,              I'm not so familiar with compiler construction just interested in it.       What appears curious is that I have heard that it is only possible to       implement recursive descent parsers for LL(1)-grammars. But I imagine       that it isn't a problem to look ahead more than just one symbol. So my       question is why it is only possible for LL(1)-grammars?              greets       Gilbert              --- 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