CS606-Midterm
1 / 50
Consider the grammar
2 / 50
Front-end of a two pass compiler is consists of Scanner.
3 / 50
Front end of two pass compiler takes________ as input.
4 / 50
Lexical Analyzer generator _______ is written in Java.
5 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
6 / 50
7 / 50
___________ phase which supports macro substitution and conditional compilation.
8 / 50
Lexer and scanner are two different phases of compiler
9 / 50
_______ algorithm is used in DFA minimization.
10 / 50
Optimal registers allocation is an NP-hard problem.
11 / 50
12 / 50
AST summarizes the grammatical structure with the details of derivations.
13 / 50
Reduction of a handle to the ------- on the left hand side of the grammar rule is a step along the reverse of a right most derivation.
14 / 50
In Back End module of compiler, optimal register allocation uses______ .
15 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
16 / 50
NFA is easy to implement as compared to DFA.
17 / 50
A _______ is a top down parser.
18 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
19 / 50
20 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
21 / 50
Can a DFA simulate NFA?
22 / 50
Intermediate Representation (IR) stores the value of its operand in
23 / 50
24 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
25 / 50
Compilers are sometimes classified as.
26 / 50
____is evaluated to yield a value.
27 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
28 / 50
Parser always gives a tree like structure as output
29 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
30 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
31 / 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.
32 / 50
33 / 50
First of C is ______ .
34 / 50
35 / 50
Functions of Lexical analyzer are?
36 / 50
37 / 50
In predictive parsing table the rows are ___________ .
38 / 50
Follow of B is ____ .
39 / 50
45.Follow of C is ____ .
40 / 50
LR parsers can handle _______ grammars.
41 / 50
42 / 50
____________avoid hardware stalls and interlocks.
43 / 50
44 / 50
45 / 50
46 / 50
Bottom-up parsers handle a ________ class of grammars.
47 / 50
Consider the following grammar,
48 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
49 / 50
Left factoring is enough to make LL1 grammar
50 / 50
Responsibility of _____ is to produce fast and compact code.
Your score is
The average score is 0%
Restart quiz
