CS606-Midterm
1 / 50
In a transition table cells of the table contain the ________ state.
2 / 50
In PASCAL ___________ represent the inequality test.
3 / 50
Can a DFA simulate NFA?
4 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
5 / 50
LL(1) parsing is called non-predictive parsing.
6 / 50
_______ algorithm is used in DFA minimization.
7 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
8 / 50
____________avoid hardware stalls and interlocks.
9 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
10 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
11 / 50
Lexer and scanner are two different phases of compiler
12 / 50
NFA is easy to implement as compared to DFA.
13 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
14 / 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.
15 / 50
In parser the two LL stand(s) for ____________ .
16 / 50
Consider the grammar
17 / 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.
18 / 50
In predictive parsing table the rows are ___________ .
19 / 50
Follow of B is ____ .
20 / 50
Lexical Analyzer generator _______ is written in Java.
21 / 50
22 / 50
Front-end of a two pass compiler is consists of Scanner.
23 / 50
Bottom-up parsers handle a ________ class of grammars.
24 / 50
Which of the statement is true about Regular Languages?
25 / 50
In compilation process Hierarchical analysis is also called-----------
26 / 50
Functions of Lexical analyzer are?
27 / 50
Consider the following grammar,
28 / 50
An important component of semantic analysis is _________ .
29 / 50
AST summarizes the grammatical structure with the details of derivations.
30 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
31 / 50
Responsibility of _____ is to produce fast and compact code.
32 / 50
33 / 50
Front end of two pass compiler takes________ as input.
34 / 50
______ phase which supports macro substitution and conditional compilation.
35 / 50
36 / 50
In multi pass compiler during the first pass it gathers information about __________ .
37 / 50
Left factoring of a grammar is done to save the parser from back tracking.
38 / 50
Recursive ____________ parsing is done for LL(1) grammar.
39 / 50
Parser takes tokens from scanner and tries to generate ______ .
40 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
41 / 50
Left factoring is enough to make LL1 grammar
42 / 50
43 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
44 / 50
45 / 50
In Flex specification file different sections are separated by ________ .
46 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
47 / 50
In Back End module of compiler, optimal register allocation uses______ .
48 / 50
LR parsing _____ a string to the start symbol by inverting productions.
49 / 50
50 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
Your score is
The average score is 0%
Restart quiz
