<sod> {{context}}
 
 In [[formal language theory]], a  '''context-free language''' is a [[formal language|language]] generated by some [[context-free grammar]]. The set of all context-free languages is identical to the set of languages accepted by [[pushdown automaton|pushdown automata]].
 
 == References ==
 
 * {{cite book| author = [[Seymour Ginsburg]] | title = The Mathematical Theory of Context-Free Languages | year = 1966 | publisher = McGraw-Hill, Inc. | location = New York, NY, USA}}
* {{cite book|author = [[Michael Sipser]] | year = 1997 | title = Introduction to the Theory of Computation | publisher = PWS Publishing | isbn = 0-534-94728-X}} Chapter 2: Context-Free Languages, pp.91–122.
 
 {{Formal languages and grammars}}
 
 <eod> <sod>{{Context|date=October 2009}}
 
 In [[formal language theory]], a  '''context-free language''' is a [[formal language|language]] generated by some [[context-free grammar]]. The set of all context-free languages is identical to the set of languages accepted by [[pushdown automaton|pushdown automata]].
 
 == References ==
 
 * {{cite book| author = [[Seymour Ginsburg]] | title = The Mathematical Theory of Context-Free Languages | year = 1966 | publisher = McGraw-Hill, Inc. | location = New York, NY, USA}}
* {{cite book|author = [[Michael Sipser]] | year = 1997 | title = Introduction to the Theory of Computation | publisher = PWS Publishing | isbn = 0-534-94728-X}} Chapter 2: Context-Free Languages, pp.&nbsp;91–122.
 
 {{Formal languages and grammars}}
 
 <eod>