Question

Let S = {a,b,c}. Write a context-free grammar for the language: L = {ba" wa" :n > 0, we * and w contains bbc} BIU A- A - IX E ** 11 xX, T T: 12pt You Tube P S-baSaA AaA DACA bbc

Answer 1

Answer- L = { bahwan: no,o, wEE* and w contains bbc } Strings of Language- no bw storing - D-1 Storing - bawa na 2 string - baawaa W WE and contains bbc. W=Y abbc, bbbc, cobe, abbbc abbo بها ={ all possible combination ay bbc with a, b, c }

Grammar for Language L — S- БА At a A a А) В- овье | cв | ььс в ььс Therefore Grammar (G) for Language 2 G - CV, X, P, S) where- v-ts, A, B} >- <a, b, c, P-{ SybA, Aa Aalb В — арыз | В | bbc B)ььс? S - {s}