We have been working very hard since 2009 to facilitate in your learning Read More. We can't keep up without your support. Donate Now.

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


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


Views: 499

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

+ıllıllı ᎶᏋᏁᎥᏬᏕ ᏰᎥᏒᎴ ıllıllı+ liked jawad's discussion Tum Se pahle woh Jo shaks takat nashin tha || Habib jalib poetry|| Urdu poetry
7 minutes ago
+ıllıllı ᎶᏋᏁᎥᏬᏕ ᏰᎥᏒᎴ ıllıllı+ liked Miss. Churhail's discussion NAFRATON K AINY PE BARI DHOOL JAMI HY!!!!
12 minutes ago
+ıllıllı ᎶᏋᏁᎥᏬᏕ ᏰᎥᏒᎴ ıllıllı+ replied to zohaib iftikhar's discussion ...;KIA KISI K NASEEB KHARAB HO SAKTY HAIN?...;
15 minutes ago
+ıllıllı ᎶᏋᏁᎥᏬᏕ ᏰᎥᏒᎴ ıllıllı+ liked zohaib iftikhar's discussion ...;KIA KISI K NASEEB KHARAB HO SAKTY HAIN?...;
16 minutes ago
+ıllıllı ᎶᏋᏁᎥᏬᏕ ᏰᎥᏒᎴ ıllıllı+ replied to Miss. Churhail's discussion HIPPOCAMPUS YANI MEMORY!!!
17 minutes ago
+ıllıllı ᎶᏋᏁᎥᏬᏕ ᏰᎥᏒᎴ ıllıllı+ liked Miss. Churhail's discussion HIPPOCAMPUS YANI MEMORY!!!
17 minutes ago
+ıllıllı ᎶᏋᏁᎥᏬᏕ ᏰᎥᏒᎴ ıllıllı+ replied to Omar's discussion Eyes and Hearts
18 minutes ago
+ıllıllı ᎶᏋᏁᎥᏬᏕ ᏰᎥᏒᎴ ıllıllı+ liked Omar's discussion Eyes and Hearts
18 minutes ago
+ıllıllı ᎶᏋᏁᎥᏬᏕ ᏰᎥᏒᎴ ıllıllı+ replied to 乇メ-丂イひり3刀イ.'s discussion *** My Drawing ***
21 minutes ago
+ıllıllı ᎶᏋᏁᎥᏬᏕ ᏰᎥᏒᎴ ıllıllı+ liked 乇メ-丂イひり3刀イ.'s discussion *** My Drawing ***
21 minutes ago
Hira replied to +M.Tariq Malik's discussion MGMT627 GDB Fall 2020 Solution & Discussion Last Date: 26-11-2020 in the group MGMT627 Project Management
36 minutes ago
Hira joined +M.Tariq Malik's group
36 minutes ago

Looking For Something? Search Here

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

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

.