CS606-Midterm
1 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
2 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
3 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
4 / 50
Parser takes tokens from scanner and tries to generate ______ .
5 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
6 / 50
In a transition table cells of the table contain the ________ state.
7 / 50
Follow of B is ____ .
8 / 50
____is evaluated to yield a value.
9 / 50
Optimal registers allocation is an NP-hard problem.
10 / 50
Lexical Analyzer generator _______ is written in Java.
11 / 50
12 / 50
An important component of semantic analysis is _________ .
13 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
14 / 50
Front end of two pass compiler takes________ as input.
15 / 50
Front-end of a two pass compiler is consists of Scanner.
16 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
17 / 50
We can get an LL(1) grammar by _______ .
18 / 50
Left factoring is enough to make LL1 grammar
19 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
20 / 50
_______ algorithm is used in DFA minimization.
21 / 50
In multi pass compiler during the first pass it gathers information about __________ .
22 / 50
23 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
24 / 50
Responsibility of _____ is to produce fast and compact code.
25 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
26 / 50
27 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
28 / 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.
29 / 50
In Back End module of compiler, optimal register allocation uses______ .
30 / 50
Parser always gives a tree like structure as output
31 / 50
Recursive ____________ parsing is done for LL(1) grammar.
32 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
33 / 50
34 / 50
Left factoring of a grammar is done to save the parser from back tracking.
35 / 50
Functions of Lexical analyzer are?
36 / 50
37 / 50
38 / 50
39 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
40 / 50
______ phase which supports macro substitution and conditional compilation.
41 / 50
42 / 50
LR parsers can handle _______ grammars.
43 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
44 / 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.
45 / 50
AST summarizes the grammatical structure with the details of derivations.
46 / 50
In parser the two LL stand(s) for ____________ .
47 / 50
48 / 50
Can a DFA simulate NFA?
49 / 50
50 / 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.
Your score is
The average score is 0%
Restart quiz
