Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

Monday, January 29, 2018
Closing Date Tuesday, January 30, 2018
Status Open
Question Title Worthlessness of studding Regular Expressions in latest compilers
Question Description

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

Views: 665

Replies to This Discussion

koi Allah ka badda solution send kar dy

check in comments of given link solution are available


I think  yahi question sipring 2017 smester main b aya tha

agr koi senior student ho to wo help kar sakta ha

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)

100 % true solution 

Gdb cs606
Point of View : Against that point
1: because for compiler construction, regular expression and finite automata is neccessary to understand
2: due to finite automata , regular expression can be solved and the best possible solution can be happened.
So, there is no worthlessness of studying regular expression and finite automata.

Please Discuss here about this GDB.Thanks

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>

Discussed & be touched with this discussion. After discussion a perfect solution will come in a result at the end.



For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

Or visit this link 

Click Here For Detail.


.•°How to Download past papers from study groups°•.


Please Click on the below link to see…

.... How to Find Your Subject Study Group & Join .... 


P.S:    Please always try to add the discussion in proper format title like “CS101 Assignment / GDB No 01 Solution & Discussion Due Date: ___________”


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

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