Is it possible to give a context-free grammar for the language below :
L = { anbmcndm | n, m >=1 }
As, my analysis,whenever we try to produce equal a and c and try to put b in between, it would not be possible for us to put d just next to the stream of c's.
hence, it is not possible to give a Context Free Grammar for this language.
Is my analysis correct?