CS606-Midterm
1 / 50
Parser takes tokens from scanner and tries to generate______ .
2 / 50
LL(1) parsing is called non-predictive parsing.
3 / 50
Compilers are sometimes classified as.
4 / 50
_______ algorithm is used in DFA minimization.
5 / 50
In multi pass compiler during the first pass it gathers information about __________ .
6 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
7 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
8 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
9 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
10 / 50
Recursive _____ parsing is done for LL(1) grammar.
11 / 50
A _______ is a top down parser.
12 / 50
The non-terminal _______ is left recursive.
13 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
14 / 50
In parser the two LL stand(s) for ____________ .
15 / 50
LR parsers can handle _______ grammars.
16 / 50
In Back End module of compiler, optimal register allocation uses______ .
17 / 50
Left factoring is enough to make a grammar LL(1).
18 / 50
In PASCAL ___________ represent the inequality test.
19 / 50
Which of the statement is true about Regular Languages?
20 / 50
AST summarizes the grammatical structure with the details of derivations.
21 / 50
Responsibility of _____ is to produce fast and compact code.
22 / 50
23 / 50
24 / 50
We can get an LL(1) grammar by _______ .
25 / 50
In predictive parsing table the rows are ___________ .
26 / 50
Intermediate Representation (IR) stores the value of its operand in
27 / 50
NFA is easy to implement as compared to DFA.
28 / 50
Recursive ____________ parsing is done for LL(1) grammar.
29 / 50
30 / 50
Parser takes tokens from scanner and tries to generate ______ .
31 / 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.
32 / 50
Can a DFA simulate NFA?
33 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
34 / 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.
35 / 50
36 / 50
Lexer and scanner are two different phases of compiler
37 / 50
____is evaluated to yield a value.
38 / 50
39 / 50
Follow of B is ____ .
40 / 50
In Flex specification file different sections are separated by ________ .
41 / 50
Left factoring is enough to make LL1 grammar
42 / 50
____________avoid hardware stalls and interlocks.
43 / 50
In compilation process Hierarchical analysis is also called
44 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
45 / 50
46 / 50
Lexical Analyzer generator _______ is written in Java.
47 / 50
Bottom-up parsers handle a ________ class of grammars.
48 / 50
Optimal registers allocation is an NP-hard problem.
49 / 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
50 / 50
Your score is
The average score is 0%
Restart quiz
