http://qs321.pair.com?node_id=683985


in reply to Re^3: Matching lines in 2+ GB logfiles.
in thread Matching lines in 2+ GB logfiles.

Perl's regular expression engine may be powerful but it doesn't yet use an "infinite" state machine! I think the terms you're looking for are NFA (Nondeterministic Finite Automaton, like Perl) and DFA (Deterministic Finite Automaton, like egrep, sometimes, it's actually a hybrid).

-sam

  • Comment on Re^4: Matching lines in 2+ GB logfiles.

Replies are listed 'Best First'.
Re^5: Matching lines in 2+ GB logfiles.
by mscharrer (Hermit) on May 01, 2008 at 18:35 UTC
    Yes, you are right, that was exactly what I meant. I confused some terms here. Thanks for pointing this out.