No, it is not... – MCH – 2013-07-22T00:01:16.190

@MCH Where can I find a proof that it's not? – None – 2013-07-22T00:01:59.643

@MCH (+) does L belong in some specific kind of languages? Thanks :) – None – 2013-07-22T00:37:51.877

2

As MCH notes, this language is not context-free, so there's no point looking for a CFG for it. This language is a standard example of a non-context-free language. To show that it isn't context-free, have a look at our reference question, which has all the basic tools, and some examples which are very similar to $L$. Conversely, to determine which class it is in fact in, you need to demonstrate an appropriate grammar or machine that generates it. (cont.)

(cont.) The Chomsky Hierarchy might be a good place to start looking for where this language might fit. If you haven't reached the higher levels of languages, you may have to wait until you have learnt a bit more before you can completely answer this question.

On the site-maintenance side of things, as the answer to your question is a simple 'no', I'm going to suggest the question be put on hold so that you can edit it to refine or adjust your question appropriately (remember to try to answer your questions yourself first, and explain where you get stuck - this helps with getting better answers, and with your understanding). This just stops people from posting answers to an unfinished question, and cluttering up the place. When the question is ready again, the question can be reopened for answers. – Luke Mathieson – 2013-07-22T09:05:05.533

2Voting to close. Please check lecture notes on context-free languages, where you will find this example worked out using the pumping lemma. – Yuval Filmus – 2013-07-22T12:36:19.210

1

possible duplicate of How can I prove this language is not context-free? and How to prove that a language is not context-free?