The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes
Remove $λ$-productions from the grammar with productions $S\rightarrow aSb|SS|\lambda.$
What language does the resulting grammar generate?
asked in Theory of Computation by Boss (14k points) | 42 views

1 Answer

0 votes

The language generated by the above grammar contains the string Epsilon.

So you can not remove the Epsilon production from the start symbol S.

The grammar will remain same even after removing the Epsilon production.

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,540 questions
54,100 answers
71,007 users