CS606-Midterm
1 / 50
______ phase which supports macro substitution and conditional compilation.
2 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
3 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
4 / 50
Parser always gives a tree like structure as output
5 / 50
Left factoring is enough to make LL1 grammar
6 / 50
Functions of Lexical analyzer are?
7 / 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.
8 / 50
9 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
10 / 50
In predictive parsing table the rows are ___________ .
11 / 50
Optimal registers allocation is an NP-hard problem.
12 / 50
Left factoring of a grammar is done to save the parser from back tracking.
13 / 50
____is evaluated to yield a value.
14 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
15 / 50
Front end of two pass compiler takes________ as input.
16 / 50
Parser takes tokens from scanner and tries to generate______ .
17 / 50
Consider the grammar
18 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
19 / 50
Recursive _____ parsing is done for LL(1) grammar.
20 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
21 / 50
_______ algorithm is used in DFA minimization.
22 / 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.
23 / 50
24 / 50
25 / 50
LR parsing _____ a string to the start symbol by inverting productions.
26 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
27 / 50
Bottom-up parsers handle a ________ class of grammars.
28 / 50
29 / 50
In PASCAL ___________ represent the inequality test.
30 / 50
In compilation process Hierarchical analysis is also called-----------
31 / 50
Recursive ____________ parsing is done for LL(1) grammar.
32 / 50
In Back End module of compiler, optimal register allocation uses______ .
33 / 50
Compilers are sometimes classified as.
34 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
35 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
36 / 50
37 / 50
38 / 50
Lexer and scanner are two different phases of compiler
39 / 50
Intermediate Representation (IR) stores the value of its operand in
40 / 50
41 / 50
Lexical Analyzer generator _______ is written in Java.
42 / 50
First of C is ______ .
43 / 50
___________ phase which supports macro substitution and conditional compilation.
44 / 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.
45 / 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.
46 / 50
Responsibility of _____ is to produce fast and compact code.
47 / 50
45.Follow of C is ____ .
48 / 50
In Flex specification file different sections are separated by ________ .
49 / 50
50 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
Your score is
The average score is 0%
Restart quiz
