Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re: Zen and the Art of Match Variables

by kelan (Deacon)
on Mar 25, 2003 at 18:46 UTC ( #245748=note: print w/replies, xml ) Need Help??


in reply to Zen and the Art of Match Variables

Just curious, will Parrot have to implement the match variables this way, too? Or will it be able to do a better job at maintaining the Principle of Least Surprise? I don't know how much of Grammars have been implemented so far, so maybe you can't even answer this yet. Just wondering :)

Update: Changed "Non-" to "Least" in the principle name. Makes better sense.

kelan


Perl6 Grammar Student

Replies are listed 'Best First'.
Re: Re: Zen and the Art of Match Variables
by Elian (Parson) on Mar 25, 2003 at 18:50 UTC
    Perl 6 and parrot regexes are much more self-contained, so this sort of thing won't happen. (I'm torn as to whether to make it happen for the perl 5 compatibility code, but I'm thinking not right now) The only real reason it works like this in perl now is because regexes predate lexicals--if we were doing it over again for perl 5 it wouldn't happen the way it does now.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (4)
As of 2022-12-06 00:45 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?