Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re: A Regexp Assembler/Compiler

by RMGir (Prior)
on Jun 19, 2002 at 15:27 UTC ( [id://175722]=note: print w/replies, xml ) Need Help??


in reply to A Regexp Assembler/Compiler

Not _exactly_ what you want, but you can start from Regex::PreSuf.

You'd have to be able to enumerate the roman numerals you want to match to be able to use it directly, though...

$ perl -MRegex::PreSuf -e'my $re = presuf(qw(I II III IV V VI VII VIII + IX X)); print "$re\n";' (?:I(?:II|[IVX])|VI(?:II|I)?|[IVX])
That could get pretty wild :)
--
Mike

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://175722]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others chanting in the Monastery: (3)
As of 2024-04-20 03:38 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found