The Graded Discussion Board (GDB) for CS606 will be open for two days on 8th of August 2018. The topic of the GDB is:
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]
- NO GDB is accepted via e-mail in either case
- Replies with more than 100 words of GDB will cause in deduction of marks
For any further queries please contact us at firstname.lastname@example.org
+ 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)
plz solution Apload ker den
please send solution
please send soultion
any lectures idea??
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.