CS606-Midterm
1 / 50
Optimal registers allocation is an NP-hard problem.
2 / 50
____________avoid hardware stalls and interlocks.
3 / 50
AST summarizes the grammatical structure with the details of derivations.
4 / 50
_______ algorithm is used in DFA minimization.
5 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
6 / 50
Parser always gives a tree like structure as output
7 / 50
8 / 50
NFA is easy to implement as compared to DFA.
9 / 50
LR parsers can handle _______ grammars.
10 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
11 / 50
Left factoring is enough to make a grammar LL(1).
12 / 50
In parser the two LL stand(s) for ____________ .
13 / 50
Compilers are sometimes classified as.
14 / 50
15 / 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.
16 / 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.
17 / 50
Lexical Analyzer generator _______ is written in Java.
18 / 50
19 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
20 / 50
Left factoring is enough to make LL1 grammar
21 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
22 / 50
Left factoring of a grammar is done to save the parser from back tracking.
23 / 50
___________ phase which supports macro substitution and conditional compilation.
24 / 50
25 / 50
Parser takes tokens from scanner and tries to generate ______ .
26 / 50
Which of the statement is true about Regular Languages?
27 / 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.
28 / 50
Parser takes tokens from scanner and tries to generate______ .
29 / 50
30 / 50
Responsibility of _____ is to produce fast and compact code.
31 / 50
LL(1) parsing is called non-predictive parsing.
32 / 50
Consider the grammar
33 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
34 / 50
In Back End module of compiler, optimal register allocation uses______ .
35 / 50
36 / 50
37 / 50
An important component of semantic analysis is _________ .
38 / 50
39 / 50
Can a DFA simulate NFA?
40 / 50
LR parsing _____ a string to the start symbol by inverting productions.
41 / 50
42 / 50
43 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
44 / 50
45 / 50
46 / 50
Front-end of a two pass compiler is consists of Scanner.
47 / 50
In PASCAL ___________ represent the inequality test.
48 / 50
49 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
50 / 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
Your score is
The average score is 0%
Restart quiz
