|regular expression generation firstname.lastname@example.org (Ralph Boland) (2010-01-31)|
|Re: regular expression generation DrDiettrich1@aol.com (Hans-Peter Diettrich) (2010-02-02)|
|Re: regular expression generation email@example.com (Matthias-Christian Ott) (2010-02-02)|
|From:||Ralph Boland <firstname.lastname@example.org>|
|Date:||Sun, 31 Jan 2010 10:50:14 -0800 (PST)|
|Keywords:||lex, parse, testing|
|Posted-Date:||01 Feb 2010 18:25:23 EST|
I am building a finite state machine generator.
It currently has the ability to generate random
regular expressions for testing the engine
but the generation of random character classes
(i.e. expressions of the form [ab-ew-zA-CD;@&])
is not supported.
I was wondering if anyone has done this and can
give me ideas on the best way to do so.
Some user level control of the randomization process
is desired. For example with binary operators I can
make assignments as to the probabilities of each binary
operator being used.
P.S. I am also designing (not yet implementing) a parser generator
tool. If anybody has implemented a random context free grammar
generator (preferably supporting regular right hand sides) that could
be useful in testing parsers and is open source I would like to see
Note that I plan for my finite state machine generator
and parser generator to be open source and free.
Return to the
Search the comp.compilers archives again.