CS606-Midterm
1 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
2 / 50
Can a DFA simulate NFA?
3 / 50
LR parsing _____ a string to the start symbol by inverting productions.
4 / 50
In compilation process Hierarchical analysis is also called
5 / 50
Consider the grammar
6 / 50
Optimal registers allocation is an NP-hard problem.
7 / 50
Left factoring is enough to make a grammar LL(1).
8 / 50
Recursive ____________ parsing is done for LL(1) grammar.
9 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
10 / 50
Parser takes tokens from scanner and tries to generate ______ .
11 / 50
Responsibility of _____ is to produce fast and compact code.
12 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
13 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
14 / 50
LR parsers can handle _______ grammars.
15 / 50
In Back End module of compiler, optimal register allocation uses______ .
16 / 50
Follow of B is ____ .
17 / 50
Left factoring is enough to make LL1 grammar
18 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
19 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
20 / 50
Compilers are sometimes classified as.
21 / 50
In multi pass compiler during the first pass it gathers information about __________ .
22 / 50
AST summarizes the grammatical structure with the details of derivations.
23 / 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.
24 / 50
25 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
26 / 50
LL(1) parsing is called non-predictive parsing.
27 / 50
____is evaluated to yield a value.
28 / 50
NFA is easy to implement as compared to DFA.
29 / 50
Intermediate Representation (IR) stores the value of its operand in
30 / 50
31 / 50
32 / 50
33 / 50
34 / 50
We can get an LL(1) grammar by _______ .
35 / 50
First of C is ______ .
36 / 50
Left factoring of a grammar is done to save the parser from back tracking.
37 / 50
38 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
39 / 50
In predictive parsing table the rows are ___________ .
40 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
41 / 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.
42 / 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.
43 / 50
44 / 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.
45 / 50
_______ algorithm is used in DFA minimization.
46 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
47 / 50
48 / 50
Front-end of a two pass compiler is consists of Scanner.
49 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
50 / 50
Lexer and scanner are two different phases of compiler
Your score is
The average score is 0%
Restart quiz
