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.

Assignment No. 01 Semester: Spring 2014 Compiler Construction CS606 Total Marks: 20 Due Date: 12/05/2014

Assignment No. 01 Semester: Spring 2014 Compiler Construction CS606 Total Marks: 20 Due Date: 12/05/2014 Objective: To learn and understand basic concepts of Context free grammar, parse tree, regular expression, deterministic and nondeterministic finite automata in building a Lexical analyzer. Instructions: It should be clear that your assignment will not get any credit (zero marks will be awarded) if: o The assignment is submitted after due date. o The submitted assignment does not open or file corrupt. o The assignment is copied (from other student or copy from handouts or internet). o Student name and ID are not mentioned in the assignment file. o It is in some format other than .doc or .docx(MS Word Document). For any query about the assignment, contact at cs606@vu.edu.pk Question No 1: Marks 10 Let CFG be G = (Vn, Vt, S, P) where;  Vn = {, , , }  Vt = {x, y, z, -, +}  S = You are required to: 1. Derive expression “x – y + z”. [5 Marks] 2. Construct a parse tree for expression “x – y + z”. [5 Marks] Question No 2: Marks 10 Construct Nondeterministic finite automata (NFA) for regular expression (a | a*b) using Thompson’s Construction Algorithm. BEST OF LUCK

+ 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: 1732

.

+ 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

Lets start the Discussion !!

easy Assignment 

Question No 1:                                                                                                                       Marks 10

Let CFG be G = (Vn, Vt, S, P) where;

  • Vn = {<goal>, <expression>, <term>, <factor>}
  • Vt = {x, y, z, -, +}
  • S = <goal>

You are required to:

  1. Derive expression “x – y + z”. [5 Marks]
  2. Construct a parse tree for expression “x – y + z”. [5 Marks]

 

Question No 2:                                                                                                                        Marks 10             

Construct Nondeterministic finite automata (NFA) for regular expression (a | a*b) using Thompson’s Construction Algorithm.

 

Hello Friends Kia CS606 ki Assignment mil sakti hay its Urgent plz

easy assignment

yar ager easy he to is ka matlb discuss b nahi kren kia?????
yar ager easy he to is ka matlb discuss b nahi kren kia?????
yar ager easy he to is ka matlb discuss b nahi kren kia?????

bro ap pochain kia pochna hai kia help chy???

Attachments:

dear koi to assigment sendoooooooooooooo

Please Discuss here about this assignment.Thanks

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions.

RSS

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

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

.