|
|
|
| Pathologically Eclectic Rubbish Lister | |
| PerlMonks |
Re^4: Matching lines in 2+ GB logfiles.by samtregar (Abbot) |
| on May 01, 2008 at 18:24 UTC ( [id://683985]=note: print w/replies, xml ) | Need Help?? |
|
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
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||||