902 views
2 votes
2 votes
Consider the following CFG 'G'

S--> aA/bSS/SS

A--> aAb/bAa/AA/ε

The language generated by G is:

a)Set of all strings with atleast one 'a'

b)Set of all strings with atleast two a's

c)Set of all strings with atleast one more 'a' than number of b's

d)None of these

2 Answers

1 votes
1 votes

A is the correct option.

 

Related questions

0 votes
0 votes
1 answer
1
0 votes
0 votes
1 answer
2
practicalmetal asked Mar 15, 2023
496 views
Is the following language context free:The set of all strings with number of a’s equal to number of b’s and the sum of a’s and b’s to be divisible by 3.
0 votes
0 votes
1 answer
4
hrcule asked Mar 21, 2018
663 views
Is true..? In an unambiguous grammar every string has exactly one derivation.