|Generating strings from regular expressions firstname.lastname@example.org (KSG) (1999-05-24)|
|Re: Generating strings from regular expressions Helmut.Richter@lrz-muenchen.de (1999-05-27)|
|Re: Generating strings from regular expressions email@example.com (Jonathan Barker) (1999-05-27)|
|Re: Generating strings from regular expressions firstname.lastname@example.org (Carsten Fritz) (1999-05-27)|
|Re: Generating strings from regular expressions email@example.com (1999-05-27)|
|From:||firstname.lastname@example.org (Darius Bacon)|
|Date:||27 May 1999 23:28:12 -0400|
|Organization:||Whole Earth Networks News|
>KSG <email@example.com> writes:
>>Does anyone know of any code or an algorithm that does the following:
>>input: a regular expression, R, and an integer k.
>>output: a list of all strings of length k that are in R
I'd try a bounded-depth traversal of the DFA for R (where the depth
bound is k).
define traverse(state, prefix, bound):
if 0 = bound and accepting(state):
else if 0 < bound:
for arc in outgoing_arcs(state):
traverse(head(arc), prefix ++ [label(arc)], bound - 1)
traverse(start_state(dfa_of_regex(R)), , k)
where [foo, ...] is a list, ++ appends lists, and the rest should be
obvious. The code could be tuned to use a stack instead of a list,
and to avoid traversing state/bound pairs more than once.
You could instead do a simple traversal without the bound, if you
first intersect R with the regular expression .^k (that is, the regex
with k successive arbitrary characters). I'm not sure whether that's
worthwhile -- I haven't tested this.
Darius Bacon http://www.well.com/~djello
Return to the
Search the comp.compilers archives again.