CFG problem solved with PDA - looking for alternative solution
First assume $n\ge m$.
Then we can take $i=n-m$ and we have $i+k =l$, so strings are of the form

$ a^i a^m b^m c^k d^k d^i$.

You can do a CFG for that.

Then consider $n\le m$.