Re: is P::RD LL(1) LL(N) LR(1) LR(N) ?
[email protected] ((Randal L. Schwartz))
| Newsgroups | perl.recdescent |
|---|---|
| Organization | Stonehenge Consulting Services; Portland, Oregon, USA |
| Message-ID | <[email protected]> |
>>>>> "Yves" == Yves Orton <[email protected]> writes: Yves> Since P::RD can only handle LL grammers it would seem that a Yves> tutorial on eliminating left recursion would be useful. I had a fun time eliminating a mutual left-recursion problem for my "Data-Undumper" program, which used P::RD as an essential component. See my discussion of such at <http://www.stonehenge.com/merlyn/LinuxMag/col29.html> -- Randal L. Schwartz - Stonehenge Consulting Services, Inc. - +1 503 777 0095 <[email protected]> <URL:http://www.stonehenge.com/merlyn/> Perl/Unix/security consulting, Technical writing, Comedy, etc. etc. See PerlTraining.Stonehenge.com for onsite and open-enrollment Perl training!