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 ago in Theory of Computation by Loyal (7.1k points) | 19 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 ago 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
50,070 questions
53,206 answers
70,420 users