CS606-Midterm
1 / 50
45.Follow of C is ____ .
2 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
3 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
4 / 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.
5 / 50
Functions of Lexical analyzer are?
6 / 50
AST summarizes the grammatical structure with the details of derivations.
7 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
8 / 50
Compilers are sometimes classified as.
9 / 50
Consider the following grammar,
10 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
11 / 50
12 / 50
Recursive ____________ parsing is done for LL(1) grammar.
13 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
14 / 50
Which of the statement is true about Regular Languages?
15 / 50
____is evaluated to yield a value.
16 / 50
NFA is easy to implement as compared to DFA.
17 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
18 / 50
Recursive _____ parsing is done for LL(1) grammar.
19 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
20 / 50
In multi pass compiler during the first pass it gathers information about __________ .
21 / 50
An important component of semantic analysis is _________ .
22 / 50
Consider the grammar
23 / 50
Intermediate Representation (IR) stores the value of its operand in
24 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
25 / 50
In Back End module of compiler, optimal register allocation uses______ .
26 / 50
_______ algorithm is used in DFA minimization.
27 / 50
____________avoid hardware stalls and interlocks.
28 / 50
Left factoring is enough to make a grammar LL(1).
29 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
30 / 50
Optimal registers allocation is an NP-hard problem.
31 / 50
32 / 50
In predictive parsing table the rows are ___________ .
33 / 50
Front end of two pass compiler takes________ as input.
34 / 50
Lexical Analyzer generator _______ is written in Java.
35 / 50
Lexer and scanner are two different phases of compiler
36 / 50
37 / 50
LL(1) parsing is called non-predictive parsing.
38 / 50
39 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
40 / 50
The non-terminal _______ is left recursive.
41 / 50
We use ----- to mark the bottom of the stack and also the right end of the input when considering the Stack implementation of Shift-Reduce Parsing.
42 / 50
In Flex specification file different sections are separated by ________ .
43 / 50
In compilation process Hierarchical analysis is also called-----------
44 / 50
Left factoring of a grammar is done to save the parser from back tracking.
45 / 50
Responsibility of _____ is to produce fast and compact code.
46 / 50
47 / 50
We can get an LL(1) grammar by _______ .
48 / 50
Front-end of a two pass compiler is consists of Scanner.
49 / 50
50 / 50
Left factoring is enough to make LL1 grammar
Your score is
The average score is 0%
Restart quiz
