Re: Exercise 2.1.2 from Aho&Ulman The theory of Parsing textbook?
- From: Ben Bacarisse <ben.usenet@xxxxxxxxx>
- Date: Tue, 22 Apr 2008 00:59:52 +0100
Tegiri Nenashi <TegiriNenashi@xxxxxxxxx> writes:
"Construct CFG that generates all strings having equal number of a's
and b's"
My attempt:
X = 1 + aXa + aaX +Xaa + bXb + Xbb +bbX +YY
Y = 1 + (a+b)Y
I don't know this notation, but I can't find an assignment of symbols
to meanings that makes this a solution! What do you mean by these
symbols?
--
Ben.
.
- References:
- Exercise 2.1.2 from Aho&Ulman The theory of Parsing textbook?
- From: Tegiri Nenashi
- Exercise 2.1.2 from Aho&Ulman The theory of Parsing textbook?
- Prev by Date: Exercise 2.1.2 from Aho&Ulman The theory of Parsing textbook?
- Next by Date: comp.theory charter
- Previous by thread: Exercise 2.1.2 from Aho&Ulman The theory of Parsing textbook?
- Next by thread: Re: Exercise 2.1.2 from Aho&Ulman The theory of Parsing textbook?
- Index(es):
Relevant Pages
|
