Write a grammar for the language consisting of strings built only of the letters a and b. the strings may have any number of these letters, but the letter combinations bb must be in each string somewhere, and each string must end with a ba.

Grammer:

S->ABS/bba

A->aA/ab

B->bB/ba

Output:

Explanation:

The above grammar satisfies the question because the question says that there is a combination of string made by 'a' and 'b' which ends with 'ba' and there is somewhere 'bb' in the string. Prove of the above grammar is as follows--

So the question says that there is a string ending with 'ab' and there exits 'bb' in anywhere. so all the output define above satisfies the condition and all other output also satisfies the condition.

i don't know to be honest but you on your own

step-by-step explanation:

ignitia made me retarted fool im stoopid laugh like shi

explanation:

i don't know to be honest but you on your own

step-by-step explanation:

ignitia made me retarted fool im stoopid laugh like shi

d?

explanation: