CS606-Midterm
1 / 50
LR parsers can handle _______ grammars.
2 / 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.
3 / 50
Lexical Analyzer generator _______ is written in Java.
4 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
5 / 50
Which of the statement is true about Regular Languages?
6 / 50
7 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
8 / 50
First of C is ______ .
9 / 50
We can get an LL(1) grammar by _______ .
10 / 50
45.Follow of C is ____ .
11 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
12 / 50
13 / 50
____________avoid hardware stalls and interlocks.
14 / 50
LL(1) parsing is called non-predictive parsing.
15 / 50
Left factoring is enough to make LL1 grammar
16 / 50
LR parsing _____ a string to the start symbol by inverting productions.
17 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
18 / 50
In a transition table cells of the table contain the ________ state.
19 / 50
In compilation process Hierarchical analysis is also called
20 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
21 / 50
Recursive ____________ parsing is done for LL(1) grammar.
22 / 50
Lexer and scanner are two different phases of compiler
23 / 50
An important component of semantic analysis is _________ .
24 / 50
In Back End module of compiler, optimal register allocation uses______ .
25 / 50
In multi pass compiler during the first pass it gathers information about __________ .
26 / 50
Front-end of a two pass compiler is consists of Scanner.
27 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
28 / 50
29 / 50
30 / 50
_______ algorithm is used in DFA minimization.
31 / 50
32 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
33 / 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.
34 / 50
Left factoring of a grammar is done to save the parser from back tracking.
35 / 50
Optimal registers allocation is an NP-hard problem.
36 / 50
37 / 50
Responsibility of _____ is to produce fast and compact code.
38 / 50
39 / 50
In compilation process Hierarchical analysis is also called-----------
40 / 50
41 / 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.
42 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
43 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
44 / 50
AST summarizes the grammatical structure with the details of derivations.
45 / 50
Consider the grammar
46 / 50
Intermediate Representation (IR) stores the value of its operand in
47 / 50
Parser takes tokens from scanner and tries to generate ______ .
48 / 50
49 / 50
50 / 50
Your score is
The average score is 0%
Restart quiz
