Velocity Reviews - Computer Hardware Reviews

Velocity Reviews > Newsgroups > Programming > Perl > Perl Misc > regexp finite state machine?

Reply
Thread Tools

regexp finite state machine?

 
 
Walter Roberson
Guest
Posts: n/a
 
      03-08-2005
A few years ago, someone posted here with a reference to a module that
compiled standard regular expressions into a finite state machine
that could then be invoked. Sort of the reverse of DFA::Kleene,
and not requiring the full power of Parse::Lex because the only
necessary output is match / nomatch. Standard grep type regexps
are sufficient -- just the | [] . + * operators together
with ^ $ anchoring.

Would someone be able to steer me to the appropriate module?


(perl's pattern matcher does backtracking because it needs to be
more expressive than standard RE's. Regexp::Assemble helps some,
but still requires that perl's pattern matter be used; for what
I am doing, I am hoping for something that is time dependant
only on the length of the input string and independant of the
number of simple RE's being alternated.)
--
Look out, there are llamas!
 
Reply With Quote
 
 
 
Reply

Thread Tools

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are On
Pingbacks are On
Refbacks are Off


Similar Threads
Thread Thread Starter Forum Replies Last Post
[regexp] How to convert string "/regexp/i" to /regexp/i - ? Joao Silva Ruby 16 08-21-2009 05:52 PM
RegExp as Finite State Machine Georg Jaehnig Javascript 21 01-07-2009 05:29 PM
Building the finite state machine of a Ruby regexp Gilles Lacroix Ruby 3 08-03-2006 10:16 PM
How to implement linked Finite State Machines Sidney Cadot VHDL 0 04-18-2004 10:45 AM
HELP PLEASE!! - Finite State Machine - Automaton - Microprogrammed System deejayfred VHDL 0 10-02-2003 01:23 AM



Advertisments