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