Compilers Quiz Online Exam Quiz
Compilers Quiz GK Quiz. Question and Answers related to Compilers Quiz. MCQ (Multiple Choice Questions with answers about Compilers Quiz
The context free grammar S ? A111|S1, A ? A0 | 00 is equivalent to _________
Options
A : {0n1m | n=2, m=3}
B : {0n1m | n=1, m=5}
C : {0n1m | n should be greater than two and m should be greater than four}
D : None of the mentioned
A regular Grammar is a _________
Options
A : CFG
B : Non CFG
C : English Grammar
D : None of the mentioned
Push down automata accepts which language?
Options
A : Context sensitive language
B : Context free language
C : Recursive language
D : None of the mentioned
The context free grammar S ? SS | 0S1 | 1S0 | ? generates _________
Options
A : Equal number of 0’s and 1’s
B : Unequal number of 0’s and 1’s
C : Number of 0’s followed by any number of 1’s
D : None of the mentioned
A context free language is called ambiguous if _________
Options
A : It has 2 or more left derivations for some terminal string ? ? L (G)
B : It has 2 or more right derivations for some terminal string ? ? L (G)
C : It has 2 or more left & right derivations for some terminal string ? ? L (G)
D : None of the mentioned
Assume statements S1 and S2 defined as: S1: L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S2: The set of all Turing machines is countable. Which of the following is true?
Options
A : S1 is correct and S2 is not correct
B : Both S1 and S2 are correct
C : Both S1 and S2 are not correct
D : S1 is not correct and S2 is correct
Which of these does not belong to CFG?
Options
A : Terminal Symbol
B : Non terminal Symbol
C : Start symbol
D : End Symbol
A CFG is closed under _________
Options
A : Union
B : Kleene star
C : Concatenation
D : None of the mentioned
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Compilers Obtaining Regular Expression From Finite Automata 1
Compilers Predictivetop Down Parsing 1
Compilers Regular Expression 1