Re: Parse tree problem
- From: Dave Seaman <dseaman@xxxxxxxxxxxx>
- Date: Sun, 22 Oct 2006 13:19:58 +0000 (UTC)
On 21 Oct 2006 22:04:57 -0700, anandr86@xxxxxxxxx wrote:
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
)
I suggest you Google for 'shift-reduce conflict'. You might also try posting
to comp.theory.
--
Dave Seaman
U.S. Court of Appeals to review three issues
concerning case of Mumia Abu-Jamal.
<http://www.mumia2000.org/>
.
- References:
- Parse tree problem
- From: anandr86
- Parse tree problem
- Prev by Date: Re: About the proof that L1 is the dual of c0
- Next by Date: Re: Problem with a derivation tree
- Previous by thread: Re: Parse tree problem
- Next by thread: Re: Parse tree problem
- Index(es):
Relevant Pages
|
