BNF question

From: seamoon (reply.to_at_group.please)
Date: 03/11/05

  • Next message: Craig Feinstein: "Re: Factoring integers on a classical computer" 
    Date: Fri, 11 Mar 2005 21:15:46 +0100

    How can I remove the left recursion from this grammar:

    E ::= E '+' T | T
    T ::= T '*' F | F
    F ::= '(' E ')' | int

    I've tried this:

    E ::= T E'
    E' ::= <empty> + T E'
    T ::= F T'
    T' ::= <empty> *F T'
    F ::= ... but then I don't know what to do from here on.

    Simply F ::= '(' E ')' | int? Nooo...

    Best regards,

    Smalmatskungen

  • Next message: Craig Feinstein: "Re: Factoring integers on a classical computer"