CS606-Midterm
1 / 50
Consider the grammar
2 / 50
NFA is easy to implement as compared to DFA.
3 / 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
4 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
5 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
6 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
7 / 50
In compilation process Hierarchical analysis is also called
8 / 50
Lexical Analyzer generator _______ is written in Java.
9 / 50
Compilers are sometimes classified as.
10 / 50
In parser the two LL stand(s) for ____________ .
11 / 50
12 / 50
LR parsers can handle _______ grammars.
13 / 50
Responsibility of _____ is to produce fast and compact code.
14 / 50
Consider the following grammar,
15 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
16 / 50
First of C is ______ .
17 / 50
Left factoring of a grammar is done to save the parser from back tracking.
18 / 50
Recursive _____ parsing is done for LL(1) grammar.
19 / 50
Which of the statement is true about Regular Languages?
20 / 50
21 / 50
Left factoring is enough to make LL1 grammar
22 / 50
23 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
24 / 50
45.Follow of C is ____ .
25 / 50
Recursive ____________ parsing is done for LL(1) grammar.
26 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
27 / 50
_______ algorithm is used in DFA minimization.
28 / 50
29 / 50
Parser always gives a tree like structure as output
30 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
31 / 50
____________avoid hardware stalls and interlocks.
32 / 50
Intermediate Representation (IR) stores the value of its operand in
33 / 50
34 / 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.
35 / 50
Front end of two pass compiler takes________ as input.
36 / 50
We can get an LL(1) grammar by _______ .
37 / 50
Front-end of a two pass compiler is consists of Scanner.
38 / 50
39 / 50
LL(1) parsing is called non-predictive parsing.
40 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
41 / 50
Parser takes tokens from scanner and tries to generate______ .
42 / 50
A _______ is a top down parser.
43 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
44 / 50
45 / 50
46 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
47 / 50
48 / 50
49 / 50
50 / 50
Your score is
The average score is 0%
Restart quiz
