1.

\(S→aSa∣bSb∣a∣b\)The language generated by the above grammar over the alphabets {a, b} is the set of

A. All palindromes
B. All odd length palindromes
C. Strings that being and end with same symbol
D. All even length palindrome
Answer» C. Strings that being and end with same symbol


Discussion

No Comment Found