CS606-Midterm
1 / 50
Left factoring is enough to make a grammar LL(1).
2 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
3 / 50
In compilation process Hierarchical analysis is also called
4 / 50
Parser always gives a tree like structure as output
5 / 50
In predictive parsing table the rows are ___________ .
6 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
7 / 50
Left factoring is enough to make LL1 grammar
8 / 50
______ phase which supports macro substitution and conditional compilation.
9 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
10 / 50
The non-terminal _______ is left recursive.
11 / 50
Lexer and scanner are two different phases of compiler
12 / 50
In compilation process Hierarchical analysis is also called-----------
13 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
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
LR parsers can handle _______ grammars.
17 / 50
Front-end of a two pass compiler is consists of Scanner.
18 / 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.
19 / 50
In multi pass compiler during the first pass it gathers information about __________ .
20 / 50
In Back End module of compiler, optimal register allocation uses______ .
21 / 50
22 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
23 / 50
Which of the statement is true about Regular Languages?
24 / 50
Lexical Analyzer generator _______ is written in Java.
25 / 50
Functions of Lexical analyzer are?
26 / 50
27 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
28 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
29 / 50
45.Follow of C is ____ .
30 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
31 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
32 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
33 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
34 / 50
35 / 50
Parser takes tokens from scanner and tries to generate ______ .
36 / 50
37 / 50
38 / 50
Intermediate Representation (IR) stores the value of its operand in
39 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
40 / 50
In a transition table cells of the table contain the ________ state.
41 / 50
42 / 50
43 / 50
44 / 50
45 / 50
First of C is ______ .
46 / 50
We can get an LL(1) grammar by _______ .
47 / 50
AST summarizes the grammatical structure with the details of derivations.
48 / 50
49 / 50
_______ algorithm is used in DFA minimization.
50 / 50
Consider the grammar
Your score is
The average score is 0%
Restart quiz
