CS606-Midterm
1 / 50
AST summarizes the grammatical structure with the details of derivations.
2 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
3 / 50
LR parsing _____ a string to the start symbol by inverting productions.
4 / 50
A _______ is a top down parser.
5 / 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.
6 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
7 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
8 / 50
Recursive ____________ parsing is done for LL(1) grammar.
9 / 50
In parser the two LL stand(s) for ____________ .
10 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
11 / 50
An important component of semantic analysis is _________ .
12 / 50
In compilation process Hierarchical analysis is also called-----------
13 / 50
Left factoring of a grammar is done to save the parser from back tracking.
14 / 50
Can a DFA simulate NFA?
15 / 50
We can get an LL(1) grammar by _______ .
16 / 50
_______ algorithm is used in DFA minimization.
17 / 50
Lexer and scanner are two different phases of compiler
18 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
19 / 50
Functions of Lexical analyzer are?
20 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
21 / 50
In Back End module of compiler, optimal register allocation uses______ .
22 / 50
Recursive _____ parsing is done for LL(1) grammar.
23 / 50
In Flex specification file different sections are separated by ________ .
24 / 50
Front end of two pass compiler takes________ as input.
25 / 50
26 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
27 / 50
___________ phase which supports macro substitution and conditional compilation.
28 / 50
29 / 50
Front-end of a two pass compiler is consists of Scanner.
30 / 50
Left factoring is enough to make a grammar LL(1).
31 / 50
NFA is easy to implement as compared to DFA.
32 / 50
33 / 50
34 / 50
In multi pass compiler during the first pass it gathers information about __________ .
35 / 50
In PASCAL ___________ represent the inequality test.
36 / 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.
37 / 50
______ phase which supports macro substitution and conditional compilation.
38 / 50
In a transition table cells of the table contain the ________ state.
39 / 50
Bottom-up parsers handle a ________ class of grammars.
40 / 50
Parser always gives a tree like structure as output
41 / 50
Parser takes tokens from scanner and tries to generate______ .
42 / 50
Lexical Analyzer generator _______ is written in Java.
43 / 50
Left factoring is enough to make LL1 grammar
44 / 50
45 / 50
LR parsers can handle _______ grammars.
46 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
47 / 50
Parser takes tokens from scanner and tries to generate ______ .
48 / 50
Which of the statement is true about Regular Languages?
49 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
50 / 50
____________avoid hardware stalls and interlocks.
Your score is
The average score is 0%
Restart quiz
