If you want to do this from scratch, you'll have to first parse regex using some grammar. You can use
Parse::RecDescent, but make sure the grammar is right recursive. Once you get the parse tree, you can construct possible matches. If you want to handle kleene closures (*), then I would only generate the possibilies where there is no S and 1 S - don't go down the S* road unless you had to.
This is a very interesting problem, and I am currently working on a set of modules that let you play around with finite automatas for grad school. I have an NFA->DFA going, and I am about to do a RE->DFA; one of my additional goals is to iteratively generate a set of strings that can be produced given a DFA or RE.
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.