|Re: Algorithm efficiently generating L(G), for a non-selfembedding CFG firstname.lastname@example.org (2001-03-31)|
|Re: Re: Algorithm efficiently generating L(G), for a non-selfembedding email@example.com (2001-04-04)|
|Re: Algorithm efficiently generating L(G), for a non-selfembedding CFG firstname.lastname@example.org (Joachim Durchholz) (2001-04-04)|
|Re: Re: Algorithm efficiently generating L(G), for a non-selfembedding email@example.com (Manoj Plakal) (2001-04-10)|
|From:||firstname.lastname@example.org (\"Gershon Miles\")|
|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
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.
Jerusalem College of Technology
[Can't you just walk the tree defined by the grammar? -John]
Return to the
Search the comp.compilers archives again.