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