My Computer Forum Computer Science Forum

Go Back   My Computer Forum > Computer Science Forum > Theory of Computation

Theory of Computation Theoretical Computer Science - Automata Theory, Computability Theory, and Computational Complexity Theory

LinkBack Thread Tools Display Modes
March 1st, 2011, 10:14 PM   #1
Joined: Mar 2011
Posts: 1
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
Tripurari  Kumar is offline  

My Computer Forum is free to register and we welcome everyone!

November 18th, 2011, 04:38 PM   #2
Posts: n/a
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.

  My Computer Forum > Computer Science Forum > Theory of Computation

grammar, transformation

Thread Tools
Display Modes

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