Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

Re: Regexp::Graph 0.01

by larsen (Parson)
on Nov 24, 2001 at 23:27 UTC ( [id://127293]=note: print w/replies, xml ) Need Help??


in reply to Regexp::Graph 0.01

Cool. However, I'd suggest to change its name: regular expressions are strictly related to finite automata, and finite automata to graphs. Reading Regex::Graph I thought it was a tool that converts a RE in a Graph representing the finite automata described by the RE.

Maybe I'm supposed to provide a different name :). What about Regex::Graphic? (Regex::Fancy? :-) )

Replies are listed 'Best First'.
Re: Re: Regexp::Graph 0.01
by converter (Priest) on Nov 24, 2001 at 23:30 UTC

    Yes, the name is a problem. I'm open to suggestions.

      Regexp::Pretty::Results or Regexp::Results::Pretty?

      --
      perl -p -e "s/(?:\w);([st])/'\$1/mg"

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others romping around the Monastery: (5)
As of 2024-03-28 23:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found