Give three different Contex Free Grammars CFGs that generate

Give three different Contex Free Grammars (CFGs) that generate the language {a}⁺ {b}

Solution

Regular languages can be described by regular expressions. They can also be described by grammar rules, and the grammars are called regular grammars . There are languages that are not regular, and for their description we need a different representation.