CFG-Eliminating Useless Symbols Online Exam Quiz
CFG-Eliminating Useless Symbols GK Quiz. Question and Answers related to CFG-Eliminating Useless Symbols. MCQ (Multiple Choice Questions with answers about CFG-Eliminating Useless Symbols
A push down automata can be represented as:^ PDA= ?-NFA +[stack] State true or false:
Options
A : TRUE
B : FALSE
C : -
D : -
A pushdown automata can be defined as: (Q, ?, G, q0, z0, A, d)^ What does the symbol z0 represents?
Options
A : an element of G
B : initial stack symbol
C : top stack alphabet
D : all of the mentioned
Given a Grammar G:^ S->aA^ A->a^ A->B^ B->A^ B->bb^ Which among the following will be the simplified grammar?
Options
A : S->aA|aB, A->a, B->bb
B : S->aA|aB, A->B, B->bb
C : S->aA|aB, A->a, B->A
D : None of the emntioned
Given grammar:^ S->aS|A^ A->a^ B->aa^ Find the number of variables reachable from the Starting Variable?
Options
A : 0
B : 1
C : 2
D : None of the mentioned
Halting states are of two types. They are:
Options
A : Accept and Reject
B : Reject and Allow
C : Start and Reject
D : None of the mentioned
In context to the process of removing useless symbols, which of the following is correct?
Options
A : We remove the Nullable variables
B : We eliminate the unit productions
C : We eliminate products which yield no terminals
D : All of the mentioned
Inorder to simplify a context free grammar, we can skip the following operation:
Options
A : Removal of null production
B : Removal of useless symbols
C : Removal of unit productions
D : None of the mentioned
The production of the form A->B , where A and B are non terminals is called
Options
A : Null production
B : Unit production
C : Greibach Normal Form
D : Chomsky Normal Form
Which of the following correctly recognize the symbol '|-' in context to PDA?
Options
A : Moves
B : transition function
C : or/not symbol
D : none of the mentioned
Ambiguous Grammar more Online Exam Quiz
Applications of Pumping Lemma/Pigeonhole principle
Deterministic Finite Automata-Introduction and Definition
Finding Patterns in Text,Algebric Laws and Derivatives
From Grammars to Push Down Automata