CS606-Midterm
1 / 50
Functions of Lexical analyzer are?
2 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
3 / 50
Which of the statement is true about Regular Languages?
4 / 50
In a transition table cells of the table contain the ________ state.
5 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
6 / 50
NFA is easy to implement as compared to DFA.
7 / 50
Can a DFA simulate NFA?
8 / 50
Parser takes tokens from scanner and tries to generate______ .
9 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
10 / 50
LL(1) parsing is called non-predictive parsing.
11 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
12 / 50
Lexical Analyzer generator _______ is written in Java.
13 / 50
14 / 50
15 / 50
First of C is ______ .
16 / 50
Parser always gives a tree like structure as output
17 / 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.
18 / 50
In predictive parsing table the rows are ___________ .
19 / 50
20 / 50
Front end of two pass compiler takes________ as input.
21 / 50
_______ algorithm is used in DFA minimization.
22 / 50
Left factoring is enough to make LL1 grammar
23 / 50
Lexer and scanner are two different phases of compiler
24 / 50
25 / 50
26 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
27 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
28 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
29 / 50
Compilers are sometimes classified as.
30 / 50
Recursive _____ parsing is done for LL(1) grammar.
31 / 50
In multi pass compiler during the first pass it gathers information about __________ .
32 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
33 / 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.
34 / 50
35 / 50
LR parsers can handle _______ grammars.
36 / 50
Parser takes tokens from scanner and tries to generate ______ .
37 / 50
Intermediate Representation (IR) stores the value of its operand in
38 / 50
39 / 50
Front-end of a two pass compiler is consists of Scanner.
40 / 50
An important component of semantic analysis is _________ .
41 / 50
____________avoid hardware stalls and interlocks.
42 / 50
AST summarizes the grammatical structure with the details of derivations.
43 / 50
In parser the two LL stand(s) for ____________ .
44 / 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.
45 / 50
46 / 50
47 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
48 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
49 / 50
In Flex specification file different sections are separated by ________ .
50 / 50
Your score is
The average score is 0%
Restart quiz
