CS606-Midterm
1 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
2 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
3 / 50
In PASCAL ___________ represent the inequality test.
4 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
5 / 50
______ phase which supports macro substitution and conditional compilation.
6 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
7 / 50
Consider the following grammar,
8 / 50
First of C is ______ .
9 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
10 / 50
Front-end of a two pass compiler is consists of Scanner.
11 / 50
When generating a lexical analyzer from a ________ description, the item sets (states) are constructed by two types of “moves”: character moves and e moves.
12 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
13 / 50
Parser takes tokens from scanner and tries to generate ______ .
14 / 50
Recursive ____________ parsing is done for LL(1) grammar.
15 / 50
_______ algorithm is used in DFA minimization.
16 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
17 / 50
Intermediate Representation (IR) stores the value of its operand in
18 / 50
LL(1) parsing is called non-predictive parsing.
19 / 50
LR parsers can handle _______ grammars.
20 / 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.
21 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
22 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
23 / 50
Can a DFA simulate NFA?
24 / 50
Lexical Analyzer generator _______ is written in Java.
25 / 50
Follow of B is ____ .
26 / 50
Parser always gives a tree like structure as output
27 / 50
In multi pass compiler during the first pass it gathers information about __________ .
28 / 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.
29 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
30 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
31 / 50
32 / 50
____________avoid hardware stalls and interlocks.
33 / 50
AST summarizes the grammatical structure with the details of derivations.
34 / 50
In Back End module of compiler, optimal register allocation uses______ .
35 / 50
Functions of Lexical analyzer are?
36 / 50
37 / 50
38 / 50
39 / 50
In predictive parsing table the rows are ___________ .
40 / 50
Left factoring is enough to make LL1 grammar
41 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
42 / 50
43 / 50
Parser takes tokens from scanner and tries to generate______ .
44 / 50
Compilers are sometimes classified as.
45 / 50
In a transition table cells of the table contain the ________ state.
46 / 50
In Flex specification file different sections are separated by ________ .
47 / 50
Optimal registers allocation is an NP-hard problem.
48 / 50
___________ phase which supports macro substitution and conditional compilation.
49 / 50
50 / 50
Your score is
The average score is 0%
Restart quiz
