What is meant by production rule in Theory of Automata and Formal Languages?

A. a transition that always reads a file B. a rule that describes how grammar symbols may be rewritten C. a memory address of a state D. a final answer in a proof