GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
415 views

 

Given answer: D
Please explain

asked in Compiler Design by Boss (5.1k points)   | 415 views

2 Answers

0 votes
There are two types of regular grammers.

1) regular right linear :  S->aA

2) regular left linear : S->Aa

Both can easily generate regular languages , hence can easily implement lexical  phase.

D is not correct.
answered by (53 points)  
–1 vote
Regular expressions, Finite Automata and NFA with e-moves have the same power of lexical analyser. See the equivalance of automata and regular expressions in ullman text.But grammars have higher power than the previous 2 models.Hence D.
answered by (483 points)  
I didn't get u r explanation  why did u say option d it can't be modeled using regular expressions in lexical analysis everything is defined in terms of regular expressions  explanation in detail plz

Related questions

0 votes
2 answers
1
asked in Compiler Design by prasitamukherjee Loyal (3.7k points)   | 214 views
+1 vote
2 answers
2
Top Users Feb 2017
  1. Arjun

    5396 Points

  2. Bikram

    4230 Points

  3. Habibkhan

    3952 Points

  4. Aboveallplayer

    3086 Points

  5. Debashish Deka

    2564 Points

  6. sriv_shubham

    2318 Points

  7. Smriti012

    2240 Points

  8. Arnabi

    2008 Points

  9. mcjoshi

    1696 Points

  10. sh!va

    1684 Points

Monthly Topper: Rs. 500 gift card

20,863 questions
26,023 answers
59,698 comments
22,136 users