retagged by
5,080 views

4 Answers

4 votes
4 votes

Option A-- two consecutive d can't generate

Option B&C can't generate bcz ..any string must endup with d to get accepted by this grammar.

Option D is correct bcz

S->aS

  -> abA

 -> abcA
-> abcd
2 votes
2 votes
option D

in any case d would come at end, that eliminate option B,C

d cannot come twice, that eliminate option A

so option D is the winner
Answer:

Related questions

6 votes
6 votes
4 answers
1
go_editor asked Jun 24, 2016
4,323 views
A problem whose language is recursion is called?Unified problemBoolean functionRecursive problemDecidable
3 votes
3 votes
2 answers
2
go_editor asked Jun 24, 2016
3,695 views
Logic family popular for low power dissipationCMOSECLTTLDTL
7 votes
7 votes
3 answers
3
go_editor asked Jun 24, 2016
6,101 views
A symbol table of length $152$ is processing $25$ entries at any instant. What is occupation density?$0.164$$127$$8.06$$6.08$
6 votes
6 votes
1 answer
4
go_editor asked Jun 24, 2016
5,538 views
In a system using single processor, a new process arrives at the rate of six processes per minute and each such process requires seven seconds of service time. What is th...