Automata Theory Dpda Ambiguous Grammars Online Exam Quiz
Automata Theory Dpda Ambiguous Grammars GK Quiz. Question and Answers related to Automata Theory Dpda Ambiguous Grammars. MCQ (Multiple Choice Questions with answers about Automata Theory Dpda Ambiguous Grammars
CFGs are more powerful than:
Options
A : DFA
B : NDFA
C : Mealy Machine
D : All of the mentioned
Which among the following is incorrect with reference to a derivation tree?
Options
A : Every vertex has a label which is a terminal or a variable.
B : The root has a label which can be a terminal.
C : The label of the internal vertex is a variable.
D : None of the mentioned
Which of the following are context free language?
Options
A : L={aibi|i>=0}
B : L={wwr| w is a string and r represents reverse}
C : Both (a) and (b)
D : one of the mentioned
The language L ={ai2bi|i>=0} is:
Options
A : recursive
B : deterministic CFL
C : regular
D : Two of the mentioned is correct
Which of the following are non essential while simplifying a grammar?
Options
A : Removal of useless symbols
B : Removal of unit productions
C : Removal of null production
D : None of the mentioned
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Automata Theory Context Free Grammar Derivations Definitions
Automata Theory Converting Regular Expressions Automata
Automata Theory Deterministic Pda
Automata Theory Dfa Processing Strings
Automata Theory Dfa Regular Expressions
Automata Theory Dpda Context Free Languages
Automata Theory Eliminating Epsilon Productions
Automata Theory Eliminating Unit Productions