Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris

(dchetlin: DFA) RE: (Ovid) Re: Regular Expression matching question

by dchetlin (Friar)
on Oct 25, 2000 at 01:20 UTC ( #38227=note: print w/ replies, xml ) Need Help??

in reply to (Ovid) Re: Regular Expression matching question
in thread Regular Expression matching question

  • Incidentally, Perl uses a traditional NFA engine for regex matching. If it used the POSIX-NFA engine or a DFA engine, your regex would work as you expect because those engines try to find the longest match that satisfies the regex.

Weeeeell, kinda. A DFA engine in general can't do backreferences, so he wouldn't have been able to test the $1 thing to begin with...

You're right about the POSIX NFA, though. Of course, no one would use Perl RExen if they were POSIX NFAs, as they'd be too slow. But you knew that :-).


Comment on (dchetlin: DFA) RE: (Ovid) Re: Regular Expression matching question

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (6)
As of 2015-10-14 03:24 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (320 votes), past polls