Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

Re: a regular expression question

by toolic (Chancellor)
on Dec 18, 2012 at 15:12 UTC ( #1009395=note: print w/ replies, xml ) Need Help??


in reply to a regular expression question

Be less greedy:

s/\(.?,\s*bob\s*,.?\)//g;


Comment on Re: a regular expression question
Download Code
Re^2: a regular expression question
by brassbin (Novice) on Dec 18, 2012 at 15:26 UTC

    i know the netgroup file i'm processing probably doesn't have 3 spaces before the first comma, what if it does?

    i thought regular expression matches the short possible pattern, not the longest, am i wrong?

      brassbin:

      As toolic mentioned, the .* construct is greedy and tries to get the longest match. If you turn it into .*?, it then looks for the shortest match. If you read the link he provided, you could verify that yourself.

      ...roboticus

      When your only tool is a hammer, all problems look like your thumb.

        Thank you toolic, roboticus!

        i don't know why a line that contains the words

        thank you

        doesn't show up

        i haven't figured out all the rules yet of posting, but i meant to say thank you for your help

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (15)
As of 2014-10-21 17:44 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    For retirement, I am banking on:










    Results (106 votes), past polls