|Regexps from DFA email@example.com (G Venkatesha Murthy) (1997-02-02)|
|Re: Regexps from DFA firstname.lastname@example.org (1997-02-03)|
|Re: Regexps from DFA email@example.com (1997-02-03)|
|Re: Regexps from DFA firstname.lastname@example.org (1997-02-07)|
|Re: Regexps from DFA email@example.com (1997-02-07)|
|Re: Regexps from DFA firstname.lastname@example.org (Philip Lijnzaad) (1997-02-07)|
|From:||email@example.com (Anton Ertl)|
|Date:||3 Feb 1997 13:41:35 -0500|
|Organization:||Institut fuer Computersprachen, Technische Universitaet Wien|
G Venkatesha Murthy <firstname.lastname@example.org> writes:
> We recently had a post asking what regexp would describe a given set
> of strings.
Perhaps what you are searching for would be accomplished by a tool
like this: Given a set of example strings that are in your language
("in"), and a set of strings that are not in your language ("out"),
return the simplest RE (according to some metric, e.g., number of RE
operators) for a language that is a superset of the "in" set, and
disjoint from the "out" set.
It should be possible to find a solution in finite time by enumerating
all REs, starting with the simplest, but this method may take too long
to be practical for interesting REs.
M. Anton Ertl
Return to the
Search the comp.compilers archives again.