CS606-Midterm
1 / 50
In multi pass compiler during the first pass it gathers information about __________ .
2 / 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.
3 / 50
Front end of two pass compiler takes________ as input.
4 / 50
Front-end of a two pass compiler is consists of Scanner.
5 / 50
We can get an LL(1) grammar by _______ .
6 / 50
Which of the statement is true about Regular Languages?
7 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
8 / 50
NFA is easy to implement as compared to DFA.
9 / 50
An important component of semantic analysis is _________ .
10 / 50
Left factoring is enough to make a grammar LL(1).
11 / 50
In compilation process Hierarchical analysis is also called-----------
12 / 50
Optimal registers allocation is an NP-hard problem.
13 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
14 / 50
Recursive _____ parsing is done for LL(1) grammar.
15 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
16 / 50
17 / 50
AST summarizes the grammatical structure with the details of derivations.
18 / 50
Parser always gives a tree like structure as output
19 / 50
Recursive ____________ parsing is done for LL(1) grammar.
20 / 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.
21 / 50
Responsibility of _____ is to produce fast and compact code.
22 / 50
In a transition table cells of the table contain the ________ state.
23 / 50
In PASCAL ___________ represent the inequality test.
24 / 50
25 / 50
LL(1) parsing is called non-predictive parsing.
26 / 50
In predictive parsing table the rows are ___________ .
27 / 50
____________avoid hardware stalls and interlocks.
28 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
29 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
30 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
31 / 50
Lexical Analyzer generator _______ is written in Java.
32 / 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.
33 / 50
Left factoring is enough to make LL1 grammar
34 / 50
The non-terminal _______ is left recursive.
35 / 50
45.Follow of C is ____ .
36 / 50
37 / 50
LR parsing _____ a string to the start symbol by inverting productions.
38 / 50
39 / 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.
40 / 50
Consider the grammar
41 / 50
42 / 50
_______ algorithm is used in DFA minimization.
43 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
44 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
45 / 50
Bottom-up parsers handle a ________ class of grammars.
46 / 50
47 / 50
48 / 50
Functions of Lexical analyzer are?
49 / 50
Consider the following grammar,
50 / 50
______ phase which supports macro substitution and conditional compilation.
Your score is
The average score is 0%
Restart quiz
