In formal language theory, a context-free language, also called a Chomsky type-2 language, is a language generated by a context-free grammar. Context-free languages have many applications in programming languages, in particular, most arithmetic... Wikipedia