Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"

Re: Explanation for Reg Expr

by reasonablekeith (Deacon)
on Mar 01, 2007 at 16:34 UTC ( #602714=note: print w/replies, xml ) Need Help??

in reply to Explanation for Reg Expr

have a look at the "look-ahead assertion" in "perldoc perlre"

Your code is just an example to show that normally (when the g switch is set) a regex engine will start looking for it's next match _after_ the last character of the previous match. However, characters matched in a look-ahead assertion don't 'count' as far as the regex engine is concerned, and it will not automatically skip over them when trying to find the next match.

It's an advanced topic, and I really think you'd need to understand how regex engines work to understand this, to which end I'd highly recommend Jeffrey Friedl's Mastering Regular Expressions.

UPDATE: changed wording in second paragraph

my name's not Keith, and I'm not reasonable.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (2)
As of 2022-08-18 04:00 GMT
Find Nodes?
    Voting Booth?

    No recent polls found