Question: 1 . Are the two grammars below equivalent as in do they generate the same language. If they do , what is the language. If

1. Are the two grammars below equivalent as in do they generate the same language. If they do, what is the language. If not, come up with at-least one string that one grammar can generate, but not the other.
S -> aR
R -> bR
R-> aT
T->\lambda S -> Ra
R -> Rb
R-> Ta
T->\lambda

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!