S > aSa| bSb| a| b; the language generated by the above grammar is the set of ____________

Strings beginning and ending with the same symbol

Explore topic-wise MCQs in Compilers.

This section includes 2 Mcqs, each offering curated multiple-choice questions to sharpen your Compilers knowledge and support exam preparation. Choose a topic below to get started.

1.	Does epsilon ring any change in the automata.
A.	Yes
B.	No
Answer» C.

Discussion

2.	S > aSa\| bSb\| a\| b; the language generated by the above grammar is the set of ____________
A.	All palindromes
B.	All odd length palindromes
C.	Strings beginning and ending with the same symbol
D.	All even length palindromes
Answer» C. Strings beginning and ending with the same symbol

Discussion

Explore topic-wise MCQs in Compilers.

Does epsilon ring any change in the automata.

S > aSa| bSb| a| b; the language generated by the above grammar is the set of ____________