CS606-Midterm
1 / 50
Recursive _____ parsing is done for LL(1) grammar.
2 / 50
In Back End module of compiler, optimal register allocation uses______ .
3 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
4 / 50
Parser takes tokens from scanner and tries to generate ______ .
5 / 50
______ phase which supports macro substitution and conditional compilation.
6 / 50
Functions of Lexical analyzer are?
7 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
8 / 50
9 / 50
10 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
11 / 50
Lexical Analyzer generator _______ is written in Java.
12 / 50
Follow of B is ____ .
13 / 50
Recursive ____________ parsing is done for LL(1) grammar.
14 / 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.
15 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
16 / 50
Bottom-up parsers handle a ________ class of grammars.
17 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
18 / 50
19 / 50
In PASCAL ___________ represent the inequality test.
20 / 50
An ----- does not need to examine the entire stack for a handle, the state symbol on the top of the stack contains all the information it needs
21 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
22 / 50
We can get an LL(1) grammar by _______ .
23 / 50
_______ algorithm is used in DFA minimization.
24 / 50
25 / 50
26 / 50
In predictive parsing table the rows are ___________ .
27 / 50
AST summarizes the grammatical structure with the details of derivations.
28 / 50
Parser always gives a tree like structure as output
29 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
30 / 50
Left factoring of a grammar is done to save the parser from back tracking.
31 / 50
32 / 50
33 / 50
____is evaluated to yield a value.
34 / 50
35 / 50
The non-terminal _______ is left recursive.
36 / 50
____________avoid hardware stalls and interlocks.
37 / 50
A _______ is a top down parser.
38 / 50
In multi pass compiler during the first pass it gathers information about __________ .
39 / 50
40 / 50
In a transition table cells of the table contain the ________ state.
41 / 50
42 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
43 / 50
Can a DFA simulate NFA?
44 / 50
Consider the grammar
45 / 50
Parser takes tokens from scanner and tries to generate______ .
46 / 50
LR parsers can handle _______ grammars.
47 / 50
48 / 50
Front-end of a two pass compiler is consists of Scanner.
49 / 50
Front end of two pass compiler takes________ as input.
50 / 50
Your score is
The average score is 0%
Restart quiz
