In formal language theory, a context-free grammar (CFG) is a formal grammar in which every production rule is of the form
- V → w
where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty).
The languages generated by context-free grammars are known as the context-free languages.
A formal grammar is considered "context free" when its production rules can be applied regardless of the context of a nonterminal.
Context-free grammars are important in linguistics for describing the structure of sentences and words in natural language, and in computer science for describing the structure of programming languages and other formal languages.
In linguistics, some authors use the term phrase structure grammar to refer to context-free grammars, whereby phrase structure grammars are distinct from dependency grammars. In computer science, a popular notation for context-free grammars is Backus–Naur Form, or BNF.
Read more about Context-free Grammar: Background, Formal Definitions, Normal Forms, Undecidable Problems, Extensions, Subclasses, Linguistic Applications
Famous quotes containing the word grammar:
“The new grammar of race is constructed in a way that George Orwell would have appreciated, because its rules make some ideas impossible to express—unless, of course, one wants to be called a racist.”
—Stephen Carter (b. 1954)