CS606-Midterm
1 / 50
Parser always gives a tree like structure as output
2 / 50
Lexical Analyzer generator _______ is written in Java.
3 / 50
Lexer and scanner are two different phases of compiler
4 / 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.
5 / 50
LL(1) parsing is called non-predictive parsing.
6 / 50
LR parsers can handle _______ grammars.
7 / 50
Front end of two pass compiler takes________ as input.
8 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
9 / 50
Follow of B is ____ .
10 / 50
Recursive _____ parsing is done for LL(1) grammar.
11 / 50
Parser takes tokens from scanner and tries to generate ______ .
12 / 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.
13 / 50
14 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
15 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
16 / 50
In Back End module of compiler, optimal register allocation uses______ .
17 / 50
18 / 50
Which of the statement is true about Regular Languages?
19 / 50
In a transition table cells of the table contain the ________ state.
20 / 50
Parser takes tokens from scanner and tries to generate______ .
21 / 50
Consider the grammar
22 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
23 / 50
24 / 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
25 / 50
26 / 50
Left factoring of a grammar is done to save the parser from back tracking.
27 / 50
28 / 50
______ phase which supports macro substitution and conditional compilation.
29 / 50
30 / 50
A _______ is a top down parser.
31 / 50
The non-terminal _______ is left recursive.
32 / 50
In predictive parsing table the rows are ___________ .
33 / 50
34 / 50
In compilation process Hierarchical analysis is also called-----------
35 / 50
In parser the two LL stand(s) for ____________ .
36 / 50
LR parsing _____ a string to the start symbol by inverting productions.
37 / 50
_______ algorithm is used in DFA minimization.
38 / 50
Optimal registers allocation is an NP-hard problem.
39 / 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.
40 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
41 / 50
In Flex specification file different sections are separated by ________ .
42 / 50
____________avoid hardware stalls and interlocks.
43 / 50
Compilers are sometimes classified as.
44 / 50
45 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
46 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
47 / 50
Intermediate Representation (IR) stores the value of its operand in
48 / 50
49 / 50
In multi pass compiler during the first pass it gathers information about __________ .
50 / 50
An important component of semantic analysis is _________ .
Your score is
The average score is 0%
Restart quiz
