CS606-Midterm
1 / 50
Responsibility of _____ is to produce fast and compact code.
2 / 50
Left factoring of a grammar is done to save the parser from back tracking.
3 / 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
4 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
5 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
6 / 50
Optimal registers allocation is an NP-hard problem.
7 / 50
In a transition table cells of the table contain the ________ state.
8 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
9 / 50
In compilation process Hierarchical analysis is also called
10 / 50
LL(1) parsing is called non-predictive parsing.
11 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
12 / 50
We can get an LL(1) grammar by _______ .
13 / 50
14 / 50
Lexical Analyzer generator _______ is written in Java.
15 / 50
____________avoid hardware stalls and interlocks.
16 / 50
Parser always gives a tree like structure as output
17 / 50
18 / 50
Functions of Lexical analyzer are?
19 / 50
Which of the statement is true about Regular Languages?
20 / 50
21 / 50
Intermediate Representation (IR) stores the value of its operand in
22 / 50
23 / 50
Consider the grammar
24 / 50
Parser takes tokens from scanner and tries to generate______ .
25 / 50
In multi pass compiler during the first pass it gathers information about __________ .
26 / 50
AST summarizes the grammatical structure with the details of derivations.
27 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
28 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
29 / 50
Left factoring is enough to make LL1 grammar
30 / 50
___________ phase which supports macro substitution and conditional compilation.
31 / 50
LR parsing _____ a string to the start symbol by inverting productions.
32 / 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.
33 / 50
Follow of B is ____ .
34 / 50
Can a DFA simulate NFA?
35 / 50
Consider the following grammar,
36 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
37 / 50
38 / 50
_______ algorithm is used in DFA minimization.
39 / 50
In Flex specification file different sections are separated by ________ .
40 / 50
41 / 50
42 / 50
Compilers are sometimes classified as.
43 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
44 / 50
In Back End module of compiler, optimal register allocation uses______ .
45 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
46 / 50
Front-end of a two pass compiler is consists of Scanner.
47 / 50
A _______ is a top down parser.
48 / 50
Lexer and scanner are two different phases of compiler
49 / 50
45.Follow of C is ____ .
50 / 50
An important component of semantic analysis is _________ .
Your score is
The average score is 0%
Restart quiz
