What is the context-free grammar for the language anbn?

The context-free grammar for the language anbn is S - aSb , where S is the start symbol, a and b are terminals representing characters, and represents an empty string. This grammar generates strings with an equal number of 'a's and 'b's in the form of an bn.