Question: Consider the grammar: S -> AB | BA | aB A -> aB | b B -> a | b | BB Find a string
Consider the grammar:
S -> AB | BA | aB
A -> aB | b
B -> a | b | BB
Find a string that has two different parse trees. Write down the two derivations and draw the corresponding parse trees. Please give out steps and explanation (You can use JFLAP)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
