CS606-Midterm
1 / 50
One of the core tasks of compiler is to generate fast and compact executable code.
2 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
3 / 50
Which of the statement is true about Regular Languages?
4 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
5 / 50
LR parsing _____ a string to the start symbol by inverting productions.
6 / 50
Recursive ____________ parsing is done for LL(1) grammar.
7 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
8 / 50
In Flex specification file different sections are separated by ________ .
9 / 50
45.Follow of C is ____ .
10 / 50
11 / 50
LR parsers can handle _______ grammars.
12 / 50
The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.
13 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
14 / 50
15 / 50
Consider the grammar
16 / 50
Functions of Lexical analyzer are?
17 / 50
Can a DFA simulate NFA?
18 / 50
Ambiguity can easily be handled by Top-down Parser Select correct option:
19 / 50
Front-end of a two pass compiler is consists of Scanner.
20 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
21 / 50
Parser always gives a tree like structure as output
22 / 50
23 / 50
An important component of semantic analysis is _________ .
24 / 50
Front end of two pass compiler takes________ as input.
25 / 50
In multi pass compiler during the first pass it gathers information about __________ .
26 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
27 / 50
We can get an LL(1) grammar by _______ .
28 / 50
29 / 50
Parser takes tokens from scanner and tries to generate ______ .
30 / 50
Left factoring is enough to make LL1 grammar
31 / 50
_______ algorithm is used in DFA minimization.
32 / 50
AST summarizes the grammatical structure with the details of derivations.
33 / 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.
34 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
35 / 50
36 / 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.
37 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
38 / 50
Left factoring of a grammar is done to save the parser from back tracking.
39 / 50
In predictive parsing table the rows are ___________ .
40 / 50
Consider the following grammar,
41 / 50
42 / 50
43 / 50
44 / 50
Compilers are sometimes classified as.
45 / 50
46 / 50
47 / 50
Lexical Analyzer generator _______ is written in Java.
48 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
49 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
50 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
Your score is
The average score is 0%
Restart quiz
