|Problem with top down parsing email@example.com (2006-10-24)|
|Re: Problem with top down parsing firstname.lastname@example.org (Ujjwal) (2006-11-22)|
|Re: Problem with top down parsing email@example.com (A Johnstone) (2006-11-24)|
|Re: Problem with top down parsing firstname.lastname@example.org (Sylvain Schmitz) (2006-11-24)|
|Date:||22 Nov 2006 21:17:50 -0500|
|Posted-Date:||22 Nov 2006 21:17:50 EST|
I think 'top down parsing with backtracking' can also produce 6 a's by
menas of the following way:
S -> aSa -> aaSaa (using the production S -> aSa)
-> aaaaaa (using the production S -> aa)
Please correct me in case I missed anything.
With best regards,
> 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 ?
Return to the
Search the comp.compilers archives again.