Re: Algorithms for computing first-K set

"Etienne M. Gagnon" <egagnon@j-meg.com>
Sun, 27 Apr 2008 20:51:43 -0400

          From comp.compilers
Related articles
Algorithms for computing first-K set felipeangriman@gmail.com (Felipe Angriman) (2008-04-27)
Re: Algorithms for computing first-K set egagnon@j-meg.com (Etienne M. Gagnon) (2008-04-27)
| List of all articles for this month |
From: "Etienne M. Gagnon" <egagnon@j-meg.com>
Newsgroups: comp.compilers
Date: Sun, 27 Apr 2008 20:51:43 -0400
Organization: Compilers Central
References: 08-04-102
Keywords: parse
Posted-Date: 27 Apr 2008 22:18:49 EDT

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.

Post a followup to this message

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