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