648 views
1 votes
1 votes
Find the language generated by grammar ,where S and A are non terminals and 0 is terminal

S->0A

A->0 | SS

1 Answer

0 votes
0 votes

S->0A

A->0 | SS

Language generated by above grammar is

L={ 03n+2  | n>=0}

Related questions

1 votes
1 votes
1 answer
1
KISHALAY DAS asked Nov 14, 2016
526 views
0 votes
0 votes
1 answer
2
set2018 asked Dec 10, 2017
460 views
Which of the following language generated by given grammar?1) L = {w : na(w) and nb(w) both are even}2) L = {w : na(w) and nb(w) both are odd}3) L = {w : na(w) or nb(w) a...
0 votes
0 votes
1 answer
3
Ashwani Kumar 2 asked May 7, 2016
594 views
S- +SS | -SS | aGive explanation?
2 votes
2 votes
2 answers
4
Rajesh R asked Oct 24, 2017
433 views
$S - AB$$A - aA / epsilon$$B ->aBb / epsilon$What is the class of language generated by the above grammar ?