CS606-Midterm
1 / 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.
2 / 50
Front end of two pass compiler takes________ as input.
3 / 50
4 / 50
Left factoring is enough to make a grammar LL(1).
5 / 50
In predictive parsing table the rows are ___________ .
6 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
7 / 50
In multi pass compiler during the first pass it gathers information about __________ .
8 / 50
Parser always gives a tree like structure as output
9 / 50
Left factoring is enough to make LL1 grammar
10 / 50
Follow of B is ____ .
11 / 50
In PASCAL ___________ represent the inequality test.
12 / 50
In a transition table cells of the table contain the ________ state.
13 / 50
Lexer and scanner are two different phases of compiler
14 / 50
In Flex specification file different sections are separated by ________ .
15 / 50
______ phase which supports macro substitution and conditional compilation.
16 / 50
___________ phase which supports macro substitution and conditional compilation.
17 / 50
An important component of semantic analysis is _________ .
18 / 50
A _______ is a top down parser.
19 / 50
_______ algorithm is used in DFA minimization.
20 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
21 / 50
AST summarizes the grammatical structure with the details of derivations.
22 / 50
We can get an LL(1) grammar by _______ .
23 / 50
Left factoring of a grammar is done to save the parser from back tracking.
24 / 50
Functions of Lexical analyzer are?
25 / 50
LR parsers can handle _______ grammars.
26 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
27 / 50
Lexical Analyzer generator _______ is written in Java.
28 / 50
29 / 50
Intermediate Representation (IR) stores the value of its operand in
30 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
31 / 50
Compilers are sometimes classified as.
32 / 50
Recursive ____________ parsing is done for LL(1) grammar.
33 / 50
34 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
35 / 50
____is evaluated to yield a value.
36 / 50
37 / 50
Can a DFA simulate NFA?
38 / 50
39 / 50
40 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
41 / 50
Recursive _____ parsing is done for LL(1) grammar.
42 / 50
Optimal registers allocation is an NP-hard problem.
43 / 50
44 / 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.
45 / 50
46 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
47 / 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.
48 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
49 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
50 / 50
Front-end of a two pass compiler is consists of Scanner.
Your score is
The average score is 0%
Restart quiz
