Once the compiler realizes that named captures aren't used, it won't capture them.But that means the compiler needs to be able to solve the halting problem. Which is, for Turing Machines, unsolvable. And since Turing Machines provide a more powerful machine than any physical computer does (due to their finite memory), not even the perl6 compiler will be able to solve this.
Abigail
In reply to Re: Perl6 regex/pattern performance issues?
by Abigail-II
in thread Perl6 regex/pattern performance issues?
by John M. Dlugosz
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |