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

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


+ Click Here To Join also Our facebook study Group.


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


See Your Saved Posts Timeline

Views: 411

.

+ http://bit.ly/vucodes (Vu Study Groups By Subject Codes Wise)

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

Tahir Mahmood joined + M.Tariq Malik's group
4 minutes ago
Tahir Mahmood liked + M.Tariq Malik's discussion MGT503 GDB Spring 2019 Solution & Discussion
7 minutes ago
Profile IconTahir Mahmood, Waseem Hakeem, Usman Mehar and 20 more joined Virtual University of Pakistan
7 minutes ago
+¢αяєℓєѕѕ gιяℓ updated their profile
13 minutes ago
+ ! ! ! ! ! Hoori ! ! ! ! ! + and + "ραℓωαѕнα" ★ are now friends
15 minutes ago
+ ! ! ! ! ! Hoori ! ! ! ! ! + updated their profile
16 minutes ago
Arsla rajpoot updated their profile
21 minutes ago
+ + +SaLAr SiKaNDer replied to + + +SaLAr SiKaNDer's discussion wo tere naseeb ki baarish❤️
37 minutes ago

Study Corner For DigiSkills Students

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

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