Sun, 27 Apr 2008 21:13:42 -0300

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) |

From: | "Felipe Angriman" <felipeangriman@gmail.com> |

Newsgroups: | comp.compilers |

Date: | Sun, 27 Apr 2008 21:13:42 -0300 |

Organization: | Compilers Central |

Keywords: | parse, question |

Posted-Date: | 27 Apr 2008 20:37:46 EDT |

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?

I Have googled around with phrases such as "computing first k set",

but didn't found any satisfactory result. The only thing I've found

are places with first-1 algorithm.

Thanks in advance, and i apologize for any writing errors

--

Felipe Josi Angriman

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.