Question

\(S→aSa∣bSb∣a∣b\)

The language generated by the above grammar over the alphabets {a, b} is the set of

1. All palindromes
2. All odd length palindromes
3. Strings that being and end with same symbol
4. All even length palindrome

Answer 1

Correct Answer - Option 2 : All odd length palindromes

Recursive derivation of strings will generate palindromes and the final replacement of variable with a terminal will make sure that the palindrome is odd.