CS606-Midterm
1 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
2 / 50
LL(1) parsing is called non-predictive parsing.
3 / 50
Follow of B is ____ .
4 / 50
In multi pass compiler during the first pass it gathers information about __________ .
5 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
6 / 50
Lexical Analyzer generator _______ is written in Java.
7 / 50
Intermediate Representation (IR) stores the value of its operand in
8 / 50
We can get an LL(1) grammar by _______ .
9 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
10 / 50
Recursive ____________ parsing is done for LL(1) grammar.
11 / 50
LR parsers can handle _______ grammars.
12 / 50
13 / 50
14 / 50
15 / 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.
16 / 50
___________ phase which supports macro substitution and conditional compilation.
17 / 50
18 / 50
19 / 50
AST summarizes the grammatical structure with the details of derivations.
20 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
21 / 50
Parser takes tokens from scanner and tries to generate ______ .
22 / 50
23 / 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
24 / 50
Can a DFA simulate NFA?
25 / 50
Lexer and scanner are two different phases of compiler
26 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
27 / 50
28 / 50
Consider the grammar
29 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
30 / 50
A _______ is a top down parser.
31 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
32 / 50
Recursive _____ parsing is done for LL(1) grammar.
33 / 50
An important component of semantic analysis is _________ .
34 / 50
In a transition table cells of the table contain the ________ state.
35 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
36 / 50
NFA is easy to implement as compared to DFA.
37 / 50
38 / 50
In compilation process Hierarchical analysis is also called
39 / 50
____is evaluated to yield a value.
40 / 50
Parser takes tokens from scanner and tries to generate______ .
41 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
42 / 50
Compilers are sometimes classified as.
43 / 50
First of C is ______ .
44 / 50
The non-terminal _______ is left recursive.
45 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
46 / 50
47 / 50
48 / 50
49 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
50 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
Your score is
The average score is 0%
Restart quiz
