Which statement correctly describes regular grammar?

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