Summary: We introduce a couple of families of codifiable languages and investigate properties of these families as well as interrelationships between diffeerent families. We also develop an algorithm based on the Earley algorithm to compute the values of the inverse of the Parikh matrix mapping over a codifiable context-free language. Finally, an attributed grammar that computes the values of the Parikh matrix mapping is defined.