context free grammar

Question

what is the langauge generated by this grammar ?

S-->aS | aSbS | ε what is the language

Answer 1

The language generated will be

    ε UNION { All strings that start with “ a “ and # a’s greater than or equal to # b’s and no consecutive b’s are allowed } where # is a short hand notation for “ number of “

Comments

The grammer can derive two consecutive b’s.

---

@KG yeah u r right

i will update it

thnx 

Answer 2

for each ‘b’, the #a’s > #b’s (sub-string before ‘b’).