RE: is P::RD LL(1) LL(N) LR(1) LR(N) ?

> From: [email protected] [mailto:[email protected]] Sent:
2002/03/20 02:32
> >>>>> "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>

I did. And im curious as to what the rest of the story was [merlyn] ;-)  And
as to the current status of that project.  Seems interesting.

Anway I ended up writing up my last post here as node on perlmonks. You can
read it at

http://www.perlmonks.org/index.pl?lastnode_id=480&node_id=153155

Cheers all,
Yves [demerphq]