Problem with a derivation tree
- From: anandr86@xxxxxxxxx
- Date: 21 Oct 2006 22:06:18 -0700
Hi,
In the book "Principles of compiler design, Aho Ullman" the
following exercise caught my attention. The grammar given is
S -> aSa | aa
It is quoted that a "top down parse with backtracking" can establish
the inputs with 2,4 or 8 a's but not 6 a's .... How is this possible ?
.
- Follow-Ups:
- Re: Problem with a derivation tree
- From: William Elliot
- Re: Problem with a derivation tree
- From: Tomekstasiowski@xxxxxxxxxxxx
- Re: Problem with a derivation tree
- Prev by Date: Parse tree problem
- Next by Date: Lens Algebra
- Previous by thread: Parse tree problem
- Next by thread: Re: Problem with a derivation tree
- Index(es):
Relevant Pages
|
