CS606-Midterm
1 / 50
LR parsing _____ a string to the start symbol by inverting productions.
2 / 50
In DFA minimization we construct one ______ for each group of states from the initial DFA.
3 / 50
Flex is an automated tool that is used to get the minimized DFA (scanner).
4 / 50
Recursive _____ parsing is done for LL(1) grammar.
5 / 50
Left factoring is enough to make a grammar LL(1).
6 / 50
_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.
7 / 50
Consider the grammar
8 / 50
Bottom-up parsers handle a ________ class of grammars.
9 / 50
Lexical Analyzer generator _______ is written in Java.
10 / 50
Follow of B is ____ .
11 / 50
____is evaluated to yield a value.
12 / 50
____________avoid hardware stalls and interlocks.
13 / 50
In parser the two LL stand(s) for ____________ .
14 / 50
LR parsers can handle _______ grammars.
15 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.
16 / 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.
17 / 50
___________ phase which supports macro substitution and conditional compilation.
18 / 50
Yacc contains built-in support for handling ambiguous grammars resulting in _______
19 / 50
Front end of two pass compiler takes________ as input.
20 / 50
The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
21 / 50
NFA is easy to implement as compared to DFA.
22 / 50
Compilers are sometimes classified as.
23 / 50
24 / 50
A lexical analyzer generator automatically constructs a _____ that recognizes tokens.
25 / 50
In Three-pass compiler ____ is used for code improvement or optimization.
26 / 50
Functions of Lexical analyzer are?
27 / 50
Recursive ____________ parsing is done for LL(1) grammar.
28 / 50
In compilation process Hierarchical analysis is also called-----------
29 / 50
In LL1() parsing algorithm _________ contains a sequence of grammar symbols.
30 / 50
A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.
31 / 50
Intermediate Representation (IR) stores the value of its operand in
32 / 50
Typical compilation means programs written in high-level languages to low-level ____________.
33 / 50
Consider the following grammar,
34 / 50
35 / 50
In PASCAL ___________ represent the inequality test.
36 / 50
_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
37 / 50
Intermediate Representation (IR) stores the value of its operand in ____________ .
38 / 50
______ phase which supports macro substitution and conditional compilation.
39 / 50
Which of the statement is true about Regular Languages?
40 / 50
A _______ is a top down parser.
41 / 50
42 / 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
43 / 50
44 / 50
45.Follow of C is ____ .
45 / 50
In Back End module of compiler, optimal register allocation uses______ .
46 / 50
Parser takes tokens from scanner and tries to generate ______ .
47 / 50
48 / 50
Left factoring is enough to make LL1 grammar
49 / 50
50 / 50
Parser always gives a tree like structure as output
Your score is
The average score is 0%
Restart quiz
