CS606-Midterm
1 / 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.
2 / 50
Optimal registers allocation is an NP-hard problem.
3 / 50
Front end of two pass compiler takes________ as input.
4 / 50
Consider the grammar
5 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
6 / 50
_______ algorithm is used in DFA minimization.
7 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
8 / 50
In predictive parsing table the rows are ___________ .
9 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
10 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
11 / 50
In parser the two LL stand(s) for ____________ .
12 / 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.
13 / 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.
14 / 50
Lexical Analyzer generator _______ is written in Java.
15 / 50
Recursive ____________ parsing is done for LL(1) grammar.
16 / 50
___________ phase which supports macro substitution and conditional compilation.
17 / 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.
18 / 50
19 / 50
Recursive _____ parsing is done for LL(1) grammar.
20 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
21 / 50
A _______ is a top down parser.
22 / 50
Front-end of a two pass compiler is consists of Scanner.
23 / 50
Follow of B is ____ .
24 / 50
LL(1) parsing is called non-predictive parsing.
25 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
26 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
27 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
28 / 50
29 / 50
30 / 50
LR parsers can handle _______ grammars.
31 / 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.
32 / 50
Consider the following grammar,
33 / 50
34 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
35 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
36 / 50
In compilation process Hierarchical analysis is also called-----------
37 / 50
Left factoring is enough to make LL1 grammar
38 / 50
AST summarizes the grammatical structure with the details of derivations.
39 / 50
40 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
41 / 50
Which of the statement is true about Regular Languages?
42 / 50
Compilers are sometimes classified as.
43 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
44 / 50
In PASCAL ___________ represent the inequality test.
45 / 50
We can get an LL(1) grammar by _______ .
46 / 50
Parser always gives a tree like structure as output
47 / 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
48 / 50
NFA is easy to implement as compared to DFA.
49 / 50
50 / 50
Your score is
The average score is 0%
Restart quiz
