Related articles |
---|
Doubt with parse tree anandr86@gmail.com (2006-10-24) |
Re: Doubt with parse tree int2k@gmx.net (Wolfram Fenske) (2006-10-24) |
Re: Doubt with parse tree DrDiettrich1@aol.com (Hans-Peter Diettrich) (2006-10-26) |
From: | anandr86@gmail.com |
Newsgroups: | comp.compilers |
Date: | 24 Oct 2006 12:35:39 -0400 |
Organization: | Compilers Central |
Keywords: | parse |
Posted-Date: | 24 Oct 2006 12:35:39 EDT |
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
)
Return to the
comp.compilers page.
Search the
comp.compilers archives again.