Parse tree problem

Hi,
I was recently going through "Principles of Compiler design, Aho
and Ullman". In that it was specified that one particular grammar the
one below had two right most derivations for a single input. How is
that possible ? RMD is expanding using the right most nonterminal right
......

E -> E + E
E -> E * E
E -> (E)
E -> id

and the input is id + id * id

( The above is cited in the context of shift-reduce parsers in the book
)

.

Relevant Pages

  • Re: Parse tree problem
    ... I was recently going through "Principles of Compiler design, Aho ... and Ullman". ... In that it was specified that one particular grammar the ...
    (sci.math)
  • Doubt with parse tree
    ... I was recently going through "Principles of Compiler design, Aho ... and Ullman". ... In that it was specified that one particular grammar the ...
    (comp.compilers)
  • Parse tree problem
    ... I was recently going through "Principles of Compiler design, Aho ... and Ullman". ... In that it was specified that one particular grammar the ...
    (comp.theory)
  • V: Informatik-"Klassiker"
    ... Aho, Sethi, Ullman: "Compilerbau Teil 1" ... "The Design And Analysis of Computer Algorithms" ... C.J. Date "An Introduction to Database Systems Vol II" ...
    (de.markt.buecher)
  • Re: Professional C++
    ... That was Aho, Sethi and Ullman. ... _Introduction to Algorithms_ by Cormen, ... I'd note that only ONE of the algorithm books is really ...
    (comp.lang.cpp)