Related articles |
---|
Algorithm for computing first-k follow-k sets cartercheng@gmail.com (Carter Cheng) (2008-08-23) |
Re: Algorithm for computing first-k follow-k sets DrDiettrich1@aol.com (Hans-Peter Diettrich) (2008-08-24) |
Re: Algorithm for computing first-k follow-k sets felipeangriman@gmail.com (Felipe Angriman) (2008-08-24) |
Re: Algorithm for computing first-k follow-k sets cppljevans@suddenlink.net (Larry Evans) (2008-08-25) |
1:X in Choe's pdf (was Re: Algorithm for computing first-k follow-k se cppljevans@suddenlink.net (Larry Evans) (2008-08-25) |
Re: 1:X in Choe's pdf (was Re: Algorithm for computing first-k follow- cartercheng@gmail.com (Carter Cheng) (2008-08-25) |
Re: Algorithm for computing first-k follow-k sets felipeangriman@gmail.com (Felipe Angriman) (2008-08-26) |
From: | "Felipe Angriman" <felipeangriman@gmail.com> |
Newsgroups: | comp.compilers |
Date: | Sun, 24 Aug 2008 17:08:01 -0300 |
Organization: | Compilers Central |
References: | 08-08-049 |
Keywords: | parse |
Posted-Date: | 24 Aug 2008 20:01:10 EDT |
Carter, i think I've asked that question a while ago, but found no
satisfactory results.
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
but I THINK that the algorithm does not work on left-recursive
grammars (note: i haven't tried it)
The web site where i found the link is:
http://plus.kaist.ac.kr/~choe/
Regards,
On Sat, Aug 23, 2008 at 2:52 PM, Carter Cheng <cartercheng@gmail.com> wrote:
> This is probably pretty elementary but I havent been able to locate a
> method to compute first-k follow-k sets (i.e. the k terminals derived
> from a symbol or following that symbol) efficiently for a grammar.
> Most textbooks only seem to cover the k = 1 case. Are there references
> out there which contain how to compute the generalization to k > 1?
Return to the
comp.compilers page.
Search the
comp.compilers archives again.