CS606-Midterm
1 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
2 / 50
LR parsers can handle _______ grammars.
3 / 50
Left factoring of a grammar is done to save the parser from back tracking.
4 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
5 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
6 / 50
An important component of semantic analysis is _________ .
7 / 50
AST summarizes the grammatical structure with the details of derivations.
8 / 50
In PASCAL ___________ represent the inequality test.
9 / 50
Can a DFA simulate NFA?
10 / 50
45.Follow of C is ____ .
11 / 50
Lexical Analyzer generator _______ is written in Java.
12 / 50
Consider the grammar
13 / 50
Optimal registers allocation is an NP-hard problem.
14 / 50
Parser takes tokens from scanner and tries to generate ______ .
15 / 50
In predictive parsing table the rows are ___________ .
16 / 50
Responsibility of _____ is to produce fast and compact code.
17 / 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.
18 / 50
19 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
20 / 50
_______ algorithm is used in DFA minimization.
21 / 50
In Back End module of compiler, optimal register allocation uses______ .
22 / 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.
23 / 50
Functions of Lexical analyzer are?
24 / 50
25 / 50
Intermediate Representation (IR) stores the value of its operand in
26 / 50
27 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
28 / 50
29 / 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
30 / 50
Recursive _____ parsing is done for LL(1) grammar.
31 / 50
32 / 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.
33 / 50
A _______ is a top down parser.
34 / 50
35 / 50
Lexer and scanner are two different phases of compiler
36 / 50
37 / 50
38 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
39 / 50
Parser always gives a tree like structure as output
40 / 50
Front end of two pass compiler takes________ as input.
41 / 50
Left factoring is enough to make a grammar LL(1).
42 / 50
LL(1) parsing is called non-predictive parsing.
43 / 50
In compilation process Hierarchical analysis is also called-----------
44 / 50
Front-end of a two pass compiler is consists of Scanner.
45 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
46 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
47 / 50
48 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
49 / 50
50 / 50
______ phase which supports macro substitution and conditional compilation.
Your score is
The average score is 0%
Restart quiz
