The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
38 views
Remove all unit-productions, all useless productions, and all λ-productions from the grammar

$S\rightarrow aA|aBB,$

$A\rightarrow aaA|\lambda,$

$B\rightarrow bB|bbC,$

$C\rightarrow B.$
What language does this grammar generate?
asked in Theory of Computation by Boss (14k points) | 38 views

1 Answer

0 votes

After removing Epsilon production

S ->aA/a/aBB

A->aaA/aa

B->bB/bbC

C->B

--------------------------------------------------------------------------

After removing Unit production

S->aA/a/aBB
A->aaA/aa

B->bB/bbB

--------------------------------------------------------------------------

After removing Useless symbol 

S->aA/a/aBB

A->aaA/aa

answered by (183 points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,587 questions
54,193 answers
187,529 comments
71,147 users