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

GDB

Dear Students,  

The Graded Discussion Board (GDB) for CS606 will be opened on 11th of February 2019. The topic of the GDB is:

GDB Topic:

In the era of information, technology changes at drastic speed and same observed in Computer Science / Information Technology field. Need of intelligent compilers for high level languages are increased. In this time, an argument arises regarding worthlessness of studying Regular Expression and Finite automata in field of compiler construction. Would you differ with this argument or in favor of this comment? Describe your point of view in the structure provided below;

 

Your Point of View (Against / in favor): ___________________________      [1 Mark]

Reasons: [Marks = 2 + 2]

1: ____________________

2: ____________________

 

Important Notes:

-          NO GDB is accepted via e-mail in either case

-          Replies with more than 100 words of GDB will cause in deduction of 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: 432

.

+ 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)

Replies to This Discussion

CS606

Turing machines, equivalent to general computation (anything you can do with a computer)· Push-down automata, equivalent to context-free grammars. Text/input parsers and compilers use these when regular expressions aren't powerful enough (and one of the things you learn in studying finite automata is what regular expressions can't do, which is crucial to knowing when to write a regular expression and when to use something more complicated). Context-free grammars can describe "languages" (sets of valid strings) where the validity at a certain point in parsing the string does not depend on what else has been seen. ·Finite automata, which are equivalent to regular expressions. Regular expressions are widely used in programming for matching strings and extracting text. They are a simple method of describing a set of valid strings using basic characters, grouping, and repitition. They can do a lot, but they can't match balanced sets of parentheses.



Finite automata, which are equivalent to regular expressions. Regular expressions are widely used in programming for matching strings and extracting text. They are a simple method of describing a set of valid strings using basic characters, grouping, and repitition. They can do a lot, but they can't match balanced sets of parentheses. · Push-down automata, equivalent to context-free grammars. Text/input parsers and compilers use these when regular expressions aren't powerful enough (and one of the things you learn in studying finite automata is what regular expressions can't do, which is crucial to knowing when to write a regular expression and when to use something more complicated). Context-free grammars can describe "languages" (sets of valid strings) where the validity at a certain point in parsing the string does not depend on what else has been seen. · Turing machines, equivalent to general computation (anything you can do with a computer)

Finite automata, which are equivalent to regular expressions. Regular expressions are widely used in programming for matching strings and extracting text. They are a simple method of describing a set of valid strings using basic characters, grouping, and repitition. They can do a lot, but they can't match balanced sets of parentheses. · Push-down automata, equivalent to context-free grammars. Text/input parsers and compilers use these when regular expressions aren't powerful enough (and one of the things you learn in studying finite automata is what regular expressions can't do, which is crucial to knowing when to write a regular expression and when to use something more complicated). Context-free grammars can describe "languages" (sets of valid strings) where the validity at a certain point in parsing the string does not depend on what else has been seen. · Turing machines, equivalent to general computation (anything you can do with a computer)

good work

RSS

Latest Activity

20 October posted discussions
25 seconds ago
+ ! ❤SΕNSΙТΙVΕ(∂ΕSΕЯТ ΡЯΙNCΕSS)❤ replied to +¢αяєℓєѕѕ gιяℓ's discussion Boys Be Like xD
57 seconds ago
+ ! ❤SΕNSΙТΙVΕ(∂ΕSΕЯТ ΡЯΙNCΕSS)❤ liked +¢αяєℓєѕѕ gιяℓ's discussion Boys Be Like xD
1 minute ago
+ M.Tariq Malik left a comment for Sami
3 minutes ago
+++STUDENT+++ liked BIA's discussion if u r grateful, I will give u more.
5 minutes ago
20 October posted a status
"جس کو بھی چاہا اسے شدت سے چاہا ہے سلمان سلسلہ ٹوٹا نہیں ہے درد کی زنجیر کا"
7 minutes ago
BIA posted a status
"!!.. Worldly Life is very Short, so return to Allah before you Return To Allah....!!"
7 minutes ago
20 October posted a status
"عشق میں سر پھوڑنا بھی کیا کہ یہ بے مہر لوگ جوئے خوں کو نام دے دیتے ہیں جوئے شیر کا"
8 minutes ago
20 October posted a status
"جانے کس عالم میں تو بچھڑا کہ ہے تیرے بغیر آج تک ہر نقش فریادی مری تحریر کا"
8 minutes ago
20 October posted a status
"جس طرح بادل کا سایہ پیاس بھڑکاتا رہے میں نے یہ عالم بھی دیکھا ہے تری تصویر کا"
9 minutes ago
20 October posted a status
"کیسے پایا تھا تجھے پھر کس طرح کھویا تجھے مجھ سا منکر بھی تو قائل ہو گیا تقدیر کا"
9 minutes ago
20 October posted a status
"منتظر کب سے تحیر ہے تری تقریر کا بات کر تجھ پر گماں ہونے لگا تصویر کا"
9 minutes ago
20 October posted a status
"رات کیا سوئے کہ باقی عمر کی نیند اڑ گئی خواب کیا دیکھا کہ دھڑکا لگ گیا تعبیر کا"
10 minutes ago
BIA posted a status
"!!...Allah Will Not Change The Condition Of a People Until They Change What is in Themselves...!!"
10 minutes ago
BIA liked BIA's blog post Totay Bhe Jo Tara Toh Zamee p Nahi Girta.....
13 minutes ago
BIA liked BIA's blog post Or Tera Raab Bholny wala NAhi. . . .
13 minutes ago
BIA liked BIA's blog post Mera Yaqeen HAi. . .. .
13 minutes ago
BIA liked BIA's blog post Rat Ki Tanhai Main....
13 minutes ago
BIA posted discussions
14 minutes ago
+ M.Tariq Malik left a comment for Rao !
15 minutes ago

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

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