My Computer Forum

My Computer Forum (
-   Theory of Computation (
-   -   Transformation of Grammar (

Tripurari Kumar March 1st, 2011 10:14 PM

Transformation of Grammar
1. can any one tell me the solution of this question?
Find a Context Free Grammar without a lambda production equivalent to grammar defined by
A->aAA / lambda
B->bBB / lambda

November 18th, 2011 04:38 PM

Re: Transformation of Grammar
To test the transformations done by a certain pass, I would run the
result tree through a basic tree grammar with no actions in it, just
to make sure it was still grammatically valid. I structured all of
my transformations to conform to a "super" grammar which was really
the union of the input tree grammar and the output tree grammar.

All times are GMT -8. The time now is 04:55 PM.

Copyright © 2019 My Computer Forum Forum. All rights reserved.