31 Mar 2001 02:53:11 -0500

Related articles |
---|

Re: Algorithm efficiently generating L(G), for a non-selfembedding CFG miles@mail.jct.ac.il (2001-03-31) |

Re: Re: Algorithm efficiently generating L(G), for a non-selfembedding miles@mail.jct.ac.il (2001-04-04) |

Re: Algorithm efficiently generating L(G), for a non-selfembedding CFG joachim_d@gmx.de (Joachim Durchholz) (2001-04-04) |

Re: Re: Algorithm efficiently generating L(G), for a non-selfembedding plakal@cs.wisc.edu (Manoj Plakal) (2001-04-10) |

From: | miles@mail.jct.ac.il (\"Gershon Miles\") |

Newsgroups: | comp.compilers |

Date: | 31 Mar 2001 02:53:11 -0500 |

Organization: | Mailgate.ORG Server - http://www.Mailgate.ORG |

Keywords: | parse, theory, comment |

Posted-Date: | 31 Mar 2001 02:53:11 EST |

I am looking for an time-efficient algorithm to generate all words of

a context free grammar G.

In my application the language, L(G), is finite so there are no

self-embedding variables.

Speed is my #1 concern, but I am seeking a practical algorithm that

could be run on a PC, where L(G) has up to millions of words.

Gershon Miles

Jerusalem College of Technology

miles@mail.jct.ac.il

[Can't you just walk the tree defined by the grammar? -John]

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.