Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses

Re: Regex help needed

by ansh batra (Friar)
on Apr 23, 2012 at 11:09 UTC ( #966578=note: print w/replies, xml ) Need Help??

in reply to Regex help needed

$data = "Johnson%Andrew%AX321%Engineer" ; if($data=~ /.*%.*%A/) { @arr=split('%', $data); print "$arr[0] $arr[1]"; }
Asumption->both first name and last name will always be there and seperated by '%'

Replies are listed 'Best First'.
Re^2: Regex help needed
by davido (Archbishop) on Apr 23, 2012 at 16:03 UTC

    anish_batra: Here is why your solution is broken in almost the same way as the original poster's code. This will be a slight oversimplification.

    The regexp engine loves to find matches. It's its duty to find them. You are giving it all the tools it needs to match the following string:

    $data = "Johnson%Andrew%BX321%Accountant";

    Here's why:

    • .* will greedily match as big of a string as possible (or nothing at all), so long as a '%' character comes next. In this case, on first pass, it will match "Johnson%Andrew%BX321", stopping just before the "%Accountant" portion of the string...
    • Next, the RE engine moves on to the second .*% term. Oh oh.... for this to match, it needs to backtrack to the first subexpression again.
    • Back to the first sub-expression... The original .*% has been told it was too greedy. Now it tries again and this time matches, "Johnson%Andrew%".
    • Now the second subexpression is allowed to match "BX321%"
    • Finally, 'A' is matched from "Accountant".
    • The regexp engine has done its job: It found a way to make "Johnson%Andrew%BX321%Accountant" match.

    But that's not what the OP actually wanted to have happen. He wanted strings like "Johnson%Andrew%AX321%Accountant" to pass, and "Johnson%Andrew%BX321%Accountant" to fail. You simply showed him another way to get the wrong result again. And, in fact, your solution results in some backtracking within the RE engine, so not only does it provide false positives, it does so inefficiently.

    Either you didn't understand the question, or you did understand it, but didn't test your code. There's no shame in considering a solution that doesn't work. The problem is when it gets posted. This is the third or fourth answer in a row that you've provided which fails to meet the OP's simple requirements. My suggestion always test your code with a variety of possibly valid data-sets before posting answers... at least until accurate responses become second nature. To be honest, I'm still hesitant to post regexp responses until after I've tested them -- they're so easy to get wrong. But the lesson should be test your solutions before posting.

    The Monastery welcomes learners. That's one of the biggest reasons we're here. We all started somewhere. And answering questions is a great way to consider new problems and to learn from them. I'm not suggesting that you refrain from answering. I'm suggesting (and as a fellow PerlMonk asking) that you test your code before posting it. One doesn't learn much from posting broken solutions. One learns by studying how to create a valid solution.

    Furthermore, it does your fellow PerlMonks a disservice posting broken code. Sure, there's more than one way to do it. But another newcomer may not immediately recognize that your solutions have bugs, may use them, and may find out the hard way. That's not good for the user, for Perl, or for the Perl community.

    One suggestion I have... if you're unsure about a solution, you might even consider chatting about it in the CB before posting it. Put it in your scratchpad and say, "Is [pad://anish_batra] a valid solution to [id://123456]?" If it's a good idea, post it. If it's wrong, the folks in the chatterbox will probably gladly explain why.


      ... I'm still hesitant to post regexp responses until after I've tested them ...

      I'd go farther than that. My experience is that whenever I do not test a regex, no matter how simple it may seem, it's guaranteed to be wrong! It's like some kind of corollary of Murphy's Law. For me, regular expressions are the most counter-intuitive concept in CS (or in C-what-we-laughingly-refer-to-as-S). I think I have a fairly good understanding of regexes and a fair body of experience with them, but I would never trust my untested opinion.

      Caveat Programmor

Re^2: Regex help needed
by AnomalousMonk (Chancellor) on Apr 23, 2012 at 13:28 UTC

    Unfortunately, that solution has a problem similar to that in the OPed code:

    >perl -wMstrict -le "for my $data (qw( Smith%John%BC142%Alberta Johnson%Andrew%AX321%Engineer )) { if($data =~ /.*%.*%A/) { my @arr = split('%', $data); print qq{$arr[0] $arr[1]}; } } " Smith John Johnson Andrew

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://966578]
[hippo]: Which version of CentOS?
[vedagiri89]: how to fix: Attempt to reload aborted
[hippo]: Ah, presumably 7 then.
[vedagiri89]: CentOS Linux release 7.0.1406 (Core)
[hippo]: How did you install libapreq2?
[vedagiri89]: that one is done by system team from the tar i guess
[hippo]: Really? Not using the one from the CentOS repository? Perhaps that's the problem.
[vedagiri89]: i need when this issue will come usually
[hippo]: How about mod_perl? Was that installed from the CentOS packge or from source?
[vedagiri89]: from the source

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (8)
As of 2018-06-19 11:33 GMT
Find Nodes?
    Voting Booth?
    Should cpanminus be part of the standard Perl release?

    Results (113 votes). Check out past polls.