CS606-Midterm
1 / 50
Responsibility of _____ is to produce fast and compact code.
2 / 50
In predictive parsing table the rows are ___________ .
3 / 50
Lexical Analyzer generator _______ is written in Java.
4 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
5 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
6 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
7 / 50
Parser always gives a tree like structure as output
8 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
9 / 50
In compilation process Hierarchical analysis is also called-----------
10 / 50
Left factoring is enough to make a grammar LL(1).
11 / 50
LL(1) parsing is called non-predictive parsing.
12 / 50
Front end of two pass compiler takes________ as input.
13 / 50
_______ algorithm is used in DFA minimization.
14 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
15 / 50
Lexer and scanner are two different phases of compiler
16 / 50
Parser takes tokens from scanner and tries to generate ______ .
17 / 50
18 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
19 / 50
A _______ is a top down parser.
20 / 50
LR parsers can handle _______ grammars.
21 / 50
In Back End module of compiler, optimal register allocation uses______ .
22 / 50
Optimal registers allocation is an NP-hard problem.
23 / 50
In PASCAL ___________ represent the inequality test.
24 / 50
Which of the statement is true about Regular Languages?
25 / 50
26 / 50
27 / 50
Parser takes tokens from scanner and tries to generate______ .
28 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
29 / 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.
30 / 50
Compilers are sometimes classified as.
31 / 50
32 / 50
Front-end of a two pass compiler is consists of Scanner.
33 / 50
Left factoring is enough to make LL1 grammar
34 / 50
35 / 50
In multi pass compiler during the first pass it gathers information about __________ .
36 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
37 / 50
Intermediate Representation (IR) stores the value of its operand in
38 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
39 / 50
40 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
41 / 50
NFA is easy to implement as compared to DFA.
42 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
43 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
44 / 50
45 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
46 / 50
AST summarizes the grammatical structure with the details of derivations.
47 / 50
48 / 50
The non-terminal _______ is left recursive.
49 / 50
An important component of semantic analysis is _________ .
50 / 50
Your score is
The average score is 0%
Restart quiz
