i am getting c

0 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

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