every dfa contain dead state ? No na.

The Gateway to Computer Science Excellence

+1 vote

Consider the following CFG.

S $\rightarrow$aAb|aBc|bAd|bBe

A$\rightarrow$g

B$\rightarrow$g

The number of states exist in DFA using LALR (1) construction for the above grammar ____________??

(Doubt): In CLR(1) it takes 14 states and clubbing two states into one state will take 13 states in LALR(1). The LALR(1) construction takes 13 states for the construction but additional one more dead state is required as we are using DFA....!!! So 14 is the answer, I think.. But answer in Made Easy given as 13 Only.. Explain....???!!!

S $\rightarrow$aAb|aBc|bAd|bBe

A$\rightarrow$g

B$\rightarrow$g

The number of states exist in DFA using LALR (1) construction for the above grammar ____________??

(Doubt): In CLR(1) it takes 14 states and clubbing two states into one state will take 13 states in LALR(1). The LALR(1) construction takes 13 states for the construction but additional one more dead state is required as we are using DFA....!!! So 14 is the answer, I think.. But answer in Made Easy given as 13 Only.. Explain....???!!!

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,388 answers

198,577 comments

105,416 users