CS606-Midterm
1 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
2 / 50
Parser takes tokens from scanner and tries to generate ______ .
3 / 50
Which of the statement is true about Regular Languages?
4 / 50
____is evaluated to yield a value.
5 / 50
LR parsing _____ a string to the start symbol by inverting productions.
6 / 50
Lexical Analyzer generator _______ is written in Java.
7 / 50
Optimal registers allocation is an NP-hard problem.
8 / 50
______ phase which supports macro substitution and conditional compilation.
9 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
10 / 50
A _______ is a top down parser.
11 / 50
AST summarizes the grammatical structure with the details of derivations.
12 / 50
Left factoring is enough to make LL1 grammar
13 / 50
In Back End module of compiler, optimal register allocation uses______ .
14 / 50
Front-end of a two pass compiler is consists of Scanner.
15 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
16 / 50
Functions of Lexical analyzer are?
17 / 50
LR parsers can handle _______ grammars.
18 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
19 / 50
Left factoring is enough to make a grammar LL(1).
20 / 50
Consider the following grammar,
21 / 50
In PASCAL ___________ represent the inequality test.
22 / 50
We can get an LL(1) grammar by _______ .
23 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
24 / 50
Parser always gives a tree like structure as output
25 / 50
Can a DFA simulate NFA?
26 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
27 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
28 / 50
Lexer and scanner are two different phases of compiler
29 / 50
30 / 50
NFA is easy to implement as compared to DFA.
31 / 50
45.Follow of C is ____ .
32 / 50
____________avoid hardware stalls and interlocks.
33 / 50
34 / 50
Consider the grammar
35 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
36 / 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
37 / 50
In a transition table cells of the table contain the ________ state.
38 / 50
39 / 50
_______ algorithm is used in DFA minimization.
40 / 50
41 / 50
Responsibility of _____ is to produce fast and compact code.
42 / 50
43 / 50
In compilation process Hierarchical analysis is also called
44 / 50
45 / 50
In multi pass compiler during the first pass it gathers information about __________ .
46 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
47 / 50
48 / 50
49 / 50
50 / 50
Your score is
The average score is 0%
Restart quiz
