CS606-Midterm
1 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
2 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
3 / 50
4 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
5 / 50
LL(1) parsing is called non-predictive parsing.
6 / 50
Front-end of a two pass compiler is consists of Scanner.
7 / 50
Optimal registers allocation is an NP-hard problem.
8 / 50
We can get an LL(1) grammar by _______ .
9 / 50
Left factoring of a grammar is done to save the parser from back tracking.
10 / 50
Parser takes tokens from scanner and tries to generate ______ .
11 / 50
Recursive ____________ parsing is done for LL(1) grammar.
12 / 50
NFA is easy to implement as compared to DFA.
13 / 50
In predictive parsing table the rows are ___________ .
14 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
15 / 50
___________ phase which supports macro substitution and conditional compilation.
16 / 50
Lexical Analyzer generator _______ is written in Java.
17 / 50
Which of the statement is true about Regular Languages?
18 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
19 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
20 / 50
Compilers are sometimes classified as.
21 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
22 / 50
In a transition table cells of the table contain the ________ state.
23 / 50
The non-terminal _______ is left recursive.
24 / 50
____________avoid hardware stalls and interlocks.
25 / 50
____is evaluated to yield a value.
26 / 50
An ----- does not need to examine the entire stack for a handle, the state symbol on the top of the stack contains all the information it needs
27 / 50
28 / 50
AST summarizes the grammatical structure with the details of derivations.
29 / 50
LR parsing _____ a string to the start symbol by inverting productions.
30 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
31 / 50
32 / 50
_______ algorithm is used in DFA minimization.
33 / 50
34 / 50
LR parsers can handle _______ grammars.
35 / 50
36 / 50
37 / 50
Left factoring is enough to make a grammar LL(1).
38 / 50
Front end of two pass compiler takes________ as input.
39 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
40 / 50
41 / 50
42 / 50
Parser takes tokens from scanner and tries to generate______ .
43 / 50
44 / 50
Left factoring is enough to make LL1 grammar
45 / 50
46 / 50
47 / 50
Lexer and scanner are two different phases of compiler
48 / 50
Functions of Lexical analyzer are?
49 / 50
Intermediate Representation (IR) stores the value of its operand in
50 / 50
Your score is
The average score is 0%
Restart quiz
