CS606-Midterm
1 / 50
Consider the grammar
2 / 50
Optimal registers allocation is an NP-hard problem.
3 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
4 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
5 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
6 / 50
Left factoring is enough to make LL1 grammar
7 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
8 / 50
A _______ is a top down parser.
9 / 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
10 / 50
____________avoid hardware stalls and interlocks.
11 / 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.
12 / 50
13 / 50
LR parsers can handle _______ grammars.
14 / 50
Lexer and scanner are two different phases of compiler
15 / 50
Which of the statement is true about Regular Languages?
16 / 50
Recursive ____________ parsing is done for LL(1) grammar.
17 / 50
18 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
19 / 50
Parser takes tokens from scanner and tries to generate ______ .
20 / 50
Intermediate Representation (IR) stores the value of its operand in
21 / 50
We can get an LL(1) grammar by _______ .
22 / 50
In predictive parsing table the rows are ___________ .
23 / 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.
24 / 50
In compilation process Hierarchical analysis is also called-----------
25 / 50
In PASCAL ___________ represent the inequality test.
26 / 50
27 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
28 / 50
Left factoring of a grammar is done to save the parser from back tracking.
29 / 50
Lexical Analyzer generator _______ is written in Java.
30 / 50
31 / 50
_______ algorithm is used in DFA minimization.
32 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
33 / 50
LL(1) parsing is called non-predictive parsing.
34 / 50
In a transition table cells of the table contain the ________ state.
35 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
36 / 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.
37 / 50
The non-terminal _______ is left recursive.
38 / 50
Front end of two pass compiler takes________ as input.
39 / 50
40 / 50
41 / 50
42 / 50
First of C is ______ .
43 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
44 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
45 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
46 / 50
Front-end of a two pass compiler is consists of Scanner.
47 / 50
____is evaluated to yield a value.
48 / 50
Compilers are sometimes classified as.
49 / 50
AST summarizes the grammatical structure with the details of derivations.
50 / 50
Your score is
The average score is 0%
Restart quiz
