In an automata or formal-language problem, which option best represents regular grammar?

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