  Parikh's Theorem states that every context-free grammar (CFG) is equivalent
to some regular CFG when the ordering of symbols in the words is ignored. The
same is not true for the so-called weighted CFGs, which additionally assign a
weight to each grammar rule. If the result holds for a given weighted CFG $G$,
we say that $G$ satisfies the Parikh property. We prove constructively that the
Parikh property holds for every weighted nonexpansive CFG. We also give a
decision procedure for the property when the weights are over the rationals.
