CS606-Midterm
1 / 50
Consider the grammar
2 / 50
Parser takes tokens from scanner and tries to generate______ .
3 / 50
In multi pass compiler during the first pass it gathers information about __________ .
4 / 50
In Back End module of compiler, optimal register allocation uses______ .
5 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
6 / 50
Recursive _____ parsing is done for LL(1) grammar.
7 / 50
Optimal registers allocation is an NP-hard problem.
8 / 50
NFA is easy to implement as compared to DFA.
9 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
10 / 50
Which of the statement is true about Regular Languages?
11 / 50
Responsibility of _____ is to produce fast and compact code.
12 / 50
LR parsers can handle _______ grammars.
13 / 50
14 / 50
Can a DFA simulate NFA?
15 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
16 / 50
In PASCAL ___________ represent the inequality test.
17 / 50
Left factoring of a grammar is done to save the parser from back tracking.
18 / 50
Left factoring is enough to make a grammar LL(1).
19 / 50
20 / 50
LR parsing _____ a string to the start symbol by inverting productions.
21 / 50
Left factoring is enough to make LL1 grammar
22 / 50
In a transition table cells of the table contain the ________ state.
23 / 50
We can get an LL(1) grammar by _______ .
24 / 50
A _______ is a top down parser.
25 / 50
LL(1) parsing is called non-predictive parsing.
26 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
27 / 50
____________avoid hardware stalls and interlocks.
28 / 50
Parser always gives a tree like structure as output
29 / 50
We use ----- to mark the bottom of the stack and also the right end of the input when considering the Stack implementation of Shift-Reduce Parsing.
30 / 50
Lexer and scanner are two different phases of compiler
31 / 50
Bottom-up parsers handle a ________ class of grammars.
32 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
33 / 50
Follow of B is ____ .
34 / 50
The non-terminal _______ is left recursive.
35 / 50
Functions of Lexical analyzer are?
36 / 50
37 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
38 / 50
When generating a lexical analyzer from a ________ description, the item sets (states) are constructed by two types of “moves”: character moves and e moves.
39 / 50
40 / 50
First of C is ______ .
41 / 50
Recursive ____________ parsing is done for LL(1) grammar.
42 / 50
_______ algorithm is used in DFA minimization.
43 / 50
Front end of two pass compiler takes________ as input.
44 / 50
Consider the following grammar,
45 / 50
When generating a lexical analyzer from a token description, the item sets (states) are constructed by two types of “moves”: character moves and ____ moves.
46 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
47 / 50
48 / 50
49 / 50
45.Follow of C is ____ .
50 / 50
An important component of semantic analysis is _________ .
Your score is
The average score is 0%
Restart quiz
