Ambiguous Regular Grammar?

Question

Does such a thing exist? If so, could you please provide an example? Thanks.

Answer 1

A regular grammar may or may not be ambiguous.

G : A -> bA|b|bb

Here G is Regular but Ambiguous.

Answer 2

A -> a
B -> a

can parse the string a as both A or B, and is therefore ambiguous.