regexp finite state machine?

Discussion in 'Perl Misc' started by Walter Roberson, Mar 8, 2005.

  1. 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!
     
    Walter Roberson, Mar 8, 2005
    #1
    1. Advertising

Want to reply to this thread or ask your own question?

It takes just 2 minutes to sign up (and it's free!). Just click the sign up button to choose a username and then you can ask your own questions on the forum.
Similar Threads
  1. deejayfred
    Replies:
    0
    Views:
    549
    deejayfred
    Oct 2, 2003
  2. SomeDude
    Replies:
    3
    Views:
    3,153
    arant
    Aug 14, 2006
  3. Inderkal
    Replies:
    8
    Views:
    1,254
    rickman
    Dec 9, 2004
  4. Gilles Lacroix
    Replies:
    3
    Views:
    176
    Gilles Lacroix
    Aug 3, 2006
  5. Georg Jaehnig

    RegExp as Finite State Machine

    Georg Jaehnig, Dec 30, 2008, in forum: Javascript
    Replies:
    21
    Views:
    347
    Thomas 'PointedEars' Lahn
    Jan 7, 2009
Loading...

Share This Page