closure of a simple grammar? (Eric Kascic)
Wed, 22 Nov 1995 21:14:34 GMT

          From comp.compilers

Related articles
closure of a simple grammar? (1995-11-22)
| List of all articles for this month |

Newsgroups: comp.compilers
From: (Eric Kascic)
Keywords: parse, testing, comment
Organization: Project GLUE, University of Maryland, College Park, MD
Date: Wed, 22 Nov 1995 21:14:34 GMT

Hi all. I am wondering if there is some code out there for
generating the closure of a regular grammar, such that it
would list all legal strings with less then or equal to some arbitray n
of tokens?

-or- is there something that makes this not possible? (and i shouldn't
try writing such a program)
[I'd think that if you looked at the grammar as an infinite tree, and walked
the tree, pruning when the generated strings got past length N, that would
do the trick. -John]

Post a followup to this message

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