CS606-Midterm
1 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
2 / 50
Lexical Analyzer generator _______ is written in Java.
3 / 50
We can get an LL(1) grammar by _______ .
4 / 50
Optimal registers allocation is an NP-hard problem.
5 / 50
Lexer and scanner are two different phases of compiler
6 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
7 / 50
NFA is easy to implement as compared to DFA.
8 / 50
Front-end of a two pass compiler is consists of Scanner.
9 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
10 / 50
Bottom-up parsers handle a ________ class of grammars.
11 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
12 / 50
Parser takes tokens from scanner and tries to generate______ .
13 / 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.
14 / 50
Front end of two pass compiler takes________ as input.
15 / 50
Left factoring of a grammar is done to save the parser from back tracking.
16 / 50
Parser takes tokens from scanner and tries to generate ______ .
17 / 50
Functions of Lexical analyzer are?
18 / 50
19 / 50
In PASCAL ___________ represent the inequality test.
20 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
21 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
22 / 50
23 / 50
LL(1) parsing is called non-predictive parsing.
24 / 50
25 / 50
26 / 50
Responsibility of _____ is to produce fast and compact code.
27 / 50
Consider the grammar
28 / 50
In predictive parsing table the rows are ___________ .
29 / 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
30 / 50
31 / 50
32 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
33 / 50
45.Follow of C is ____ .
34 / 50
____is evaluated to yield a value.
35 / 50
36 / 50
In multi pass compiler during the first pass it gathers information about __________ .
37 / 50
First of C is ______ .
38 / 50
39 / 50
An important component of semantic analysis is _________ .
40 / 50
In parser the two LL stand(s) for ____________ .
41 / 50
Recursive _____ parsing is done for LL(1) grammar.
42 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
43 / 50
44 / 50
Recursive ____________ parsing is done for LL(1) grammar.
45 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
46 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
47 / 50
Follow of B is ____ .
48 / 50
_______ algorithm is used in DFA minimization.
49 / 50
Parser always gives a tree like structure as output
50 / 50
Your score is
The average score is 0%
Restart quiz
