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

+ ՏhehαrZααD + liked + M.Tariq Malik's discussion کوئی مشکل پڑے تعویذ بنا سکتے - ہو تم مرے نام پہ ہر داو لگا سکتے ہو
2 hours ago
+ ՏhehαrZααD + liked + M.Tariq Malik's discussion یہ ان کا ظرف ہے بیٹھے ہیں آستینوں میں - یہ میری خو ہے کہ میں یار یار کرتا ہوں
2 hours ago
+ ! ! ! ! ᎠixieᎠuຮt꧂ replied to + "αяsαℓ " Ќąƶµяɨ •"'s discussion Muhabato me li gaye kasmain
4 hours ago
+ ! ! ! ! ᎠixieᎠuຮt꧂ replied to + Iuuoɔǝut+'s discussion Farz Karo ....
4 hours ago
+ ! ! ! ! ᎠixieᎠuຮt꧂ commented on + "αяsαℓ " Ќąƶµяɨ •"'s blog post چھوٹا کام
4 hours ago
+ ! ! ! ! ᎠixieᎠuຮt꧂ liked + M.Tariq Malik's discussion VU Students Reserves The Right to Delete Any Profile On the Site
4 hours ago
+ ! ! ! ! ᎠixieᎠuຮt꧂ liked + Iuuoɔǝut+'s discussion Har Shaks Naraz hy meri baton sy
4 hours ago
+ ! ! ! ! ᎠixieᎠuຮt꧂ liked + M.Tariq Malik's discussion کوئی مشکل پڑے تعویذ بنا سکتے - ہو تم مرے نام پہ ہر داو لگا سکتے ہو
4 hours ago
+ ! ! ! ! ᎠixieᎠuຮt꧂ liked + "AS"'s discussion Jesi Ab hai ..
4 hours ago
+ ! ! ! ! ᎠixieᎠuຮt꧂ liked + Iuuoɔǝut+'s discussion Farz Karo ....
4 hours ago
szh786 updated their profile
6 hours ago
+ ՏhehαrZααD + replied to + M.Tariq Malik's discussion VU Students Reserves The Right to Delete Any Profile On the Site
7 hours ago
+ Android updated their profile
8 hours ago
+ "αяsαℓ " Ќąƶµяɨ •" and + Iuuoɔǝut+ are now friends
8 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked + Iuuoɔǝut+'s discussion Har Shaks Naraz hy meri baton sy
8 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked + "αяsαℓ " Ќąƶµяɨ •"'s blog post چھوٹا کام
8 hours ago
+ ! ! ! ! ! ! ! ! ! AG replied to + Iuuoɔǝut+'s discussion Har Shaks Naraz hy meri baton sy
8 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked + Iuuoɔǝut+'s discussion Farz Karo ....
8 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked + Adeeena's discussion usay pasand hai
8 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked + Iuuoɔǝut+'s discussion Investment risk management report Bangladesh
8 hours ago

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

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