CS606-Midterm
1 / 50
Lexer and scanner are two different phases of compiler
2 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
3 / 50
Front end of two pass compiler takes________ as input.
4 / 50
Functions of Lexical analyzer are?
5 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
6 / 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.
7 / 50
In PASCAL ___________ represent the inequality test.
8 / 50
Front-end of a two pass compiler is consists of Scanner.
9 / 50
___________ phase which supports macro substitution and conditional compilation.
10 / 50
Can a DFA simulate NFA?
11 / 50
We can get an LL(1) grammar by _______ .
12 / 50
Parser always gives a tree like structure as output
13 / 50
First of C is ______ .
14 / 50
Left factoring is enough to make LL1 grammar
15 / 50
Lexical Analyzer generator _______ is written in Java.
16 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
17 / 50
An important component of semantic analysis is _________ .
18 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
19 / 50
Consider the grammar
20 / 50
Recursive ____________ parsing is done for LL(1) grammar.
21 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
22 / 50
Bottom-up parsers handle a ________ class of grammars.
23 / 50
Responsibility of _____ is to produce fast and compact code.
24 / 50
25 / 50
Optimal registers allocation is an NP-hard problem.
26 / 50
27 / 50
28 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
29 / 50
In Back End module of compiler, optimal register allocation uses______ .
30 / 50
Left factoring of a grammar is done to save the parser from back tracking.
31 / 50
______ phase which supports macro substitution and conditional compilation.
32 / 50
33 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
34 / 50
NFA is easy to implement as compared to DFA.
35 / 50
In Flex specification file different sections are separated by ________ .
36 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
37 / 50
____________avoid hardware stalls and interlocks.
38 / 50
We use ----- to mark the bottom of the stack and also the right end of the input when considering the Stack implementation of Shift-Reduce Parsing.
39 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
40 / 50
41 / 50
42 / 50
_______ algorithm is used in DFA minimization.
43 / 50
44 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
45 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
46 / 50
____is evaluated to yield a value.
47 / 50
48 / 50
Intermediate Representation (IR) stores the value of its operand in
49 / 50
In a transition table cells of the table contain the ________ state.
50 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
Your score is
The average score is 0%
Restart quiz
