Just curious if anyone knows what the runtime complexity for Perl6's grammar engine will be. If it's a souped up verison Parse:RecDescent does that mean it's going to be worse than O(l) (l being length of string to parse). I think rec descent without memoization is O(l^3).
That might cause trouble for long source files.
In reply to Perl 6 rules and complexity by fergal
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |