Sat, 23 Aug 2008 10:52:34 -0700 (PDT)

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: | Carter Cheng <cartercheng@gmail.com> |

Newsgroups: | comp.compilers |

Date: | Sat, 23 Aug 2008 10:52:34 -0700 (PDT) |

Organization: | Compilers Central |

Keywords: | analysis, question |

Posted-Date: | 23 Aug 2008 14:44:12 EDT |

Hello,

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?

Thanks in advance,

Carter.

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.