CS606-Midterm
1 / 50
LL(1) parsing is called non-predictive parsing.
2 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
3 / 50
Lexical Analyzer generator _______ is written in Java.
4 / 50
______ phase which supports macro substitution and conditional compilation.
5 / 50
Parser takes tokens from scanner and tries to generate ______ .
6 / 50
AST summarizes the grammatical structure with the details of derivations.
7 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
8 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
9 / 50
Parser always gives a tree like structure as output
10 / 50
In predictive parsing table the rows are ___________ .
11 / 50
The non-terminal _______ is left recursive.
12 / 50
Left factoring of a grammar is done to save the parser from back tracking.
13 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
14 / 50
In compilation process Hierarchical analysis is also called-----------
15 / 50
Recursive _____ parsing is done for LL(1) grammar.
16 / 50
17 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
18 / 50
19 / 50
Front-end of a two pass compiler is consists of Scanner.
20 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
21 / 50
Consider the grammar
22 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
23 / 50
We can get an LL(1) grammar by _______ .
24 / 50
A _______ is a top down parser.
25 / 50
Which of the statement is true about Regular Languages?
26 / 50
Front end of two pass compiler takes________ as input.
27 / 50
Recursive ____________ parsing is done for LL(1) grammar.
28 / 50
In multi pass compiler during the first pass it gathers information about __________ .
29 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
30 / 50
NFA is easy to implement as compared to DFA.
31 / 50
In parser the two LL stand(s) for ____________ .
32 / 50
33 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
34 / 50
35 / 50
___________ phase which supports macro substitution and conditional compilation.
36 / 50
37 / 50
LR parsers can handle _______ grammars.
38 / 50
39 / 50
LR parsing _____ a string to the start symbol by inverting productions.
40 / 50
41 / 50
First of C is ______ .
42 / 50
Left factoring is enough to make LL1 grammar
43 / 50
In Back End module of compiler, optimal register allocation uses______ .
44 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
45 / 50
_______ algorithm is used in DFA minimization.
46 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
47 / 50
48 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
49 / 50
50 / 50
In Flex specification file different sections are separated by ________ .
Your score is
The average score is 0%
Restart quiz
