CS606-Midterm
1 / 50
LR parsing _____ a string to the start symbol by inverting productions.
2 / 50
In multi pass compiler during the first pass it gathers information about __________ .
3 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
4 / 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.
5 / 50
First of C is ______ .
6 / 50
Bottom-up parsers handle a ________ class of grammars.
7 / 50
Functions of Lexical analyzer are?
8 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
9 / 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
10 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
11 / 50
_______ algorithm is used in DFA minimization.
12 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
13 / 50
The non-terminal _______ is left recursive.
14 / 50
Which of the statement is true about Regular Languages?
15 / 50
LL(1) parsing is called non-predictive parsing.
16 / 50
Recursive ____________ parsing is done for LL(1) grammar.
17 / 50
In Back End module of compiler, optimal register allocation uses______ .
18 / 50
Front end of two pass compiler takes________ as input.
19 / 50
Optimal registers allocation is an NP-hard problem.
20 / 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.
21 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
22 / 50
23 / 50
Lexical Analyzer generator _______ is written in Java.
24 / 50
Compilers are sometimes classified as.
25 / 50
45.Follow of C is ____ .
26 / 50
An important component of semantic analysis is _________ .
27 / 50
____________avoid hardware stalls and interlocks.
28 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
29 / 50
30 / 50
In a transition table cells of the table contain the ________ state.
31 / 50
LR parsers can handle _______ grammars.
32 / 50
In compilation process Hierarchical analysis is also called-----------
33 / 50
In PASCAL ___________ represent the inequality test.
34 / 50
Parser takes tokens from scanner and tries to generate______ .
35 / 50
Consider the grammar
36 / 50
In parser the two LL stand(s) for ____________ .
37 / 50
A _______ is a top down parser.
38 / 50
______ phase which supports macro substitution and conditional compilation.
39 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
40 / 50
41 / 50
42 / 50
NFA is easy to implement as compared to DFA.
43 / 50
44 / 50
45 / 50
46 / 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.
47 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
48 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
49 / 50
Left factoring of a grammar is done to save the parser from back tracking.
50 / 50
Front-end of a two pass compiler is consists of Scanner.
Your score is
The average score is 0%
Restart quiz
