CS606-Midterm
1 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
2 / 50
Bottom-up parsers handle a ________ class of grammars.
3 / 50
Lexical Analyzer generator _______ is written in Java.
4 / 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
5 / 50
In multi pass compiler during the first pass it gathers information about __________ .
6 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
7 / 50
Front-end of a two pass compiler is consists of Scanner.
8 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
9 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
10 / 50
LL(1) parsing is called non-predictive parsing.
11 / 50
Left factoring is enough to make LL1 grammar
12 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
13 / 50
LR parsers can handle _______ grammars.
14 / 50
Compilers are sometimes classified as.
15 / 50
In Flex specification file different sections are separated by ________ .
16 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
17 / 50
18 / 50
In Back End module of compiler, optimal register allocation uses______ .
19 / 50
Parser takes tokens from scanner and tries to generate ______ .
20 / 50
AST summarizes the grammatical structure with the details of derivations.
21 / 50
Front end of two pass compiler takes________ as input.
22 / 50
23 / 50
Consider the following grammar,
24 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
25 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
26 / 50
Parser takes tokens from scanner and tries to generate______ .
27 / 50
Functions of Lexical analyzer are?
28 / 50
In compilation process Hierarchical analysis is also called
29 / 50
Left factoring is enough to make a grammar LL(1).
30 / 50
First of C is ______ .
31 / 50
An important component of semantic analysis is _________ .
32 / 50
The non-terminal _______ is left recursive.
33 / 50
34 / 50
Which of the statement is true about Regular Languages?
35 / 50
Lexer and scanner are two different phases of compiler
36 / 50
45.Follow of C is ____ .
37 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
38 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
39 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
40 / 50
_______ algorithm is used in DFA minimization.
41 / 50
In predictive parsing table the rows are ___________ .
42 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
43 / 50
Follow of B is ____ .
44 / 50
45 / 50
NFA is easy to implement as compared to DFA.
46 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
47 / 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.
48 / 50
49 / 50
50 / 50
Your score is
The average score is 0%
Restart quiz
