CS606-Midterm
1 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
2 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
3 / 50
Consider the following grammar,
4 / 50
Front end of two pass compiler takes________ as input.
5 / 50
When generating a lexical analyzer from a token description, the item sets (states) are constructed by two types of “moves”: character moves and ____ moves.
6 / 50
AST summarizes the grammatical structure with the details of derivations.
7 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
8 / 50
In compilation process Hierarchical analysis is also called
9 / 50
_______ algorithm is used in DFA minimization.
10 / 50
An important component of semantic analysis is _________ .
11 / 50
Compilers are sometimes classified as.
12 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
13 / 50
LR parsers can handle _______ grammars.
14 / 50
Lexical Analyzer generator _______ is written in Java.
15 / 50
Responsibility of _____ is to produce fast and compact code.
16 / 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.
17 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
18 / 50
19 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
20 / 50
Can a DFA simulate NFA?
21 / 50
First of C is ______ .
22 / 50
Left factoring is enough to make LL1 grammar
23 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
24 / 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.
25 / 50
NFA is easy to implement as compared to DFA.
26 / 50
In multi pass compiler during the first pass it gathers information about __________ .
27 / 50
Bottom-up parsers handle a ________ class of grammars.
28 / 50
Functions of Lexical analyzer are?
29 / 50
30 / 50
31 / 50
32 / 50
Recursive ____________ parsing is done for LL(1) grammar.
33 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
34 / 50
Lexer and scanner are two different phases of compiler
35 / 50
Which of the statement is true about Regular Languages?
36 / 50
37 / 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
38 / 50
We can get an LL(1) grammar by _______ .
39 / 50
40 / 50
41 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
42 / 50
In PASCAL ___________ represent the inequality test.
43 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
44 / 50
45 / 50
46 / 50
47 / 50
48 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
49 / 50
50 / 50
Optimal registers allocation is an NP-hard problem.
Your score is
The average score is 0%
Restart quiz
