Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re: Eliminating Left Recursion in Parse::RecDescent

by Abigail-II (Bishop)
on May 29, 2002 at 10:42 UTC ( #170029=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

all this does is change the expression to
expr : term '+' term | term
which works fine but does not solve the problem. (a+b) + (c+d)

That is because demerphq applied the rule wrongly. After applying the rule, we should get:

expr : term expr_tail expr_tail : '+' term expr_tail | {1}

Abigail


Comment on Re: Eliminating Left Recursion in Parse::RecDescent
Download Code
Re: Re: Eliminating Left Recursion in Parse::RecDescent
by demerphq (Chancellor) on May 29, 2002 at 14:55 UTC
    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?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (11)
As of 2014-07-29 19:55 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (226 votes), past polls