by "Etienne M. Gagnon" <egagnon@[EMAIL PROTECTED]
>
Apr 27, 2008 at 08:51 PM
Hi Felipe,
Have a look at Terence Parr's Ph.D. thesis:
http://www.antlr.org/papers/parr.phd.thesis.pdf
The outlined algorithm computes the set of tokens at distance K, which
allows for computing a linear approximation of LL(K). So, this might
not be exactly what you are looking for (but it could be quite useful
for practical purpose).
Etienne
Felipe Angriman wrote:
> Can anyone provide a reference to paper or other type of material
> where I can read how to compute the FIRST-K Sets of a Grammar?
--
Etienne M. Gagnon, Ph.D.
