CS606-Midterm
1 / 50
In Flex specification file different sections are separated by ________ .
2 / 50
Functions of Lexical analyzer are?
3 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
4 / 50
Front-end of a two pass compiler is consists of Scanner.
5 / 50
Responsibility of _____ is to produce fast and compact code.
6 / 50
Recursive ____________ parsing is done for LL(1) grammar.
7 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
8 / 50
In Back End module of compiler, optimal register allocation uses______ .
9 / 50
___________ phase which supports macro substitution and conditional compilation.
10 / 50
______ phase which supports macro substitution and conditional compilation.
11 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
12 / 50
In a transition table cells of the table contain the ________ state.
13 / 50
LR parsers can handle _______ grammars.
14 / 50
15 / 50
Consider the grammar
16 / 50
17 / 50
A _______ is a top down parser.
18 / 50
____________avoid hardware stalls and interlocks.
19 / 50
20 / 50
21 / 50
22 / 50
In predictive parsing table the rows are ___________ .
23 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
24 / 50
Bottom-up parsers handle a ________ class of grammars.
25 / 50
AST summarizes the grammatical structure with the details of derivations.
26 / 50
27 / 50
28 / 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
29 / 50
NFA is easy to implement as compared to DFA.
30 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
31 / 50
32 / 50
Reduction of a handle to the ------- on the left hand side of the grammar rule is a step along the reverse of a right most derivation.
33 / 50
____is evaluated to yield a value.
34 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
35 / 50
In compilation process Hierarchical analysis is also called-----------
36 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
37 / 50
38 / 50
Recursive _____ parsing is done for LL(1) grammar.
39 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
40 / 50
We can get an LL(1) grammar by _______ .
41 / 50
Lexer and scanner are two different phases of compiler
42 / 50
Can a DFA simulate NFA?
43 / 50
44 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
45 / 50
Parser takes tokens from scanner and tries to generate ______ .
46 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
47 / 50
Left factoring is enough to make LL1 grammar
48 / 50
LL(1) parsing is called non-predictive parsing.
49 / 50
Left factoring of a grammar is done to save the parser from back tracking.
50 / 50
Lexical Analyzer generator _______ is written in Java.
Your score is
The average score is 0%
Restart quiz
