Question: For the String aabbab that can be generated using the grammar below S --> aB S --> bA B --> b A --> a B

For the String "aabbab" that can be generated using the grammar below

S --> aB S --> bA B --> b A --> a B --> bS A --> aS B --> aBB A --> bAA

Where:

{S,A,B) as the non-terminal alphabet, {a,b) as the terminal alphabet, S as the start symbol

How many derivation trees are there?

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 Databases Questions!