Problem 1

Exercise 2.6. Give context-free grammars (CFGs) generating the following languages.

1. The set of strings over the alphabet = {a, b} with more as than bs 2. The complement of the language {aⁿbⁿ | n 0}