CS606-Midterm
1 / 50
Left factoring of a grammar is done to save the parser from back tracking.
2 / 50
Compilers are sometimes classified as.
3 / 50
Lexical Analyzer generator _______ is written in Java.
4 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
5 / 50
Front-end of a two pass compiler is consists of Scanner.
6 / 50
Functions of Lexical analyzer are?
7 / 50
_______ algorithm is used in DFA minimization.
8 / 50
Consider the grammar
9 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
10 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
11 / 50
Parser always gives a tree like structure as output
12 / 50
13 / 50
AST summarizes the grammatical structure with the details of derivations.
14 / 50
The non-terminal _______ is left recursive.
15 / 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.
16 / 50
17 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
18 / 50
___________ phase which supports macro substitution and conditional compilation.
19 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
20 / 50
Parser takes tokens from scanner and tries to generate ______ .
21 / 50
NFA is easy to implement as compared to DFA.
22 / 50
Recursive ____________ parsing is done for LL(1) grammar.
23 / 50
Optimal registers allocation is an NP-hard problem.
24 / 50
LR parsers can handle _______ grammars.
25 / 50
LR parsing _____ a string to the start symbol by inverting productions.
26 / 50
In Back End module of compiler, optimal register allocation uses______ .
27 / 50
28 / 50
Follow of B is ____ .
29 / 50
We can get an LL(1) grammar by _______ .
30 / 50
In a transition table cells of the table contain the ________ state.
31 / 50
Responsibility of _____ is to produce fast and compact code.
32 / 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.
33 / 50
34 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
35 / 50
Grammars with LL(1) conflicts can be made LL(1) by applying left-factoring, substitution, and left-recursion removal. Left-factoring takes care of ________conflicts.
36 / 50
37 / 50
Lexer and scanner are two different phases of compiler
38 / 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.
39 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
40 / 50
Front end of two pass compiler takes________ as input.
41 / 50
In compilation process Hierarchical analysis is also called-----------
42 / 50
43 / 50
In multi pass compiler during the first pass it gathers information about __________ .
44 / 50
45 / 50
____is evaluated to yield a value.
46 / 50
47 / 50
48 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
49 / 50
Consider the following grammar,
50 / 50
Your score is
The average score is 0%
Restart quiz
