CS606-Midterm
1 / 50
____________avoid hardware stalls and interlocks.
2 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
3 / 50
In multi pass compiler during the first pass it gathers information about __________ .
4 / 50
Compilers are sometimes classified as.
5 / 50
Optimal registers allocation is an NP-hard problem.
6 / 50
Left factoring of a grammar is done to save the parser from back tracking.
7 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
8 / 50
9 / 50
Functions of Lexical analyzer are?
10 / 50
Recursive _____ parsing is done for LL(1) grammar.
11 / 50
Consider the grammar
12 / 50
LL(1) parsing is called non-predictive parsing.
13 / 50
NFA is easy to implement as compared to DFA.
14 / 50
_______ algorithm is used in DFA minimization.
15 / 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
16 / 50
Which of the statement is true about Regular Languages?
17 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
18 / 50
19 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
20 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
21 / 50
In Back End module of compiler, optimal register allocation uses______ .
22 / 50
______ phase which supports macro substitution and conditional compilation.
23 / 50
24 / 50
Lexical Analyzer generator _______ is written in Java.
25 / 50
Parser takes tokens from scanner and tries to generate______ .
26 / 50
____is evaluated to yield a value.
27 / 50
Recursive ____________ parsing is done for LL(1) grammar.
28 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
29 / 50
30 / 50
We can get an LL(1) grammar by _______ .
31 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
32 / 50
45.Follow of C is ____ .
33 / 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.
34 / 50
Follow of B is ____ .
35 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
36 / 50
LR parsers can handle _______ grammars.
37 / 50
38 / 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.
39 / 50
40 / 50
A _______ is a top down parser.
41 / 50
In predictive parsing table the rows are ___________ .
42 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
43 / 50
44 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
45 / 50
In a transition table cells of the table contain the ________ state.
46 / 50
47 / 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.
48 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
49 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
50 / 50
Parser takes tokens from scanner and tries to generate ______ .
Your score is
The average score is 0%
Restart quiz
