Is this language context free? How can I come with a CFG for it, I tried coming up with one but I can't keep it in order. {a^m b^n c^k, m > n > k, k >= 0}

Using ANTLR v4.9.3, I created the following grammar … grammar G ; start : s EOF ; s : 'ba' a b ; a : 'b' ; b : 'a' ; Given the above grammar, I thought that the following derivation is possible … ...

I need assistance regarding generating the parse tree and the syntax tree. My version of the solutions are the images below but I don't know if they are correct or way off. Given the Grammar: S-->a...

I have the automata S'-> S S -> a | XbY X -> ε | aZ | Y Y -> b | XX z -> ab | SS After doing one round of removing null productions i got: S'-> S S -> a | XbY | bY X -> aZ |...