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

Re: Broken compatibility for recursive regex in Perl 5.8.4

by diotalevi (Canon)
on May 24, 2004 at 23:33 UTC ( #356081=note: print w/replies, xml ) Need Help??


in reply to Broken compatibility for recursive regex in Perl 5.8.4

I can't see how the previous behaviour was correct. When I've written this sort of thing the obvious and normal thing (to me of course) was to declare the lexical on the preceding line and then allow the regexp to capture it in its closure. Similarly, my $foo; $foo = sub { ... $foo->( ... ) ... }. If you're going to have it operate on something that is operating by lexical rules, then expect to have to treat it by lexical rules.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (5)
As of 2019-10-19 00:58 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Notices?