CS606-Midterm
1 / 50
Parser takes tokens from scanner and tries to generate ______ .
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
In PASCAL ___________ represent the inequality test.
5 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
6 / 50
Optimal registers allocation is an NP-hard problem.
7 / 50
Lexical Analyzer generator _______ is written in Java.
8 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
9 / 50
LR parsing _____ a string to the start symbol by inverting productions.
10 / 50
NFA is easy to implement as compared to DFA.
11 / 50
Left factoring is enough to make LL1 grammar
12 / 50
AST summarizes the grammatical structure with the details of derivations.
13 / 50
LL(1) parsing is called non-predictive parsing.
14 / 50
LR parsers can handle _______ grammars.
15 / 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.
16 / 50
Lexer and scanner are two different phases of compiler
17 / 50
Consider the following grammar,
18 / 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.
19 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
20 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
21 / 50
In a transition table cells of the table contain the ________ state.
22 / 50
Front end of two pass compiler takes________ as input.
23 / 50
45.Follow of C is ____ .
24 / 50
Front-end of a two pass compiler is consists of Scanner.
25 / 50
_______ algorithm is used in DFA minimization.
26 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
27 / 50
28 / 50
29 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
30 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
31 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
32 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
33 / 50
In predictive parsing table the rows are ___________ .
34 / 50
35 / 50
Follow of B is ____ .
36 / 50
37 / 50
38 / 50
Left factoring of a grammar is done to save the parser from back tracking.
39 / 50
40 / 50
We can get an LL(1) grammar by _______ .
41 / 50
42 / 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.
43 / 50
44 / 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
45 / 50
In multi pass compiler during the first pass it gathers information about __________ .
46 / 50
47 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
48 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
49 / 50
In Back End module of compiler, optimal register allocation uses______ .
50 / 50
Functions of Lexical analyzer are?
Your score is
The average score is 0%
Restart quiz
