My doubt may be silly but plz help.
Given a particular language how to know whether a grammar is CFL or CSL sometimes it really creates me a problem
Language like {a^n b^n c^2n |n > 0} is a CSL but if suppose it was a new random question than our instinct says that we can easily create its PDA so it should be CFL.
SO How to tackle such question in first attempt if before hand we don't know anything about the language