CS606-Midterm
1 / 50
In compilation process Hierarchical analysis is also called-----------
2 / 50
Consider the grammar
3 / 50
____________avoid hardware stalls and interlocks.
4 / 50
NFA is easy to implement as compared to DFA.
5 / 50
Which of the statement is true about Regular Languages?
6 / 50
LL(1) parsing is called non-predictive parsing.
7 / 50
Lexical Analyzer generator _______ is written in Java.
8 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
9 / 50
Functions of Lexical analyzer are?
10 / 50
Left factoring of a grammar is done to save the parser from back tracking.
11 / 50
12 / 50
Bottom-up parsers handle a ________ class of grammars.
13 / 50
Parser takes tokens from scanner and tries to generate ______ .
14 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
15 / 50
_______ algorithm is used in DFA minimization.
16 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
17 / 50
LR parsing _____ a string to the start symbol by inverting productions.
18 / 50
___________ phase which supports macro substitution and conditional compilation.
19 / 50
20 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
21 / 50
22 / 50
Recursive ____________ parsing is done for LL(1) grammar.
23 / 50
24 / 50
Lexer and scanner are two different phases of compiler
25 / 50
Intermediate Representation (IR) stores the value of its operand in
26 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
27 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
28 / 50
In parser the two LL stand(s) for ____________ .
29 / 50
The non-terminal _______ is left recursive.
30 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
31 / 50
Compilers are sometimes classified as.
32 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
33 / 50
In a transition table cells of the table contain the ________ state.
34 / 50
Follow of B is ____ .
35 / 50
36 / 50
37 / 50
In predictive parsing table the rows are ___________ .
38 / 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
39 / 50
In multi pass compiler during the first pass it gathers information about __________ .
40 / 50
Left factoring is enough to make a grammar LL(1).
41 / 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.
42 / 50
Left factoring is enough to make LL1 grammar
43 / 50
44 / 50
In Back End module of compiler, optimal register allocation uses______ .
45 / 50
46 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
47 / 50
48 / 50
AST summarizes the grammatical structure with the details of derivations.
49 / 50
We can get an LL(1) grammar by _______ .
50 / 50
A _______ is a top down parser.
Your score is
The average score is 0%
Restart quiz
