cs606 subjective paper fall 2010 on 18-02-2011 Download

[Xpert]

Download cs606 please upload your own paper.
Also all the papers are in the form of down-loadable in the form of quiz.
Q#1
Parser takes tokens from scanner and tries to generate _______________ .
Select correct option:
Binary Search tree
Parse tree
Syntax trace
None of the given

Q# 2
is enough to make a grammar LL(1).
Select correct option:
True
False

Question # 3
__________________ phase which supports macro substitution and conditional compilation.
Select correct option:
Semantic
Syntax
Preprocessing
None of given
Question # 4 Flex is an automated tool that is used to get the minimized DFA (scanner).
Select correct option:
True
False

Question # 5
Consider the grammar A --> B C D
B --> h B | epsilon
C --> C g | g | C h | i
D --> A B | epsilon
Follow of B is _____________ .
Select correct option:
h
g, h, i, $
g, i
g

Question # 6
Consider the grammar A --> B C D
B --> h B | epsilon
C --> C g | g | C h | i
D --> A B | epsilon
Follow of C is _____________ .
Select correct option:

g, h, i, $
g, h, $
h, i, $
h, g, $

Question # 7: Alternative of the backtrack in parser is Look ahead symbol in _________ .
Select correct option:

Input
Output
Input and Output
None of the given


Question # 8: Typical compilation means programs written in high-level languages to low-level ____________.
Select correct option:
Object code
Byted code
Unicode
Both Object Code and byte code

Question # 9: In Flex specification file different sections are separated by _________________ .
Select correct option:

%%
&&
##
\\

Question # 10: In DFA minimization we construct one _______________ for each group of states from the initial DFA.
Select correct option:

State
NFA
PDA
None of given




Question # 1 of 10 ( Start time: 11:19:10 PM ) Total Marks: 1
Flex is an automated tool that is used to get the minimized DFA (scanner).
Select correct option:
True
False
Sajid: t
11:20 PM me: f ker diya

Question # 2
An important component of semantic analysis is __________________ .
Select correct option:
code checking
type checking
flush checking
None of the given
Question # 3
In PASCAL ___________ represent the inequality test.
Select correct option:
:=
=
<>
None of the given
Question # 4
LR parsing ______________ a string to the start symbol by inverting productions.
Select correct option:
Reduces
Shifts
Adds
None of the given
Question # 5
In Three-pass compiler _____________ is used for code improvement or optimization.
Select correct option:
Front End
Middle End
Back End
Both Front end and Back end
Question # 6
Left factoring is enough to make a grammar LL(1).
Select correct option:
True
False
Question # 7
In multi pass compiler during the first pass it gathers information about _________________ .
Select correct option:
Declaration
Bindings
Static information
None of the given
Question # 8
__________________ phase which supports macro substitution and conditional compilation.
Select correct option:
Semantic
Syntax
Preprocessing
None of given
Question # 9
In parser the two LL stand(s) for ____________ .
Select correct option:
Left-to-right scan of input
left-most derivation
All of the given
None of the given
Question # 10
Bottom-up parsers handle a _______________ class of grammars.
Select correct option:
Large
Small
Medium
None of the given