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,423 of 2,753    |
|    Larry Evans to Felipe Angriman    |
|    Re: Algorithm for computing first-k foll    |
|    25 Aug 08 06:14:24    |
      From: cppljevans@suddenlink.net              On 08/24/08 15:08, Felipe Angriman wrote:       [snip]       > Kwang-Moo Choe, outlines an algorithm for computing First(k) Sets and       > Follow(k) Sets here:       >       > http://plus.kaist.ac.kr/~choe/cs522/cs522/pdf/5par-SLL(k).pdf              Page 1 of that pdf uses notation:               k:alpha beta              without defining what : means. My first guess is that it       takes the first k elements of an A^* if they exist; however,       that's not clear. Mr. Choe probably defines : in his       class room and say no need to repeat it on the .pdf.              >       > but I THINK that the algorithm does not work on left-recursive       > grammars (note: i haven't tried it)              Page 5 of that pdf says G (I guess a grammar)       is not LL(k) if G is left-recursive. so, I guess the       algorithm does not work on left-recursive grammars.              [snip]              --- 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