CS606-Midterm
1 / 50
Parser takes tokens from scanner and tries to generate ______ .
2 / 50
Lexer and scanner are two different phases of compiler
3 / 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.
4 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
5 / 50
In multi pass compiler during the first pass it gathers information about __________ .
6 / 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.
7 / 50
Which of the statement is true about Regular Languages?
8 / 50
Lexical Analyzer generator _______ is written in Java.
9 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
10 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
11 / 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.
12 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
13 / 50
Consider the grammar
14 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
15 / 50
In Flex specification file different sections are separated by ________ .
16 / 50
Front-end of a two pass compiler is consists of Scanner.
17 / 50
An important component of semantic analysis is _________ .
18 / 50
Optimal registers allocation is an NP-hard problem.
19 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
20 / 50
Recursive ____________ parsing is done for LL(1) grammar.
21 / 50
22 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
23 / 50
_______ algorithm is used in DFA minimization.
24 / 50
In a transition table cells of the table contain the ________ state.
25 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
26 / 50
Responsibility of _____ is to produce fast and compact code.
27 / 50
28 / 50
Left factoring is enough to make LL1 grammar
29 / 50
First of C is ______ .
30 / 50
AST summarizes the grammatical structure with the details of derivations.
31 / 50
Compilers are sometimes classified as.
32 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
33 / 50
Left factoring of a grammar is done to save the parser from back tracking.
34 / 50
35 / 50
We can get an LL(1) grammar by _______ .
36 / 50
In PASCAL ___________ represent the inequality test.
37 / 50
38 / 50
LL(1) parsing is called non-predictive parsing.
39 / 50
In parser the two LL stand(s) for ____________ .
40 / 50
41 / 50
Parser always gives a tree like structure as output
42 / 50
Front end of two pass compiler takes________ as input.
43 / 50
____________avoid hardware stalls and interlocks.
44 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
45 / 50
46 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
47 / 50
48 / 50
Left factoring is enough to make a grammar LL(1).
49 / 50
LR parsers can handle _______ grammars.
50 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
Your score is
The average score is 0%
Restart quiz
