Context Free Languages

Sup prog,

Soooo, I know you guys hate helping people with homework, but I've been working on this all week and can't figure this shit out. Context-free languages encompass fucking everything, so how the hell can I prove a language isn't one? So far I'm leaning towards using pumping lemma, but I can't formulate a proof where this would work, it's more of a hunch. If anyone would help me I would appreciate it very much, thanks.

PROBLEM:

Prove that the language defined by {a^i b^j c^k | 0 < i < j < k} is not context free.

just draw a turing diagram of the problem and find one example that causes you not reach the terminal node or get stuck in a loop

>>2

By a turing diagram do you mean a Push-down Automata, or a Finite Automata? I'm assuming PDA.

>>3
PDA yeah I completlely forgot the name

>>1
Take a C/C++ for example. It requires you to know "the context" to parse identifiers beside keywords.

>>5
For a simple example, see [1].


_{___
[1] - http://yosefk.com/c++fqa/defective.html#defect-2}

pumping llama

>>1
C++ isn't context-free.

>>5
C is nearly context-free. typedefs are the only little problem, and it is pretty little.