CS606-Midterm
1 / 50
Consider the following grammar,
2 / 50
In parser the two LL stand(s) for ____________ .
3 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
4 / 50
In a transition table cells of the table contain the ________ state.
5 / 50
Front end of two pass compiler takes________ as input.
6 / 50
When generating a lexical analyzer from a ________ description, the item sets (states) are constructed by two types of “moves”: character moves and e moves.
7 / 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.
8 / 50
Left factoring of a grammar is done to save the parser from back tracking.
9 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
10 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
11 / 50
In compilation process Hierarchical analysis is also called
12 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
13 / 50
LR parsers can handle _______ grammars.
14 / 50
Follow of B is ____ .
15 / 50
Lexical Analyzer generator _______ is written in Java.
16 / 50
Bottom-up parsers handle a ________ class of grammars.
17 / 50
NFA is easy to implement as compared to DFA.
18 / 50
An important component of semantic analysis is _________ .
19 / 50
Compilers are sometimes classified as.
20 / 50
Front-end of a two pass compiler is consists of Scanner.
21 / 50
In multi pass compiler during the first pass it gathers information about __________ .
22 / 50
Which of the statement is true about Regular Languages?
23 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
24 / 50
Functions of Lexical analyzer are?
25 / 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
26 / 50
In Back End module of compiler, optimal register allocation uses______ .
27 / 50
28 / 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.
29 / 50
30 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
31 / 50
32 / 50
33 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
34 / 50
The non-terminal _______ is left recursive.
35 / 50
Parser takes tokens from scanner and tries to generate ______ .
36 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
37 / 50
38 / 50
In predictive parsing table the rows are ___________ .
39 / 50
40 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
41 / 50
45.Follow of C is ____ .
42 / 50
Recursive ____________ parsing is done for LL(1) grammar.
43 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
44 / 50
Parser always gives a tree like structure as output
45 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
46 / 50
47 / 50
Lexer and scanner are two different phases of compiler
48 / 50
Recursive _____ parsing is done for LL(1) grammar.
49 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
50 / 50
We can get an LL(1) grammar by _______ .
Your score is
The average score is 0%
Restart quiz
