Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re: Re: Eliminating Left Recursion in Parse::RecDescent

by demerphq (Chancellor)
on May 29, 2002 at 14:55 UTC ( #170098=note: print w/replies, xml ) Need Help??

in reply to Re: Eliminating Left Recursion in Parse::RecDescent
in thread Eliminating Left Recursion in Parse::RecDescent

Doh. Yes. I did too. And you guys are the first to spot the error as well.

In my defence, I got it right in one part, here

A : y R R : x R | e
But omitted the R element in the example.

I have updated the node. Thanks for your hawklike eyes.

Yves / DeMerphq
Writing a good benchmark isnt as easy as it might look.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://170098]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (7)
As of 2016-10-24 08:13 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (303 votes). Check out past polls.