Re: Algorithm for computing first-k follow-k sets

Hans-Peter Diettrich <DrDiettrich1@aol.com>
Sun, 24 Aug 2008 01:18:07 +0200

          From comp.compilers
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)
Re: Algorithm for computing first-k follow-k sets felipeangriman@gmail.com (Felipe Angriman) (2008-08-26)
| List of all articles for this month |
From: Hans-Peter Diettrich <DrDiettrich1@aol.com>
Newsgroups: comp.compilers
Date: Sun, 24 Aug 2008 01:18:07 +0200
Organization: Compilers Central
References: 08-08-049
Keywords: parse, question
Posted-Date: 24 Aug 2008 14:43:07 EDT

Carter Cheng schrieb:


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


With k>1 you'll have sets of k-tuples, which make the tables explode.
References to procedures have just been mentioned in this group (see
ANTLR...).


DoDi

Post a followup to this message

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