CS606-Midterm
1 / 50
Consider the grammar
2 / 50
Lexical Analyzer generator _______ is written in Java.
3 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
4 / 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.
5 / 50
An important component of semantic analysis is _________ .
6 / 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.
7 / 50
LL(1) parsing is called non-predictive parsing.
8 / 50
NFA is easy to implement as compared to DFA.
9 / 50
______ phase which supports macro substitution and conditional compilation.
10 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
11 / 50
Front end of two pass compiler takes________ as input.
12 / 50
Left factoring of a grammar is done to save the parser from back tracking.
13 / 50
LR parsers can handle _______ grammars.
14 / 50
___________ phase which supports macro substitution and conditional compilation.
15 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
16 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
17 / 50
A _______ is a top down parser.
18 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
19 / 50
In compilation process Hierarchical analysis is also called
20 / 50
In predictive parsing table the rows are ___________ .
21 / 50
Parser always gives a tree like structure as output
22 / 50
Responsibility of _____ is to produce fast and compact code.
23 / 50
Left factoring is enough to make a grammar LL(1).
24 / 50
25 / 50
In PASCAL ___________ represent the inequality test.
26 / 50
_______ algorithm is used in DFA minimization.
27 / 50
28 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
29 / 50
Which of the statement is true about Regular Languages?
30 / 50
31 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
32 / 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
33 / 50
Recursive _____ parsing is done for LL(1) grammar.
34 / 50
In multi pass compiler during the first pass it gathers information about __________ .
35 / 50
36 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
37 / 50
Optimal registers allocation is an NP-hard problem.
38 / 50
In Flex specification file different sections are separated by ________ .
39 / 50
40 / 50
Lexer and scanner are two different phases of compiler
41 / 50
Consider the following grammar,
42 / 50
We can get an LL(1) grammar by _______ .
43 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
44 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
45 / 50
Recursive ____________ parsing is done for LL(1) grammar.
46 / 50
First of C is ______ .
47 / 50
48 / 50
In Back End module of compiler, optimal register allocation uses______ .
49 / 50
In a transition table cells of the table contain the ________ state.
50 / 50
Parser takes tokens from scanner and tries to generate______ .
Your score is
The average score is 0%
Restart quiz
