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
In reply to Re: Zen and the Art of Match Variables
by kelan
in thread Zen and the Art of Match Variables
by Elian
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |