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

 

Given answer: D
Please explain

asked in Compiler Design by Boss (5.1k points)   | 350 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.4k points)   | 162 views
+1 vote
2 answers
2
Top Users Jan 2017
  1. Debashish Deka

    7172 Points

  2. Habibkhan

    4696 Points

  3. Vijay Thakur

    4308 Points

  4. sudsho

    4090 Points

  5. saurabh rai

    4024 Points

  6. Arjun

    3292 Points

  7. santhoshdevulapally

    3066 Points

  8. GateSet

    3016 Points

  9. Bikram

    3014 Points

  10. Sushant Gokhale

    2892 Points

Monthly Topper: Rs. 500 gift card

18,838 questions
23,808 answers
51,589 comments
20,148 users