CS606-Midterm
1 / 50
Consider the following grammar,
2 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
3 / 50
Front end of two pass compiler takes________ as input.
4 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
5 / 50
Which of the statement is true about Regular Languages?
6 / 50
Front-end of a two pass compiler is consists of Scanner.
7 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
8 / 50
In a transition table cells of the table contain the ________ state.
9 / 50
In multi pass compiler during the first pass it gathers information about __________ .
10 / 50
Follow of B is ____ .
11 / 50
Lexical Analyzer generator _______ is written in Java.
12 / 50
NFA is easy to implement as compared to DFA.
13 / 50
LL(1) parsing is called non-predictive parsing.
14 / 50
15 / 50
Intermediate Representation (IR) stores the value of its operand in
16 / 50
AST summarizes the grammatical structure with the details of derivations.
17 / 50
The non-terminal _______ is left recursive.
18 / 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.
19 / 50
20 / 50
21 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
22 / 50
Optimal registers allocation is an NP-hard problem.
23 / 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.
24 / 50
An important component of semantic analysis is _________ .
25 / 50
In compilation process Hierarchical analysis is also called-----------
26 / 50
Parser takes tokens from scanner and tries to generate ______ .
27 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
28 / 50
LR parsers can handle _______ grammars.
29 / 50
____________avoid hardware stalls and interlocks.
30 / 50
31 / 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
32 / 50
___________ phase which supports macro substitution and conditional compilation.
33 / 50
34 / 50
35 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
36 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
37 / 50
Parser always gives a tree like structure as output
38 / 50
In parser the two LL stand(s) for ____________ .
39 / 50
40 / 50
41 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
42 / 50
Functions of Lexical analyzer are?
43 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
44 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
45 / 50
Bottom-up parsers handle a ________ class of grammars.
46 / 50
47 / 50
Recursive ____________ parsing is done for LL(1) grammar.
48 / 50
45.Follow of C is ____ .
49 / 50
LR parsing _____ a string to the start symbol by inverting productions.
50 / 50
Your score is
The average score is 0%
Restart quiz
