Compiler Design | Mock Test

Question 1
Finite automata can be used to count the number of symbols read.
Select one:
a. True
b. False
[bg_collapse view=”button-green” color=”#FFF” icon=”arrow” expand_text=”Show Answer” collapse_text=”Hide Answer” ] Feedback
The correct answer is ‘False’.
[/bg_collapse]
Question 2
In regular expression notation * represents one or more occurrence of the preceding symbol.
Select one:
a. True
b. False
[bg_collapse view=”button-green” color=”#FFF” icon=”arrow” expand_text=”Show Answer” collapse_text=”Hide Answer” ] Feedback
The correct answer is ‘False’.
[/bg_collapse]
Question 3
NDFA can be converted to DFA using subset construction method
Select one:
a. True
b. False
[bg_collapse view=”button-green” color=”#FFF” icon=”arrow” expand_text=”Show Answer” collapse_text=”Hide Answer” ] Feedback
The correct answer is ‘True’.
[/bg_collapse]
Question 4
Shift reduce parsing is a type of Top down design.
Select one:
a. True
b. False
[bg_collapse view=”button-green” color=”#FFF” icon=”arrow” expand_text=”Show Answer” collapse_text=”Hide Answer” ] Feedback
The correct answer is ‘False’.
[/bg_collapse]
Question 5
The grammar E –> E+E | E*E | a
Select one:
A. Ambiguous
B. Unambiguous
C. Depends on the given sentence
D. None of the above
[bg_collapse view=”button-green” color=”#FFF” icon=”arrow” expand_text=”Show Answer” collapse_text=”Hide Answer” ] Feedback
The correct answer is: Ambiguous
[/bg_collapse]
Question 6
Lexical Analyzer is the only phase which reads the complete source program.
Select one:
a. True
b. False
[bg_collapse view=”button-green” color=”#FFF” icon=”arrow” expand_text=”Show Answer” collapse_text=”Hide Answer” ] Feedback
The correct answer is ‘True’.
[/bg_collapse]
Question 7
Regular expression(0+1)* recognises set of all strings over {0,1}
Select one:
a. True
b. False
[bg_collapse view=”button-green” color=”#FFF” icon=”arrow” expand_text=”Show Answer” collapse_text=”Hide Answer” ] Feedback
The correct answer is ‘True’.
[/bg_collapse]
Question 8
LEX is a:
Select one:
A.
Token generator
B.
A parser generator
C.
Code generator
D.
None of the above
[bg_collapse view=”button-green” color=”#FFF” icon=”arrow” expand_text=”Show Answer” collapse_text=”Hide Answer” ] Feedback
The correct answer is:
Token generator
[/bg_collapse]
Question 9
Two finite state machines are said to be equivalent if they
Select one:
a. Have same number of states
b. Have the same number of states and edges
c. Recognize the same language
d. Have same number of edges
[bg_collapse view=”button-green” color=”#FFF” icon=”arrow” expand_text=”Show Answer” collapse_text=”Hide Answer” ] Feedback
The correct answer is: Recognize the same language
[/bg_collapse]
Question 10
A bottom up parser generates
Select one:
a. Right most derivation
b. Right most derivation in reverse
c. Left most derivation in reverse
d. Left most derivation
[bg_collapse view=”button-green” color=”#FFF” icon=”arrow” expand_text=”Show Answer” collapse_text=”Hide Answer” ] Feedback
The correct answer is: Right most derivation in reverse
[/bg_collapse]