Skip to search formSkip to main contentSkip to account menu

Context-free language

Known as: CFL, Context-free, Context-free languages 
In formal language theory, a context-free language (CFL) is a language generated by some context-free grammar (CFG). Different CF grammars can… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
  • D. Knuth
  • Mathematical systems theory
  • 2005
  • Corpus ID: 5182310
Abstract“Meaning” may be assigned to a string in a context-free language by defining “attributes” of the symbols in a derivation… 
Highly Cited
1997
Highly Cited
1997
This chapter is devoted to context-free languages. Context-free languages and grammars were designed initially to formalize… 
Highly Cited
1990
Highly Cited
1990
Highly Cited
1983
Highly Cited
1983
A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both… 
Highly Cited
1979
Highly Cited
1979
  • J. Berstel
  • Teubner Studienbücher : Informatik
  • 1979
  • Corpus ID: 41460170
Highly Cited
1978
Highly Cited
1978
From the Publisher: Formal language theory was fist developed in the mid 1950's in an attempt to develop theories of natural… 
Highly Cited
1970
Highly Cited
1970
A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both… 
Highly Cited
1968
Highly Cited
1968
  • A. Aho
  • J. ACM
  • 1968
  • Corpus ID: 9539666
A new type of grammar for generating formal languages, called an indexed grammar, is presented. An indexed grammar is an… 
Highly Cited
1966
Highly Cited
1966
In this report, certain properties of context-free (CF or type 2) grammars are investigated, like that of Chomsky. In particular… 
Highly Cited
1966