(CFG) A grammar in which every production rule is of the form :V - w where V is a non-terminal symbol and w is a string consisting of terminals and/or non-terminals.

a formal system that describes a language by specifying how any legal text can be derived from a distinguished symbol called the axiom , or sentence symbol

Chomsky mathematical formalism for language