CS606-Midterm
1 / 50
_______ algorithm is used in DFA minimization.
2 / 50
First of C is ______ .
3 / 50
Recursive ____________ parsing is done for LL(1) grammar.
4 / 50
In parser the two LL stand(s) for ____________ .
5 / 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.
6 / 50
Consider the grammar
7 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
8 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
9 / 50
Compilers are sometimes classified as.
10 / 50
Left factoring of a grammar is done to save the parser from back tracking.
11 / 50
Optimal registers allocation is an NP-hard problem.
12 / 50
In PASCAL ___________ represent the inequality test.
13 / 50
14 / 50
Lexer and scanner are two different phases of compiler
15 / 50
Lexical Analyzer generator _______ is written in Java.
16 / 50
Left factoring is enough to make LL1 grammar
17 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
18 / 50
Functions of Lexical analyzer are?
19 / 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.
20 / 50
An important component of semantic analysis is _________ .
21 / 50
In a transition table cells of the table contain the ________ state.
22 / 50
Bottom-up parsers handle a ________ class of grammars.
23 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
24 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
25 / 50
Consider the following grammar,
26 / 50
We can get an LL(1) grammar by _______ .
27 / 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.
28 / 50
In predictive parsing table the rows are ___________ .
29 / 50
Parser takes tokens from scanner and tries to generate ______ .
30 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
31 / 50
In Back End module of compiler, optimal register allocation uses______ .
32 / 50
LR parsers can handle _______ grammars.
33 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
34 / 50
35 / 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.
36 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
37 / 50
38 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
39 / 50
40 / 50
___________ phase which supports macro substitution and conditional compilation.
41 / 50
Front-end of a two pass compiler is consists of Scanner.
42 / 50
Which of the statement is true about Regular Languages?
43 / 50
44 / 50
NFA is easy to implement as compared to DFA.
45 / 50
46 / 50
In multi pass compiler during the first pass it gathers information about __________ .
47 / 50
LR parsing _____ a string to the start symbol by inverting productions.
48 / 50
Responsibility of _____ is to produce fast and compact code.
49 / 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.
50 / 50
Your score is
The average score is 0%
Restart quiz
