CS606-Midterm
1 / 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.
2 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
3 / 50
Recursive ____________ parsing is done for LL(1) grammar.
4 / 50
Parser takes tokens from scanner and tries to generate ______ .
5 / 50
A _______ is a top down parser.
6 / 50
Lexical Analyzer generator _______ is written in Java.
7 / 50
Left factoring of a grammar is done to save the parser from back tracking.
8 / 50
Intermediate Representation (IR) stores the value of its operand in
9 / 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
10 / 50
AST summarizes the grammatical structure with the details of derivations.
11 / 50
In parser the two LL stand(s) for ____________ .
12 / 50
In Flex specification file different sections are separated by ________ .
13 / 50
In multi pass compiler during the first pass it gathers information about __________ .
14 / 50
Functions of Lexical analyzer are?
15 / 50
16 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
17 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
18 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
19 / 50
Consider the grammar
20 / 50
Front end of two pass compiler takes________ as input.
21 / 50
Left factoring is enough to make LL1 grammar
22 / 50
23 / 50
First of C is ______ .
24 / 50
Which of the statement is true about Regular Languages?
25 / 50
Left factoring is enough to make a grammar LL(1).
26 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
27 / 50
In a transition table cells of the table contain the ________ state.
28 / 50
Parser always gives a tree like structure as output
29 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
30 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
31 / 50
____________avoid hardware stalls and interlocks.
32 / 50
LL(1) parsing is called non-predictive parsing.
33 / 50
Bottom-up parsers handle a ________ class of grammars.
34 / 50
35 / 50
Recursive _____ parsing is done for LL(1) grammar.
36 / 50
37 / 50
38 / 50
Parser takes tokens from scanner and tries to generate______ .
39 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
40 / 50
When generating a lexical analyzer from a token description, the item sets (states) are constructed by two types of “moves”: character moves and ____ moves.
41 / 50
42 / 50
In PASCAL ___________ represent the inequality test.
43 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
44 / 50
In Back End module of compiler, optimal register allocation uses______ .
45 / 50
46 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
47 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
48 / 50
______ phase which supports macro substitution and conditional compilation.
49 / 50
NFA is easy to implement as compared to DFA.
50 / 50
Your score is
The average score is 0%
Restart quiz
