CS606-Midterm
1 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
2 / 50
In PASCAL ___________ represent the inequality test.
3 / 50
____________avoid hardware stalls and interlocks.
4 / 50
In predictive parsing table the rows are ___________ .
5 / 50
LR parsers can handle _______ grammars.
6 / 50
45.Follow of C is ____ .
7 / 50
8 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
9 / 50
Which of the statement is true about Regular Languages?
10 / 50
Compilers are sometimes classified as.
11 / 50
In a transition table cells of the table contain the ________ state.
12 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
13 / 50
In compilation process Hierarchical analysis is also called
14 / 50
Functions of Lexical analyzer are?
15 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
16 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
17 / 50
Parser takes tokens from scanner and tries to generate ______ .
18 / 50
Optimal registers allocation is an NP-hard problem.
19 / 50
In Back End module of compiler, optimal register allocation uses______ .
20 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
21 / 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.
22 / 50
Lexer and scanner are two different phases of compiler
23 / 50
24 / 50
Parser always gives a tree like structure as output
25 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
26 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
27 / 50
Left factoring is enough to make LL1 grammar
28 / 50
___________ phase which supports macro substitution and conditional compilation.
29 / 50
LL(1) parsing is called non-predictive parsing.
30 / 50
31 / 50
We can get an LL(1) grammar by _______ .
32 / 50
33 / 50
In multi pass compiler during the first pass it gathers information about __________ .
34 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
35 / 50
Front end of two pass compiler takes________ as input.
36 / 50
Consider the following grammar,
37 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
38 / 50
Lexical Analyzer generator _______ is written in Java.
39 / 50
40 / 50
Left factoring of a grammar is done to save the parser from back tracking.
41 / 50
Responsibility of _____ is to produce fast and compact code.
42 / 50
43 / 50
In parser the two LL stand(s) for ____________ .
44 / 50
45 / 50
46 / 50
47 / 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
48 / 50
Intermediate Representation (IR) stores the value of its operand in
49 / 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.
50 / 50
Your score is
The average score is 0%
Restart quiz
