We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More


Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

Objective:

 

To learn and understand the concepts of LR(1) parsers, canonical collections and shift/reduce conflicts.

 

 

Lectures Covered: 22-30                                                     

 

 

Instructions:

 

Please read the following instructions carefully before submitting assignment:

 

  • You will submit your assignment before or on due date on VU-LMS.
  • Assignment should be completed by your own efforts it should not be copied from internet, handouts or books.
  • You should submit your solution in Word File only via assignment interface at VU-LMS.
  • Assignment sent via Email will not be replied and accepted/graded in any case.
  • If the submitted assignment does not open or file is corrupt, it will not be graded.

 

 

Question No 1:                                                                                                                          Marks 20

 

Consider the following context free grammar:

 

S  →  Sa

S  →  bS

S  →   c

 

(a) Write the canonical collections of LR(1) items for the given context free grammar:

[4 marks]

 

(b) Identify all conflicting items from solution of part a, and the types of the conflicts. [4 marks]

 

(c) Could the original grammar be converted into an LALR(1) parser that parses all input correctly by resolving conflicts, in the way that YACC and similar parser generators allow? If so, how should they be resolved? In either case, please explain briefly. [4 marks]

 

(d) Rewrite the grammar in an equivalent form that is suitable for LL parsing and minimizes the use of stack space. [4 marks]

 

(e) Rewrite the grammar in an equivalent form that is directly suitable for LR parsing (i.e., does not result in conflicts) and minimizes the use of stack space. [4 marks]

 

 

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?


See Your Saved Posts Timeline

Views: 2446

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)

Attachments:

Replies to This Discussion

Plz guid about solution

ksi ko b ni ata

koi to banai

ye subject q itna mushkil hai  

Thanks GOD ......   me done complete

 

SHARE PLEASE

shokhaa....

anwar jaisooo ko ata jata kuch hota nai... aur shooky hoty rehty hai...

ja pai kam kar apna... kar li hai too announcement krva dy VU pay 

thanks dear on this compliment

agr mujy nhi ati to ap bana kar upload kar dy dekhty hn u kya ho .............. 

 

 

http://www.refinesol.com/

very good ... can you plz share?? 

to ni select krna tha phr :P

Marynoor q hum jo prh rhy is liay mushkil h

Anwar ul haq please share idea 

RSS

© 2020   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.