9) Following context free grammar
S —> aB | bA
A —>b | aS | bAA
B —> b | bS | aBB
generates strings of terminals that have
Answer is:
equal number of a ′s and b ′s
Related Theory of Computation MCQ with Answers
Answer is:
including the null string.
Answer is:
cannot remember arbitrary large amount of information
Answer is: