527 views
0 votes
0 votes

For the language L = {  anbmcmdn : n , m>=1 }

I came with following set of productions :

S-->aSd | A

A--> bAc | bc

whereas the answer was given as below

S--> aSd | aAd

A--> bAc | bc

how far is my answer  correct?

1 Answer

Related questions

0 votes
0 votes
1 answer
2
Sahil1994 asked Nov 30, 2017
306 views
HI Mates, Is it true or false..? If yes or no please explain..?Every Regular set has a LR(1) Grammar....?
13 votes
13 votes
2 answers
3
Prajwal Bhat asked Jan 15, 2017
5,193 views
1. LL(k) grammars have one to one correspondance with DCFL's2. LR(k) grammars have one to one correspondance with CFL'sWhich of them is True and explain it bit clearly?
0 votes
0 votes
2 answers
4
junaid ahmad asked Jul 22, 2018
765 views
Please provide example to disapprove the following points:-1.every DCFG need not be a LR(K).2.every DCFG need not be a LL(K).3.every DCFL is not LL(k).