CS606-Midterm
1 / 50
Optimal registers allocation is an NP-hard problem.
2 / 50
Recursive _____ parsing is done for LL(1) grammar.
3 / 50
In predictive parsing table the rows are ___________ .
4 / 50
The non-terminal _______ is left recursive.
5 / 50
In Back End module of compiler, optimal register allocation uses______ .
6 / 50
Follow of B is ____ .
7 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
8 / 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.
9 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
10 / 50
Recursive ____________ parsing is done for LL(1) grammar.
11 / 50
AST summarizes the grammatical structure with the details of derivations.
12 / 50
LR parsing _____ a string to the start symbol by inverting productions.
13 / 50
Responsibility of _____ is to produce fast and compact code.
14 / 50
LR parsers can handle _______ grammars.
15 / 50
16 / 50
Compilers are sometimes classified as.
17 / 50
Left factoring is enough to make LL1 grammar
18 / 50
Consider the grammar
19 / 50
Which of the statement is true about Regular Languages?
20 / 50
21 / 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.
22 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
23 / 50
LL(1) parsing is called non-predictive parsing.
24 / 50
Functions of Lexical analyzer are?
25 / 50
An important component of semantic analysis is _________ .
26 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
27 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
28 / 50
Front-end of a two pass compiler is consists of Scanner.
29 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
30 / 50
Left factoring is enough to make a grammar LL(1).
31 / 50
Lexer and scanner are two different phases of compiler
32 / 50
33 / 50
34 / 50
Parser always gives a tree like structure as output
35 / 50
Consider the following grammar,
36 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
37 / 50
38 / 50
Lexical Analyzer generator _______ is written in Java.
39 / 50
40 / 50
___________ phase which supports macro substitution and conditional compilation.
41 / 50
42 / 50
NFA is easy to implement as compared to DFA.
43 / 50
44 / 50
Left factoring of a grammar is done to save the parser from back tracking.
45 / 50
46 / 50
Parser takes tokens from scanner and tries to generate______ .
47 / 50
48 / 50
49 / 50
In a transition table cells of the table contain the ________ state.
50 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
Your score is
The average score is 0%
Restart quiz
