CS606-Midterm
1 / 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.
2 / 50
In predictive parsing table the rows are ___________ .
3 / 50
Can a DFA simulate NFA?
4 / 50
In a transition table cells of the table contain the ________ state.
5 / 50
Lexical Analyzer generator _______ is written in Java.
6 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
7 / 50
In Flex specification file different sections are separated by ________ .
8 / 50
In compilation process Hierarchical analysis is also called-----------
9 / 50
In multi pass compiler during the first pass it gathers information about __________ .
10 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
11 / 50
Follow of B is ____ .
12 / 50
45.Follow of C is ____ .
13 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
14 / 50
LR parsers can handle _______ grammars.
15 / 50
16 / 50
Recursive ____________ parsing is done for LL(1) grammar.
17 / 50
Front-end of a two pass compiler is consists of Scanner.
18 / 50
The non-terminal _______ is left recursive.
19 / 50
____is evaluated to yield a value.
20 / 50
A _______ is a top down parser.
21 / 50
AST summarizes the grammatical structure with the details of derivations.
22 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
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
Intermediate Representation (IR) stores the value of its operand in ____________ .
25 / 50
In parser the two LL stand(s) for ____________ .
26 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
27 / 50
In Back End module of compiler, optimal register allocation uses______ .
28 / 50
Compilers are sometimes classified as.
29 / 50
30 / 50
LL(1) parsing is called non-predictive parsing.
31 / 50
Front end of two pass compiler takes________ as input.
32 / 50
Left factoring is enough to make a grammar LL(1).
33 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
34 / 50
Left factoring of a grammar is done to save the parser from back tracking.
35 / 50
36 / 50
Recursive _____ parsing is done for LL(1) grammar.
37 / 50
Left factoring is enough to make LL1 grammar
38 / 50
Responsibility of _____ is to produce fast and compact code.
39 / 50
NFA is easy to implement as compared to DFA.
40 / 50
Functions of Lexical analyzer are?
41 / 50
We can get an LL(1) grammar by _______ .
42 / 50
Alternative of the backtrack in parser is Look ahead symbol in ______ .
43 / 50
Parser always gives a tree like structure as output
44 / 50
____________avoid hardware stalls and interlocks.
45 / 50
Parser takes tokens from scanner and tries to generate______ .
46 / 50
47 / 50
48 / 50
49 / 50
50 / 50
Your score is
The average score is 0%
Restart quiz
