CS606-Midterm
1 / 50
Recursive ____________ parsing is done for LL(1) grammar.
2 / 50
Front-end of a two pass compiler is consists of Scanner.
3 / 50
Functions of Lexical analyzer are?
4 / 50
When generating a lexical analyzer from a token description, the item sets (states) are constructed by two types of “moves”: character moves and ____ moves.
5 / 50
An important component of semantic analysis is _________ .
6 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
7 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
8 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
9 / 50
Front end of two pass compiler takes________ as input.
10 / 50
Can a DFA simulate NFA?
11 / 50
When generating a lexical analyzer from a ________ description, the item sets (states) are constructed by two types of “moves”: character moves and e moves.
12 / 50
In predictive parsing table the rows are ___________ .
13 / 50
Intermediate Representation (IR) stores the value of its operand in
14 / 50
In Flex specification file different sections are separated by ________ .
15 / 50
In multi pass compiler during the first pass it gathers information about __________ .
16 / 50
17 / 50
Lexer and scanner are two different phases of compiler
18 / 50
Alternative of the backtrack in parser is Look ahead symbol in _________ .
19 / 50
LL(1) parsing is called non-predictive parsing.
20 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
21 / 50
Parser takes tokens from scanner and tries to generate______ .
22 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
23 / 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
24 / 50
Left factoring is enough to make LL1 grammar
25 / 50
In Back End module of compiler, optimal register allocation uses______ .
26 / 50
Parser always gives a tree like structure as output
27 / 50
28 / 50
Left factoring of a grammar is done to save the parser from back tracking.
29 / 50
Responsibility of _____ is to produce fast and compact code.
30 / 50
31 / 50
NFA is easy to implement as compared to DFA.
32 / 50
33 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
34 / 50
35 / 50
Compilers are sometimes classified as.
36 / 50
Recursive _____ parsing is done for LL(1) grammar.
37 / 50
38 / 50
39 / 50
40 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
41 / 50
42 / 50
A _______ is a top down parser.
43 / 50
In PASCAL ___________ represent the inequality test.
44 / 50
AST summarizes the grammatical structure with the details of derivations.
45 / 50
Lexical Analyzer generator _______ is written in Java.
46 / 50
45.Follow of C is ____ .
47 / 50
____is evaluated to yield a value.
48 / 50
For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.
49 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
50 / 50
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
Your score is
The average score is 0%
Restart quiz
