Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic

Re^4: Selecting HL7 Transactions (backtracking and partial anchors)

by LanX (Bishop)
on May 02, 2013 at 09:00 UTC ( #1031710=note: print w/replies, xml ) Need Help??

in reply to Re^3: Selecting HL7 Transactions
in thread Selecting HL7 Transactions

You have problems to understand backtracking, which is essentially a branch-and-bound recursion on partial regexes.

Partial matches of a regex are anchoring the start for recursive attempts to match the rest of the regex.

Quantifiers - greedy or non-greedy - only work from left to right. They won't force the left side to shrink as long as they do match to the right!

In the following examples the regex anchors at the semicolon before the quantifier /;(.)/ and tries to match further.

The starting point for each following match is after the last match.

But if the whole regex can't match, the backtracking forces the regex to try the next semicolon as an anchor.

DB<119> $x => "junk ;a;not;b;not;c;; junk ;d;not;e;; junk " DB<120> $x =~ /;(.*);;/g # greedy => 1 match first anch +oring ";" => "a;not;b;not;c;; junk ;d;not;e" DB<121> $x =~ /;(.*?);;/g # non-greedy => 2 matches on first + anchors => ("a;not;b;not;c", "d;not;e") DB<122> $x =~ /;([^;]*?);;/g # non-greedy, trying multiple anch +ors. => ("c", "e")

BTW: Did I mention that Friedl's book is a good read? =)

Cheers Rolf

( addicted to the Perl Programming Language)


from perlretut

The process of trying one alternative, seeing if it matches, and moving on to the next alternative, while going back in the string from where the previous alternative was tried, if it doesn't, is called backtracking. The term backtracking comes from the idea that matching a regexp is like a walk in the woods. Successfully matching a regexp is like arriving at a destination. There are many possible trailheads, one for each string position, and each one is tried in order, left to right. From each trailhead there may be many paths, some of which get you there, and some which are dead ends. When you walk along a trail and hit a dead end, you have to backtrack along the trail to an earlier point to try another trail. If you hit your destination, you stop immediately and forget about trying all the other trails. You are persistent, and only if you have tried all the trails from all the trailheads and not arrived at your destination, do you declare failure. To be concrete, here is a step-by-step analysis of what Perl does when it tries to match the regexp

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1031710]
[1nickt]: Haha, I was learning about Linux filesystem trees trying to understand how Moo fits.
[1nickt]: I just got my feet wet with some DBIC coding this last week. I feel "meh" about it so far. It was pretty easy to add a sub to the DBIC class to filter search results ...
[1nickt]: ... in the calling code ... $rs = $rs->maturity(" stable");. But I don;t enjoy feeling that far away from the SQL and the DB, really.
[1nickt]: The same project (CPAN Testers API) is using experimental signatures (and therefore 5.024) ... which is what replaced Method::Signatures , afaict.
[1nickt]: But the new $job is on an older Perl and therefore using M::S, the syntax of which looks clunky to me, so far.

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (10)
As of 2017-11-24 13:31 GMT
Find Nodes?
    Voting Booth?
    In order to be able to say "I know Perl", you must have:

    Results (349 votes). Check out past polls.