How can you prove that a grammar is ambiguous?

A grammar is proven to be ambiguous if it can generate more than one valid parse tree for a given sentence. This means that the grammar allows for multiple interpretations of the same input, leading to uncertainty in understanding the intended meaning.