|Algorithms for computing first-K set firstname.lastname@example.org (Felipe Angriman) (2008-04-27)|
|Re: Algorithms for computing first-K set email@example.com (Etienne M. Gagnon) (2008-04-27)|
|From:||"Etienne M. Gagnon" <firstname.lastname@example.org>|
|Date:||Sun, 27 Apr 2008 20:51:43 -0400|
|Posted-Date:||27 Apr 2008 22:18:49 EDT|
Have a look at Terence Parr's Ph.D. thesis:
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).
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.
Return to the
Search the comp.compilers archives again.