Here we define a context-sensitive grammar and language, as well as give an example of a language that is context-sensitive but not context-free: {a^n b^n c^n : n at least 0}. The idea is that a CSG can do exactly what a CFG can do, except that it enforces a "context" in which the rule can be applied.

If you like this content, please consider subscribing to my channel:    / @easytheory  

▶SEND ME THEORY QUESTIONS◀
[email protected]

▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.