CS606-Midterm
1 / 50
NFA is easy to implement as compared to DFA.
2 / 50
Left factoring is enough to make LL1 grammar
3 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
4 / 50
5 / 50
LR parsers can handle _______ grammars.
6 / 50
Front-end of a two pass compiler is consists of Scanner.
7 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
8 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
9 / 50
An important component of semantic analysis is _________ .
10 / 50
Left factoring of a grammar is done to save the parser from back tracking.
11 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
12 / 50
Parser always gives a tree like structure as output
13 / 50
Intermediate Representation (IR) stores the value of its operand in
14 / 50
15 / 50
Lexical Analyzer generator _______ is written in Java.
16 / 50
Recursive ____________ parsing is done for LL(1) grammar.
17 / 50
Parser takes tokens from scanner and tries to generate ______ .
18 / 50
19 / 50
20 / 50
Consider the grammar
21 / 50
Responsibility of _____ is to produce fast and compact code.
22 / 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.
23 / 50
24 / 50
Lexer and scanner are two different phases of compiler
25 / 50
26 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
27 / 50
In Flex specification file different sections are separated by ________ .
28 / 50
We can get an LL(1) grammar by _______ .
29 / 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.
30 / 50
Front end of two pass compiler takes________ as input.
31 / 50
32 / 50
33 / 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
34 / 50
In PASCAL ___________ represent the inequality test.
35 / 50
36 / 50
37 / 50
38 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
39 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
40 / 50
41 / 50
AST summarizes the grammatical structure with the details of derivations.
42 / 50
Optimal registers allocation is an NP-hard problem.
43 / 50
Functions of Lexical analyzer are?
44 / 50
Consider the following grammar,
45 / 50
Follow of B is ____ .
46 / 50
47 / 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.
48 / 50
49 / 50
50 / 50
Your score is
The average score is 0%
Restart quiz
