CS606-Midterm
1 / 50
LR parsers can handle _______ grammars.
2 / 50
In predictive parsing table the rows are ___________ .
3 / 50
LL(1) parsing is called non-predictive parsing.
4 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
5 / 50
Left factoring of a grammar is done to save the parser from back tracking.
6 / 50
Intermediate Representation (IR) stores the value of its operand in
7 / 50
In Back End module of compiler, optimal register allocation uses______ .
8 / 50
In multi pass compiler during the first pass it gathers information about __________ .
9 / 50
In PASCAL ___________ represent the inequality test.
10 / 50
Front end of two pass compiler takes________ as input.
11 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
12 / 50
In compilation process Hierarchical analysis is also called
13 / 50
First of C is ______ .
14 / 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.
15 / 50
Lexical Analyzer generator _______ is written in Java.
16 / 50
Lexer and scanner are two different phases of compiler
17 / 50
Optimal registers allocation is an NP-hard problem.
18 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
19 / 50
We can get an LL(1) grammar by _______ .
20 / 50
Left factoring is enough to make LL1 grammar
21 / 50
AST summarizes the grammatical structure with the details of derivations.
22 / 50
_______ algorithm is used in DFA minimization.
23 / 50
Front-end of a two pass compiler is consists of Scanner.
24 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
25 / 50
Parser always gives a tree like structure as output
26 / 50
27 / 50
Compilers are sometimes classified as.
28 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
29 / 50
30 / 50
31 / 50
In a transition table cells of the table contain the ________ state.
32 / 50
33 / 50
Recursive ____________ parsing is done for LL(1) grammar.
34 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
35 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
36 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
37 / 50
Consider the grammar
38 / 50
____________avoid hardware stalls and interlocks.
39 / 50
LR parsing _____ a string to the start symbol by inverting productions.
40 / 50
Can a DFA simulate NFA?
41 / 50
Bottom-up parsers handle a ________ class of grammars.
42 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
43 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
44 / 50
45 / 50
46 / 50
45.Follow of C is ____ .
47 / 50
48 / 50
49 / 50
Parser takes tokens from scanner and tries to generate______ .
50 / 50
Your score is
The average score is 0%
Restart quiz
