Question: Consider the grammars: G1:S AB | a | abC, A b, C abC | c G2:S a | b | cC, C cC | c
Consider the grammars:
G1:S AB | a | abC, A b, C abC | c
G2:S a | b | cC, C cC | c
These grammars do not define the same language. To prove, use a string that is generated by one but not by the other grammar. Which of the strings can be used for this proof?
a) caca
b) ababababcc
c) abac
d) ccc
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
