(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
Uses rules that predict the words that might follow the word just spoken, reducing the number of candidates that need to be evaluated to recognize the next word.
In linguistics and computer science, a context-free grammar (CFG) is a formal grammar in which every production rule is of the form