I'm currently going through the Dragon Book in order to write a parser for JavaScript in pure Perl.
Since I'd planned on using Parse::RecDescent, and the grammar (summarized at the end of the standard) is quite large, I'm planning on writing a module to systematically eliminate left recursion. (I also plan to do some other grammar munging, like eliminating epsilon-expressions.)
In reply to Re: Eliminating Left Recursion in Parse::RecDescent
by cogent
in thread Eliminating Left Recursion in Parse::RecDescent
by demerphq
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |