CS606-Midterm
1 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
2 / 50
Recursive ____________ parsing is done for LL(1) grammar.
3 / 50
We can get an LL(1) grammar by _______ .
4 / 50
Follow of B is ____ .
5 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
6 / 50
Parser takes tokens from scanner and tries to generate ______ .
7 / 50
Lexical Analyzer generator _______ is written in Java.
8 / 50
In compilation process Hierarchical analysis is also called
9 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
10 / 50
First of C is ______ .
11 / 50
Parser takes tokens from scanner and tries to generate______ .
12 / 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.
13 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
14 / 50
15 / 50
Parser always gives a tree like structure as output
16 / 50
Left factoring is enough to make LL1 grammar
17 / 50
Front-end of a two pass compiler is consists of Scanner.
18 / 50
In parser the two LL stand(s) for ____________ .
19 / 50
20 / 50
21 / 50
NFA is easy to implement as compared to DFA.
22 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
23 / 50
24 / 50
LL(1) parsing is called non-predictive parsing.
25 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
26 / 50
In Flex specification file different sections are separated by ________ .
27 / 50
LR parsers can handle _______ grammars.
28 / 50
Functions of Lexical analyzer are?
29 / 50
In predictive parsing table the rows are ___________ .
30 / 50
An important component of semantic analysis is _________ .
31 / 50
Bottom-up parsers handle a ________ class of grammars.
32 / 50
In Back End module of compiler, optimal register allocation uses______ .
33 / 50
Consider the following grammar,
34 / 50
35 / 50
Front end of two pass compiler takes________ as input.
36 / 50
37 / 50
Intermediate Representation (IR) stores the value of its operand in
38 / 50
39 / 50
40 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
41 / 50
42 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
43 / 50
In PASCAL ___________ represent the inequality test.
44 / 50
Optimal registers allocation is an NP-hard problem.
45 / 50
46 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
47 / 50
Responsibility of _____ is to produce fast and compact code.
48 / 50
LR parsing _____ a string to the start symbol by inverting productions.
49 / 50
_______ algorithm is used in DFA minimization.
50 / 50
Recursive _____ parsing is done for LL(1) grammar.
Your score is
The average score is 0%
Restart quiz
