CS606-Midterm
1 / 50
A _______ is a top down parser.
2 / 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
3 / 50
In compilation process Hierarchical analysis is also called
4 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
5 / 50
In predictive parsing table the rows are ___________ .
6 / 50
_______ algorithm is used in DFA minimization.
7 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
8 / 50
Which of the statement is true about Regular Languages?
9 / 50
Parser takes tokens from scanner and tries to generate ______ .
10 / 50
In parser the two LL stand(s) for ____________ .
11 / 50
____________avoid hardware stalls and interlocks.
12 / 50
AST summarizes the grammatical structure with the details of derivations.
13 / 50
Left factoring is enough to make LL1 grammar
14 / 50
The non-terminal _______ is left recursive.
15 / 50
Responsibility of _____ is to produce fast and compact code.
16 / 50
Intermediate Representation (IR) stores the value of its operand in
17 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
18 / 50
Compilers are sometimes classified as.
19 / 50
Front end of two pass compiler takes________ as input.
20 / 50
Left factoring is enough to make a grammar LL(1).
21 / 50
Can a DFA simulate NFA?
22 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
23 / 50
Follow of B is ____ .
24 / 50
Left factoring of a grammar is done to save the parser from back tracking.
25 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
26 / 50
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
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.
30 / 50
Lexical Analyzer generator _______ is written in Java.
31 / 50
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
LR parsing _____ a string to the start symbol by inverting productions.
36 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
37 / 50
38 / 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.
39 / 50
An important component of semantic analysis is _________ .
40 / 50
Consider the following grammar,
41 / 50
Functions of Lexical analyzer are?
42 / 50
43 / 50
Parser takes tokens from scanner and tries to generate______ .
44 / 50
45 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
46 / 50
Lexer and scanner are two different phases of compiler
47 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
48 / 50
49 / 50
50 / 50
Your score is
The average score is 0%
Restart quiz
