Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
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… Expand
Highly Cited
1997
Highly Cited
1997
This chapter is devoted to context-free languages. Context-free languages and grammars were designed initially to formalize… Expand
Highly Cited
1991
Highly Cited
1991
The first section of this chapter contains the definitions of context-free or algebraic languages by means of context-free… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1991
Highly Cited
1991
Abstract Multiple context-free grammars (mcfg's) is a subclass of generalized context-free grammars introduced by Pollard (1984… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
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… Expand
  • figure 2
  • figure 4
  • figure 6
  • figure 8
  • figure 5
Highly Cited
1979
Highly Cited
1979
  • J. Berstel
  • Teubner Studienbücher : Informatik
  • 1979
  • Corpus ID: 41460170
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… Expand
  • figure 2
  • figure 4
  • figure 6
  • figure 8
  • figure 5
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… Expand
  • figure 1
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… Expand
Highly Cited
1966