gs gs101 Properties of Context Free Languages - CFG-Eliminating Useless Symbols - Quiz No.1
gs gs101 Automata Theory Quiz
This quiz belongs to book/course code gs gs101 Automata Theory of gs organization. We have 92 quizzes available related to the book/course Automata Theory. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Properties of Context Free Languages. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
S->…->xAy->…->w
if ____________, then A is useful, else useless symbol.
S->aS|A|C
A->a
B->aa
C->aCb
Find the set of variables thet can produce strings only with the set of terminals.
S->aS|A
A->a
B->aa
Find the number of variables reachable from the Starting Variable?
S->aA
A->a
A->B
B->A
B->bb
Which among the following will be the simplified grammar?
A-> a| aaA| abBc
B-> abba| b
Online Quizzes of gs101 Automata Theory
