CS606-Midterm
1 / 50
Which of the statement is true about Regular Languages?
2 / 50
Responsibility of _____ is to produce fast and compact code.
3 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
4 / 50
LR parsers can handle _______ grammars.
5 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
6 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
7 / 50
____is evaluated to yield a value.
8 / 50
_______ algorithm is used in DFA minimization.
9 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
10 / 50
Left factoring is enough to make LL1 grammar
11 / 50
12 / 50
In predictive parsing table the rows are ___________ .
13 / 50
In Back End module of compiler, optimal register allocation uses______ .
14 / 50
We can get an LL(1) grammar by _______ .
15 / 50
An important component of semantic analysis is _________ .
16 / 50
____________avoid hardware stalls and interlocks.
17 / 50
Left factoring of a grammar is done to save the parser from back tracking.
18 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
19 / 50
Consider the following grammar,
20 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
21 / 50
22 / 50
In parser the two LL stand(s) for ____________ .
23 / 50
Consider the grammar
24 / 50
25 / 50
Optimal registers allocation is an NP-hard problem.
26 / 50
Front end of two pass compiler takes________ as input.
27 / 50
In a transition table cells of the table contain the ________ state.
28 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
29 / 50
30 / 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.
31 / 50
LL(1) parsing is called non-predictive parsing.
32 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
33 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
34 / 50
Compilers are sometimes classified as.
35 / 50
In compilation process Hierarchical analysis is also called-----------
36 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
37 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
38 / 50
AST summarizes the grammatical structure with the details of derivations.
39 / 50
45.Follow of C is ____ .
40 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
41 / 50
42 / 50
43 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
44 / 50
45 / 50
Recursive ____________ parsing is done for LL(1) grammar.
46 / 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.
47 / 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.
48 / 50
49 / 50
50 / 50
Lexical Analyzer generator _______ is written in Java.
Your score is
The average score is 0%
Restart quiz
