CS606-Midterm
1 / 50
Can a DFA simulate NFA?
2 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
3 / 50
LL(1) parsing is called non-predictive parsing.
4 / 50
Compilers are sometimes classified as.
5 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
6 / 50
Lexer and scanner are two different phases of compiler
7 / 50
Left factoring is enough to make a grammar LL(1).
8 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
9 / 50
_______ algorithm is used in DFA minimization.
10 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
11 / 50
We can get an LL(1) grammar by _______ .
12 / 50
AST summarizes the grammatical structure with the details of derivations.
13 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
14 / 50
Left factoring of a grammar is done to save the parser from back tracking.
15 / 50
Consider the grammar
16 / 50
In parser the two LL stand(s) for ____________ .
17 / 50
In multi pass compiler during the first pass it gathers information about __________ .
18 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
19 / 50
NFA is easy to implement as compared to DFA.
20 / 50
____________avoid hardware stalls and interlocks.
21 / 50
22 / 50
LR parsers can handle _______ grammars.
23 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
24 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
25 / 50
In predictive parsing table the rows are ___________ .
26 / 50
Front-end of a two pass compiler is consists of Scanner.
27 / 50
Recursive _____ parsing is done for LL(1) grammar.
28 / 50
In Back End module of compiler, optimal register allocation uses______ .
29 / 50
Front end of two pass compiler takes________ as input.
30 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
31 / 50
An important component of semantic analysis is _________ .
32 / 50
____is evaluated to yield a value.
33 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
34 / 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
35 / 50
45.Follow of C is ____ .
36 / 50
First of C is ______ .
37 / 50
______ phase which supports macro substitution and conditional compilation.
38 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
39 / 50
Lexical Analyzer generator _______ is written in Java.
40 / 50
41 / 50
Parser takes tokens from scanner and tries to generate______ .
42 / 50
43 / 50
44 / 50
Functions of Lexical analyzer are?
45 / 50
Intermediate Representation (IR) stores the value of its operand in
46 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
47 / 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.
48 / 50
49 / 50
In PASCAL ___________ represent the inequality test.
50 / 50
___________ phase which supports macro substitution and conditional compilation.
Your score is
The average score is 0%
Restart quiz
