CS606-Midterm
1 / 50
LL(1) parsing is called non-predictive parsing.
2 / 50
Optimal registers allocation is an NP-hard problem.
3 / 50
In a transition table cells of the table contain the ________ state.
4 / 50
Functions of Lexical analyzer are?
5 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
6 / 50
In predictive parsing table the rows are ___________ .
7 / 50
____________avoid hardware stalls and interlocks.
8 / 50
When generating a lexical analyzer from a token description, the item sets (states) are constructed by two types of “moves”: character moves and ____ moves.
9 / 50
In compilation process Hierarchical analysis is also called
10 / 50
Lexical Analyzer generator _______ is written in Java.
11 / 50
Responsibility of _____ is to produce fast and compact code.
12 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
13 / 50
14 / 50
Which of the statement is true about Regular Languages?
15 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
16 / 50
_______ algorithm is used in DFA minimization.
17 / 50
Front end of two pass compiler takes________ as input.
18 / 50
AST summarizes the grammatical structure with the details of derivations.
19 / 50
20 / 50
First of C is ______ .
21 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
22 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
23 / 50
___________ phase which supports macro substitution and conditional compilation.
24 / 50
An important component of semantic analysis is _________ .
25 / 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
26 / 50
27 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
28 / 50
Can a DFA simulate NFA?
29 / 50
Intermediate Representation (IR) stores the value of its operand in
30 / 50
31 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
32 / 50
NFA is easy to implement as compared to DFA.
33 / 50
Left factoring of a grammar is done to save the parser from back tracking.
34 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
35 / 50
Left factoring is enough to make LL1 grammar
36 / 50
In Flex specification file different sections are separated by ________ .
37 / 50
In PASCAL ___________ represent the inequality test.
38 / 50
39 / 50
Lexer and scanner are two different phases of compiler
40 / 50
45.Follow of C is ____ .
41 / 50
42 / 50
43 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
44 / 50
Consider the following grammar,
45 / 50
Parser takes tokens from scanner and tries to generate ______ .
46 / 50
Recursive ____________ parsing is done for LL(1) grammar.
47 / 50
Front-end of a two pass compiler is consists of Scanner.
48 / 50
49 / 50
______ phase which supports macro substitution and conditional compilation.
50 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
Your score is
The average score is 0%
Restart quiz
