Create cfg and npda/pda for Language {ww} I've been trying to make a CFG, and npda/pda for this language (to construct an npda for accepting the language): 

L(M)={ww:w∈{a,b}∗,|w| is even}.

i had already solved the reverse of the language (like this):

L′={wwR:w∈{a,b}∗},

Please check this snapshot to know what i am asking to do ! (L') : http://i921.photobucket.com/albums/ad53/Johann_1990/IMG_20150117_132616.jpg

but is there is a way to solve this L(M)={ww:w∈{a,b}∗,|w| is even}?

For example, abaaba∈L with w=aba.

Note that I'm not asking to prove by conduction or anything else.
Short answer: $L$ is not context-free, so there is no CFG/PDA.