CS606-Midterm
1 / 50
Left factoring is enough to make a grammar LL(1).
2 / 50
In predictive parsing table the rows are ___________ .
3 / 50
Consider the grammar
4 / 50
___________ phase which supports macro substitution and conditional compilation.
5 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
6 / 50
Left factoring of a grammar is done to save the parser from back tracking.
7 / 50
8 / 50
In compilation process Hierarchical analysis is also called
9 / 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.
10 / 50
______ phase which supports macro substitution and conditional compilation.
11 / 50
In a transition table cells of the table contain the ________ state.
12 / 50
_______ algorithm is used in DFA minimization.
13 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
14 / 50
Bottom-up parsers handle a ________ class of grammars.
15 / 50
We can get an LL(1) grammar by _______ .
16 / 50
In Flex specification file different sections are separated by ________ .
17 / 50
Recursive ____________ parsing is done for LL(1) grammar.
18 / 50
____is evaluated to yield a value.
19 / 50
Follow of B is ____ .
20 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
21 / 50
Lexical Analyzer generator _______ is written in Java.
22 / 50
____________avoid hardware stalls and interlocks.
23 / 50
AST summarizes the grammatical structure with the details of derivations.
24 / 50
First of C is ______ .
25 / 50
Parser takes tokens from scanner and tries to generate ______ .
26 / 50
Front end of two pass compiler takes________ as input.
27 / 50
28 / 50
Responsibility of _____ is to produce fast and compact code.
29 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
30 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
31 / 50
32 / 50
LR parsers can handle _______ grammars.
33 / 50
34 / 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
35 / 50
NFA is easy to implement as compared to DFA.
36 / 50
37 / 50
38 / 50
LL(1) parsing is called non-predictive parsing.
39 / 50
45.Follow of C is ____ .
40 / 50
41 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
42 / 50
43 / 50
LR parsing _____ a string to the start symbol by inverting productions.
44 / 50
An important component of semantic analysis is _________ .
45 / 50
Recursive _____ parsing is done for LL(1) grammar.
46 / 50
Compilers are sometimes classified as.
47 / 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.
48 / 50
Front-end of a two pass compiler is consists of Scanner.
49 / 50
Parser takes tokens from scanner and tries to generate______ .
50 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
Your score is
The average score is 0%
Restart quiz
