Mon, 25 Aug 2008 06:14:24 -0500

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: | Larry Evans <cppljevans@suddenlink.net> |

Newsgroups: | comp.compilers |

Date: | Mon, 25 Aug 2008 06:14:24 -0500 |

Organization: | Compilers Central |

References: | 08-08-049 08-08-057 |

Keywords: | parse |

Posted-Date: | 25 Aug 2008 08:16:17 EDT |

On 08/24/08 15:08, Felipe Angriman wrote:

[snip]

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

Page 1 of that pdf uses notation:

k:alpha beta

without defining what : means. My first guess is that it

takes the first k elements of an A^* if they exist; however,

that's not clear. Mr. Choe probably defines : in his

class room and say no need to repeat it on the .pdf.

*>*

*> but I THINK that the algorithm does not work on left-recursive*

*> grammars (note: i haven't tried it)*

Page 5 of that pdf says G (I guess a grammar)

is not LL(k) if G is left-recursive. so, I guess the

algorithm does not work on left-recursive grammars.

[snip]

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.