CS606-Midterm
1 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
2 / 50
Follow of B is ____ .
3 / 50
Front end of two pass compiler takes________ as input.
4 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
5 / 50
In compilation process Hierarchical analysis is also called
6 / 50
Optimal registers allocation is an NP-hard problem.
7 / 50
Left factoring of a grammar is done to save the parser from back tracking.
8 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
9 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
10 / 50
_______ algorithm is used in DFA minimization.
11 / 50
We can get an LL(1) grammar by _______ .
12 / 50
In a transition table cells of the table contain the ________ state.
13 / 50
Which of the statement is true about Regular Languages?
14 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
15 / 50
In PASCAL ___________ represent the inequality test.
16 / 50
Consider the grammar
17 / 50
Lexical Analyzer generator _______ is written in Java.
18 / 50
AST summarizes the grammatical structure with the details of derivations.
19 / 50
Functions of Lexical analyzer are?
20 / 50
Recursive ____________ parsing is done for LL(1) grammar.
21 / 50
Responsibility of _____ is to produce fast and compact code.
22 / 50
Left factoring is enough to make a grammar LL(1).
23 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
24 / 50
Parser takes tokens from scanner and tries to generate______ .
25 / 50
In multi pass compiler during the first pass it gathers information about __________ .
26 / 50
LR parsers can handle _______ grammars.
27 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
28 / 50
Consider the following grammar,
29 / 50
30 / 50
In Back End module of compiler, optimal register allocation uses______ .
31 / 50
______ phase which supports macro substitution and conditional compilation.
32 / 50
LR parsing _____ a string to the start symbol by inverting productions.
33 / 50
An important component of semantic analysis is _________ .
34 / 50
35 / 50
First of C is ______ .
36 / 50
Lexer and scanner are two different phases of compiler
37 / 50
38 / 50
____________avoid hardware stalls and interlocks.
39 / 50
Front-end of a two pass compiler is consists of Scanner.
40 / 50
41 / 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.
42 / 50
A _______ is a top down parser.
43 / 50
44 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
45 / 50
Can a DFA simulate NFA?
46 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
47 / 50
Left factoring is enough to make LL1 grammar
48 / 50
49 / 50
50 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
Your score is
The average score is 0%
Restart quiz
