CS606-Midterm
1 / 50
LR parsers can handle _______ grammars.
2 / 50
Left factoring of a grammar is done to save the parser from back tracking.
3 / 50
In compilation process Hierarchical analysis is also called-----------
4 / 50
45.Follow of C is ____ .
5 / 50
Front end of two pass compiler takes________ as input.
6 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
7 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
8 / 50
NFA is easy to implement as compared to DFA.
9 / 50
AST summarizes the grammatical structure with the details of derivations.
10 / 50
Responsibility of _____ is to produce fast and compact code.
11 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
12 / 50
Consider the following grammar,
13 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
14 / 50
Lexical Analyzer generator _______ is written in Java.
15 / 50
In a transition table cells of the table contain the ________ state.
16 / 50
17 / 50
_______ algorithm is used in DFA minimization.
18 / 50
19 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
20 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
21 / 50
22 / 50
Parser always gives a tree like structure as output
23 / 50
LL(1) parsing is called non-predictive parsing.
24 / 50
25 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
26 / 50
Follow of B is ____ .
27 / 50
28 / 50
___________ phase which supports macro substitution and conditional compilation.
29 / 50
Left factoring is enough to make LL1 grammar
30 / 50
31 / 50
Lexer and scanner are two different phases of compiler
32 / 50
33 / 50
In Flex specification file different sections are separated by ________ .
34 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
35 / 50
36 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
37 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
38 / 50
39 / 50
______ phase which supports macro substitution and conditional compilation.
40 / 50
41 / 50
Parser takes tokens from scanner and tries to generate ______ .
42 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
43 / 50
Recursive ____________ parsing is done for LL(1) grammar.
44 / 50
45 / 50
46 / 50
In parser the two LL stand(s) for ____________ .
47 / 50
48 / 50
Compilers are sometimes classified as.
49 / 50
In compilation process Hierarchical analysis is also called
50 / 50
Can a DFA simulate NFA?
Your score is
The average score is 0%
Restart quiz
