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