Saturday, 22 June 2019

CS606 current midterm paper subjective questions and MCQS from JUNE 15 to JUNE 26, SPRING 2019

Total Questions: 23
MCQS: 18
Subjective Question: 5 
3 and 5 marks questions
CS606 MID TERM SPRING 2019 
CURRENT PAPER NO. 1
CS606 Compiler Construction current midterm papers SPRING 2019

πŸ‘€ SEE ALSO: Course wise exam instructions

QUESTIONS
1. Alternative of the backtrack in parser is Look ahead symbol in
Input
Output
Input and Output
None of the given
2. Which of the following statement is true about Two pass compiler.
Front End depends upon Back End
Back End depends upon Frond End
Both are independent of each other
None of the given
3.____________________ phase which supports macro substitution and conditional compilation.
Semantic
Syntax
Preprocessing
None of given
4. In compilation process Hierarchical analysis is also called
Parsing
Syntax analysis
Both Parsing and Syntax analysis
None of given
5. In Three-pass compiler _____________ is used for code improvement or optimization.
Front End
Middle End
Back End
Both Front end and Back end
6. In DFA minimization we construct one _______________ for each group of states from the initial DFA.
State
NFA
PDA
None
7. _____________is evaluated to yield a value.
Command
Expression
Declaration
Declaration and Command
8. In multi pass compiler during the first pass it gathers information
about ___________________ .
Declaration
Bindings
Static information
None of the given
9. Responsibility of ______________ is to produce fast and compact code.
Instruction selection (Page 9)
Register allocation
Instruction scheduling
None of given
10. Consider the following grammar,
A --> B C D
B --> h B | epsilon
C --> C g | g | C h | i
D --> A B | epsilon
First of A is _______________ .
h, g, i
g h
None of the given
11. An important component of semantic analysis is
code checking
type checking
flush checking
None of the given
12. LR parsers can handle ________________ grammars.
Left-recursive
file-recursive
End-recursive
Start-recursive


Share your paper of CS606 Also below πŸ‘‡ in comments with us and help others.

1. There are many operations defined for languages. The two most important are union and concatenation. L and M are two languages, how you will define the union and concatenation of these two languages.
2. How stack helps to simplify parsing algorithm? Answer in the context to handle pruning.
3. Given the following languages, name one string which is a member of each part. Assume ∑={a,b} for all parts.
a. a*b*
b. a(ba)*b
c. a*
d. (aaa)*
e. *a*b*a*
4. Consider the following given input for subset construction:

The function move(T,a) is set of NFA states to which there is a transition on input a from some NFA state s in set of states T. Write the output after applying move(T,a) function on the above input.
5. Eliminate left recursion from the following:
S -> S a b
   | S a S
   | S X
X -> X a
   | b
   | c
Shared by: Anny


πŸ‘‰ Other recommended 2018 midterm papers: CS401 Current paper , CS610 current paper , CS602 current paper , CS504 current paper , MCM301 current paper 2018 , CS502 current paper 2018

Share your paper of CS606 Also below πŸ‘‡ in comments with us and help others.