Let G be a grammar: S->AB|e, A->a, B->b

Explore topic-wise MCQs in Automata Theory Questions and Answers.

This section includes 1 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory Questions and Answers knowledge and support exam preparation. Choose a topic below to get started.

1.	Let G be a grammar: S->AB\|e, A->a, B->b
A.	Is the given grammar in CNF?
B.	Yes
C.	No
Answer» B. Yes

Discussion