Related articles |
---|
Problem with top down parsing anandr86@gmail.com (2006-10-24) |
Re: Problem with top down parsing ujjwal.konar@gmail.com (Ujjwal) (2006-11-22) |
Re: Problem with top down parsing adrian@cs.rhul.ac.uk (A Johnstone) (2006-11-24) |
Re: Problem with top down parsing schmitz@i3s.unice.fr (Sylvain Schmitz) (2006-11-24) |
From: | anandr86@gmail.com |
Newsgroups: | comp.compilers |
Date: | 24 Oct 2006 12:35:58 -0400 |
Organization: | Compilers Central |
Keywords: | parse, question |
Posted-Date: | 24 Oct 2006 12:35:58 EDT |
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 ?
Return to the
comp.compilers page.
Search the
comp.compilers archives again.