Register

peter linz 4th edition question number 5 of exercise 6.1

377 views

1 Answer

2 votes
2 votes
$S \rightarrow aS|AAA$

$A \rightarrow bA$

but then no string is ever generated by this grammar.
So there doesn't exist any useful production in this grammar

L(G) = $\phi$
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
1
Soumya29 asked Sep 18, 2018
972 views
Peter Linz 4th edition Ex-1.2 -Q10
Q- Prove or Disprove the following claim- $(L^R)^*=(L^*)^R$ for all languages.
Q- Prove or Disprove the following claim- $(L^R)^*=(L^*)^R$for all languages.
User Avatar
1 votes
1 votes
1 answer
2
Naveen Kumar 3 asked Apr 15, 2019
377 views
Peter Linz Edition 4 Exercise 6.1 Question 5 (Page No. 161)
Eliminate all useless productions from the grammar $S\rightarrow aS|AB,$ $A\rightarrow bA,$ $B\rightarrow AA.$ What language does this grammar generate?
Eliminate all useless productions from the grammar$S\rightarrow aS|AB,$$A\rightarrow bA,$$B\rightarrow AA.$What language does this grammar generate?
User Avatar
Link Copied!