CS606-Midterm
1 / 50
In PASCAL ___________ represent the inequality test.
2 / 50
In parser the two LL stand(s) for ____________ .
3 / 50
Lexical Analyzer generator _______ is written in Java.
4 / 50
In predictive parsing table the rows are ___________ .
5 / 50
AST summarizes the grammatical structure with the details of derivations.
6 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
7 / 50
Optimal registers allocation is an NP-hard problem.
8 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
9 / 50
First of C is ______ .
10 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
11 / 50
In a transition table cells of the table contain the ________ state.
12 / 50
An important component of semantic analysis is _________ .
13 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
14 / 50
Functions of Lexical analyzer are?
15 / 50
Compilers are sometimes classified as.
16 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
17 / 50
The non-terminal _______ is left recursive.
18 / 50
Lexer and scanner are two different phases of compiler
19 / 50
Left factoring of a grammar is done to save the parser from back tracking.
20 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
21 / 50
22 / 50
Front-end of a two pass compiler is consists of Scanner.
23 / 50
Left factoring is enough to make LL1 grammar
24 / 50
25 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
26 / 50
____________avoid hardware stalls and interlocks.
27 / 50
LR parsers can handle _______ grammars.
28 / 50
29 / 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.
30 / 50
Recursive _____ parsing is done for LL(1) grammar.
31 / 50
32 / 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.
33 / 50
34 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
35 / 50
We can get an LL(1) grammar by _______ .
36 / 50
In multi pass compiler during the first pass it gathers information about __________ .
37 / 50
Recursive ____________ parsing is done for LL(1) grammar.
38 / 50
Follow of B is ____ .
39 / 50
In Back End module of compiler, optimal register allocation uses______ .
40 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
41 / 50
Which of the statement is true about Regular Languages?
42 / 50
In Flex specification file different sections are separated by ________ .
43 / 50
44 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
45 / 50
A _______ is a top down parser.
46 / 50
47 / 50
48 / 50
LR parsing _____ a string to the start symbol by inverting productions.
49 / 50
Left factoring is enough to make a grammar LL(1).
50 / 50
Reduction of a handle to the ------- on the left hand side of the grammar rule is a step along the reverse of a right most derivation.
Your score is
The average score is 0%
Restart quiz
