CS606-Midterm
1 / 50
Lexical Analyzer generator _______ is written in Java.
2 / 50
Lexer and scanner are two different phases of compiler
3 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
4 / 50
5 / 50
In parser the two LL stand(s) for ____________ .
6 / 50
Left factoring is enough to make a grammar LL(1).
7 / 50
In predictive parsing table the rows are ___________ .
8 / 50
Recursive ____________ parsing is done for LL(1) grammar.
9 / 50
LR parsing _____ a string to the start symbol by inverting productions.
10 / 50
Parser takes tokens from scanner and tries to generate ______ .
11 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
12 / 50
Follow of B is ____ .
13 / 50
Front end of two pass compiler takes________ as input.
14 / 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
15 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
16 / 50
17 / 50
Optimal registers allocation is an NP-hard problem.
18 / 50
A _______ is a top down parser.
19 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
20 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
21 / 50
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
In Back End module of compiler, optimal register allocation uses______ .
24 / 50
25 / 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.
26 / 50
______ phase which supports macro substitution and conditional compilation.
27 / 50
LR parsers can handle _______ grammars.
28 / 50
Intermediate Representation (IR) stores the value of its operand in
29 / 50
30 / 50
Front-end of a two pass compiler is consists of Scanner.
31 / 50
Compilers are sometimes classified as.
32 / 50
In multi pass compiler during the first pass it gathers information about __________ .
33 / 50
34 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
35 / 50
We can get an LL(1) grammar by _______ .
36 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
37 / 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.
38 / 50
Left factoring of a grammar is done to save the parser from back tracking.
39 / 50
___________ phase which supports macro substitution and conditional compilation.
40 / 50
Consider the grammar
41 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
42 / 50
_______ algorithm is used in DFA minimization.
43 / 50
44 / 50
Left factoring is enough to make LL1 grammar
45 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
46 / 50
____is evaluated to yield a value.
47 / 50
48 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
49 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
50 / 50
NFA is easy to implement as compared to DFA.
Your score is
The average score is 0%
Restart quiz
