CS606-Midterm
1 / 50
Parser takes tokens from scanner and tries to generate______ .
2 / 50
Parser always gives a tree like structure as output
3 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
4 / 50
_______ algorithm is used in DFA minimization.
5 / 50
Left factoring of a grammar is done to save the parser from back tracking.
6 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
7 / 50
NFA is easy to implement as compared to DFA.
8 / 50
Left factoring is enough to make LL1 grammar
9 / 50
The non-terminal _______ is left recursive.
10 / 50
11 / 50
Consider the following grammar,
12 / 50
LL(1) parsing is called non-predictive parsing.
13 / 50
Lexer and scanner are two different phases of compiler
14 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
15 / 50
An important component of semantic analysis is _________ .
16 / 50
Parser takes tokens from scanner and tries to generate ______ .
17 / 50
In predictive parsing table the rows are ___________ .
18 / 50
AST summarizes the grammatical structure with the details of derivations.
19 / 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.
20 / 50
21 / 50
In multi pass compiler during the first pass it gathers information about __________ .
22 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
23 / 50
Functions of Lexical analyzer are?
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
Optimal registers allocation is an NP-hard problem.
26 / 50
27 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
28 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
29 / 50
___________ phase which supports macro substitution and conditional compilation.
30 / 50
Consider the grammar
31 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
32 / 50
33 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
34 / 50
In compilation process Hierarchical analysis is also called
35 / 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.
36 / 50
37 / 50
In a transition table cells of the table contain the ________ state.
38 / 50
LR parsers can handle _______ grammars.
39 / 50
A _______ is a top down parser.
40 / 50
Front end of two pass compiler takes________ as input.
41 / 50
In Back End module of compiler, optimal register allocation uses______ .
42 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
43 / 50
Left factoring is enough to make a grammar LL(1).
44 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
45 / 50
____is evaluated to yield a value.
46 / 50
47 / 50
Compilers are sometimes classified as.
48 / 50
49 / 50
Responsibility of _____ is to produce fast and compact code.
50 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
Your score is
The average score is 0%
Restart quiz
