context free language

Question

Show that the language L={xy∣|x|=|y|,x≠y} is context free. Do not give links plz explain in simple manner

Comments

This question was asked in GATE 2020:
https://gateoverflow.in/333199/gate-2020-cse-question-32

Useful CS Stack exchange link to understand why given language is context free: 

https://cs.stackexchange.com/questions/307/show-that-xy-∣-x-y-x-≠-y-is-context-free

---

@Ashwin Kulkarni, How can we find that this grammar is CFL? I didn’t understand using the link provided!

---

Is the language also regular?

Answer 1

we can take it as wwr .

where x=w

and y=wr so |x|=|y| and it is cfl.

Comments

It is also given  x=!y

x = 101 (w)

y =  101 (w^r)

for this case above explanation is not valid.

---

Awesome! Partially correct but most intuitive answer.