Question

write CFG to represent a language defined by regular expression a*b*​

Answer 1

How to write a grammar that accepts the language formed by strings am bn? In the grammar, there should be rules such that if you add a b symbol you also add a a symbol. Combine two production rules into a single grammar CFG. So you can generate any string that consist of a also a and b in (am bn) pattern.

hope it helps you my friend ✌️

$twinkle$