An important property for a probabilistic context-free grammar is that it be consistent, that is, the grammar should assign probability of one to the set of all finite strings or parse trees that it generates.
let G = (N, Σ, S, R), and assume that G is not consistent.