What is meant by regular grammar in Theory of Automata and Formal Languages?

A. a grammar that generates regular languages B. a grammar with an unrestricted left side C. a grammar that always has ambiguous parse trees D. a grammar that generates only undecidable languages