CS606-Midterm
1 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
2 / 50
Lexer and scanner are two different phases of compiler
3 / 50
Parser takes tokens from scanner and tries to generate ______ .
4 / 50
A _______ is a top down parser.
5 / 50
In a transition table cells of the table contain the ________ state.
6 / 50
Bottom-up parsers handle a ________ class of grammars.
7 / 50
8 / 50
Compilers are sometimes classified as.
9 / 50
The non-terminal _______ is left recursive.
10 / 50
Functions of Lexical analyzer are?
11 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
12 / 50
In multi pass compiler during the first pass it gathers information about __________ .
13 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
14 / 50
Lexical Analyzer generator _______ is written in Java.
15 / 50
Front-end of a two pass compiler is consists of Scanner.
16 / 50
In Back End module of compiler, optimal register allocation uses______ .
17 / 50
In compilation process Hierarchical analysis is also called
18 / 50
Responsibility of _____ is to produce fast and compact code.
19 / 50
In parser the two LL stand(s) for ____________ .
20 / 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
21 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
22 / 50
_______ algorithm is used in DFA minimization.
23 / 50
24 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
25 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
26 / 50
27 / 50
28 / 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.
29 / 50
Parser always gives a tree like structure as output
30 / 50
31 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
32 / 50
Which of the statement is true about Regular Languages?
33 / 50
NFA is easy to implement as compared to DFA.
34 / 50
____________avoid hardware stalls and interlocks.
35 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
36 / 50
AST summarizes the grammatical structure with the details of derivations.
37 / 50
38 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
39 / 50
40 / 50
41 / 50
In PASCAL ___________ represent the inequality test.
42 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
43 / 50
LL(1) parsing is called non-predictive parsing.
44 / 50
45 / 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.
46 / 50
In compilation process Hierarchical analysis is also called-----------
47 / 50
Left factoring is enough to make LL1 grammar
48 / 50
Front end of two pass compiler takes________ as input.
49 / 50
LR parsing _____ a string to the start symbol by inverting productions.
50 / 50
Parser takes tokens from scanner and tries to generate______ .
Your score is
The average score is 0%
Restart quiz
