S → aSa | bSb | a | b. The language generated by the above grammar over the…
ISRO Scientist/Engineer SC · 2016 · Computer ScienceModified — slightly modified from the official paper; see the solutionGATE · 2009 · CS
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 begin and end with the same symbol
- D.
all even length palindromes
Attempted by 424 students.
Sign up free to check your answer
Sign up freeLoading lesson…