Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re: Negative Lookahead Assertion Problem

by Enlil (Parson)
on Jul 18, 2005 at 23:40 UTC ( #475924=note: print w/replies, xml ) Need Help??


in reply to Negative Lookahead Assertion Problem

Since your question as to why it doesn't work has been answered. (Basically it will backtrack till it does, and by moving a character back satisfies the regex.)

This should work:/\w+::(?>\w+)(?!\s*\()/

#!/usr/bin/perl use strict; use warnings; my @strings = ( '1. Foo::Bar', '2. Foo::Bar(', '3. Foo::Bar (', '4. Foo::Bar ' ); for ( @strings ) { print $_,$/ if /\w+::(?>\w+)(?!\s*\()/; } __END__ 1. Foo::Bar 4. Foo::Bar
Have a look at perlre where it reads about (?>pattern)

-Enlil

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://475924]
help
Chatterbox?
[Discipulus]: c'mon bro' 20 begincheck and you are ok..

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (9)
As of 2017-10-16 22:33 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My fridge is mostly full of:

















    Results (217 votes). Check out past polls.

    Notices?