Re: Problem with a derivation tree
- From: William Elliot <marsh@xxxxxxxxxxxxxxxxxx>
- Date: Sat, 21 Oct 2006 22:59:41 -0700
On Sat, 21 Oct 2006 anandr86@xxxxxxxxx wrote:
In the book "Principles of compiler design, Aho Ullman" theInputs?! Don't get it.
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 ?
S -> aSa -> aaSaa -> aaaaaa is an output.
The grammar he's fantasizing is
S -> SS | aa
Math isn't easy. To make it obscure, take computer courses. ;-)
.
- Follow-Ups:
- Re: Problem with a derivation tree
- From: David C . Ullrich
- Re: Problem with a derivation tree
- References:
- Problem with a derivation tree
- From: anandr86
- Problem with a derivation tree
- Prev by Date: Re: Bounded Function Bounded derivative
- Next by Date: Re: Composition of measurable functions
- Previous by thread: Re: Problem with a derivation tree
- Next by thread: Re: Problem with a derivation tree
- Index(es):
Relevant Pages
|
