It's not hard to write a single-token lookahead parser with P::RD. There's no reason to do any backtracking with that grammar. That doesn't mean P::RD isn't slow.
In reply to Re^2: Is this a job for Parse::RecDescent?
by ikegami
in thread Is this a job for Parse::RecDescent?
by raindog308
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |