CS606-Midterm
1 / 50
An important component of semantic analysis is _________ .
2 / 50
LR parsers can handle _______ grammars.
3 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
4 / 50
In multi pass compiler during the first pass it gathers information about __________ .
5 / 50
___________ phase which supports macro substitution and conditional compilation.
6 / 50
_______ algorithm is used in DFA minimization.
7 / 50
Consider the grammar
8 / 50
Responsibility of _____ is to produce fast and compact code.
9 / 50
Front end of two pass compiler takes________ as input.
10 / 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.
11 / 50
Parser takes tokens from scanner and tries to generate ______ .
12 / 50
Compilers are sometimes classified as.
13 / 50
Which of the statement is true about Regular Languages?
14 / 50
15 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
16 / 50
In a transition table cells of the table contain the ________ state.
17 / 50
Lexer and scanner are two different phases of compiler
18 / 50
____________avoid hardware stalls and interlocks.
19 / 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.
20 / 50
Can a DFA simulate NFA?
21 / 50
22 / 50
LR parsing _____ a string to the start symbol by inverting productions.
23 / 50
24 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
25 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
26 / 50
____is evaluated to yield a value.
27 / 50
We can get an LL(1) grammar by _______ .
28 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
29 / 50
Optimal registers allocation is an NP-hard problem.
30 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
31 / 50
32 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
33 / 50
Follow of B is ____ .
34 / 50
Recursive ____________ parsing is done for LL(1) grammar.
35 / 50
36 / 50
In Flex specification file different sections are separated by ________ .
37 / 50
38 / 50
Lexical Analyzer generator _______ is written in Java.
39 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
40 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
41 / 50
Front-end of a two pass compiler is consists of Scanner.
42 / 50
43 / 50
44 / 50
45 / 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.
46 / 50
47 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
48 / 50
Intermediate Representation (IR) stores the value of its operand in
49 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
50 / 50
AST summarizes the grammatical structure with the details of derivations.
Your score is
The average score is 0%
Restart quiz
