CS606-Midterm
1 / 50
Optimal registers allocation is an NP-hard problem.
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
We can get an LL(1) grammar by _______ .
4 / 50
Follow of B is ____ .
5 / 50
Front-end of a two pass compiler is consists of Scanner.
6 / 50
In Back End module of compiler, optimal register allocation uses______ .
7 / 50
8 / 50
Lexical Analyzer generator _______ is written in Java.
9 / 50
Consider the grammar
10 / 50
LR parsers can handle _______ grammars.
11 / 50
Compilers are sometimes classified as.
12 / 50
In PASCAL ___________ represent the inequality test.
13 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
14 / 50
In predictive parsing table the rows are ___________ .
15 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
16 / 50
17 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
18 / 50
Lexer and scanner are two different phases of compiler
19 / 50
LL(1) parsing is called non-predictive parsing.
20 / 50
Recursive _____ parsing is done for LL(1) grammar.
21 / 50
45.Follow of C is ____ .
22 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
23 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
24 / 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.
25 / 50
NFA is easy to implement as compared to DFA.
26 / 50
Front end of two pass compiler takes________ as input.
27 / 50
28 / 50
29 / 50
____________avoid hardware stalls and interlocks.
30 / 50
_______ algorithm is used in DFA minimization.
31 / 50
Responsibility of _____ is to produce fast and compact code.
32 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
33 / 50
Left factoring is enough to make LL1 grammar
34 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
35 / 50
Left factoring of a grammar is done to save the parser from back tracking.
36 / 50
In compilation process Hierarchical analysis is also called
37 / 50
AST summarizes the grammatical structure with the details of derivations.
38 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
39 / 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
40 / 50
In multi pass compiler during the first pass it gathers information about __________ .
41 / 50
Recursive ____________ parsing is done for LL(1) grammar.
42 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
43 / 50
44 / 50
LR parsing _____ a string to the start symbol by inverting productions.
45 / 50
When generating a lexical analyzer from a ________ description, the item sets (states) are constructed by two types of “moves”: character moves and e moves.
46 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
47 / 50
Which of the statement is true about Regular Languages?
48 / 50
49 / 50
50 / 50
Your score is
The average score is 0%
Restart quiz
