CS606-Midterm
1 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
2 / 50
Intermediate Representation (IR) stores the value of its operand in
3 / 50
______ phase which supports macro substitution and conditional compilation.
4 / 50
Front-end of a two pass compiler is consists of Scanner.
5 / 50
Front end of two pass compiler takes________ as input.
6 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
7 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
8 / 50
Left factoring is enough to make a grammar LL(1).
9 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
10 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
11 / 50
A _______ is a top down parser.
12 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
13 / 50
Recursive ____________ parsing is done for LL(1) grammar.
14 / 50
Lexer and scanner are two different phases of compiler
15 / 50
AST summarizes the grammatical structure with the details of derivations.
16 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
17 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
18 / 50
In Flex specification file different sections are separated by ________ .
19 / 50
In Back End module of compiler, optimal register allocation uses______ .
20 / 50
Follow of B is ____ .
21 / 50
_______ algorithm is used in DFA minimization.
22 / 50
23 / 50
LR parsers can handle _______ grammars.
24 / 50
We use ----- to mark the bottom of the stack and also the right end of the input when considering the Stack implementation of Shift-Reduce Parsing.
25 / 50
26 / 50
In compilation process Hierarchical analysis is also called
27 / 50
Parser always gives a tree like structure as output
28 / 50
Can a DFA simulate NFA?
29 / 50
LR parsing _____ a string to the start symbol by inverting productions.
30 / 50
Recursive _____ parsing is done for LL(1) grammar.
31 / 50
Compilers are sometimes classified as.
32 / 50
In compilation process Hierarchical analysis is also called-----------
33 / 50
45.Follow of C is ____ .
34 / 50
Responsibility of _____ is to produce fast and compact code.
35 / 50
In PASCAL ___________ represent the inequality test.
36 / 50
37 / 50
____________avoid hardware stalls and interlocks.
38 / 50
An important component of semantic analysis is _________ .
39 / 50
In a transition table cells of the table contain the ________ state.
40 / 50
41 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
42 / 50
____is evaluated to yield a value.
43 / 50
Optimal registers allocation is an NP-hard problem.
44 / 50
In multi pass compiler during the first pass it gathers information about __________ .
45 / 50
46 / 50
Parser takes tokens from scanner and tries to generate ______ .
47 / 50
48 / 50
NFA is easy to implement as compared to DFA.
49 / 50
50 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
Your score is
The average score is 0%
Restart quiz
