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.


+ Link For Assignments, GDBs & Online Quizzes Solution


+ Link For Past Papers, Solved MCQs, Short Notes & More

Looking For Something at Site? Search Below

Dear Students,

GDB is announced for CS606. GDB submission will be open on August 8 to August 9, 2017.



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


+ 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: 2249

Replies to This Discussion

Yar koi solution de do plz cs606 ka

ni unky nakhry horhy ab khud jo krliya

asif bhai ap he bta do plz

zalimooo dedo solution kahan busy ho sb ye idea hi dedo koi to

koi idea hi dedo yr

kisi ky pass bi solution nai ha???

ye sol hy edit krke sb change krke submit kro

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)


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

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