CS606 All Current Mid Term Papers Spring 2013 (25 May 2013 ~ 06 June 2013) at One Place

[ranamoon]

CS606 All Current Mid Term Papers Spring 2013 (25 May 2013 ~ 06 June 2013) at One Place

From 25 May 22, 2013 to 06 June 2013 Spring 2013

Current Mid Term Papers Spring 2013 Papers, May 2013 Mid Term Papers, Solved Mid Term Papers, Solved Papers, Solved Past Papers, Solved MCQs

 

[+M.Tariq Malik]

Please Share your Current Papers mid Term Papers Spring 2013 Questions/Pattern here to help each other.

Share your today midterm paper here in reply of this discussion

Thanks

[ıllıllı ħέάŕţвέάţ ıllıllı]

Todays paper Attached :)

[happy munda]

thanks

[+M.Tariq Malik]

 +-•(¯`»._** ẪȡȡȋɕȾȇȡ **_.«x thanks for sharing ur paper 

Attention Related Mid Term papers Spring 2013: All Fellows You don’t need to go any other site for current Mid Term papers Spring  2013, Because All discussed data/sharing of our members in this discussion are going from here to other sites. You can judge this at other sites yourself. So don’t waste your precious time with different links.

[sahar fatima]

plz convert this pap in 2003 and plz tell mcqs kesy a rhe hain

[+M.Tariq Malik]

sahar fatima below ma nay file ka data paste kar diha hai check it 

[sahar fatima]

thnks bhai mughy kahin aur sy bi cs606 k pap search kr dain na

[+M.Tariq Malik]

MIDTERM-25/5/13

 

 

Q1)Considering string “ab”, show that the following grammar is ambiguous using parse trees. The e below is epsilon.

 

S ® A B A B

A ® a A | e

B ® b B | e                                                                             (5Marks)

 

Q2) vConsider the following grammar;

 

Statement à if expression then statement else statement

Statement à if expression then statement

 

You are required to provide an alternate production(s) so that it may become free from the backtracking.

(5Marks)

 

 

Q3) Considering the following grammar, calculate the first set of non-terminals S, A and B.

 

S  →  AB

A →   a | ε                                                                                      (3 Marks)

B →   b | ε

 

Q4) How recursive descent parser is implemented using any Object Oriented language?

                                                                                              (3Marks)

 

Q5) Considering the following grammar, calculate the follow set of non-terminals S and A.

 

S  →  AB

A →   a | ε

B →   b | ε                                                                                   (2 marks)

 

Q6) Write a regular expression for the language of all words that starts and ends with different letters.

                                                                                                                                 (2 Marks)

[King]

uff yar cs606 ka paper tha kay pata nhi kaya tha itna ajeeb paper kuch samaj nhi ah rahie the kay question main kaya poch raha hai or hum nay answer kaya dana hai

MCQs all from book from chapter 1 to chapter20

1-Core use of Symbol table
2-Buttom-up also called LR
3-Arithematic Expresion
E -> id Q
Q -> ER|epsilon
R -> +Q|-Q|*Q|/Q
4-Non-terminal batana tha first S A B ka
S -> AB
A -> ab
B -> ba
5-Scenario given tha ios ka algorithmic view lana tha
6-Scenario give tha ios ka final elimination Left recursive lana tha

[++]

Thanks a lotttt Dear 

[+M.Tariq Malik]

King thanks for sahring & best of luck for ur result 

Attention Related Mid Term papers Spring 2013: All Fellows You don’t need to go any other site for current Mid Term papers Spring  2013, Because All discussed data/sharing of our members in this discussion are going from here to other sites. You can judge this at other sites yourself. So don’t waste your precious time with different links.

[Muhammad Ehtasham]

Nice sharing thanks