Re: Algorithm for computing first-k follow-k sets

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]

Return to the comp.compilers page.
Search the comp.compilers archives again.