Distributive laws help in combining algebra and coalgebra in a monad. They are useful for solving equations and improving proof methods. When a monad is not free, proving distributive laws can be tricky. This paper shows how to get a distributive law for a monad with an equational presentation from one for the free monad. The researchers used this to prove that two different ways of representing context-free languages are equivalent.