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… (More)
Wikipedia

Related topics

Related topics

50 relations
Abstract family of languagesAmbiguous grammarAutomata theoryCYK algorithm
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Büchi context-free languages
We define context-free grammars with Büchi acceptance condition generating languages of countable words. We establish several… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
LSTM recurrent networks learn simple context-free and context-sensitive languages
Previous work on learning regular languages from exemplary training sequences showed that long short-term memory (LSTM… (More)
Is this relevant?
2000
2000
Evolving context-free language predictors
Recurrent neural networks can represent and process simple context-free languages. However, the diiculty of nding with gradient… (More)
  • figure 5
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
A context-free grammar (CFG) in Greibach Normal Form coincides, in another notation, with a system of guarded recursion equations… (More)
  • figure 1
  • figure 9
  • figure 15
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Groups, the Theory of Ends, and Context-Free Languages
This is the first of a series of three papers describing some surprising connections between group theory, the theory of ends… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1978
1978
Noncounting Context-Free Languages
The class of noncountlng (aperiodic) context-free parenthesis languages is introduced here and is found to extend the classical… (More)
Is this relevant?
Highly Cited
1972
Highly Cited
1972
A Minimum Distance Error-Correcting Parser for Context-Free Languages
We assume three types of syntax errors can debase the sentences of a language generated by a context-free grammar: the… (More)
Is this relevant?
Highly Cited
1970
Highly Cited
1970
An Efficient Context-Free Parsing Algorithm
A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both… (More)
  • figure 2
  • figure 4
  • figure 6
  • figure 8
  • figure 5
Is this relevant?
Highly Cited
1968
Highly Cited
1968
Semantics of context-free languages
“Meaning” may be assigned to a string in a context-free language by defining “attributes” of the symbols in a derivation tree for… (More)
Is this relevant?
Highly Cited
1966
Highly Cited
1966
On Context-Free Languages
In this report, certain properties of context-free (CF or type 2) grammars are investigated, like that of Chomsky. In particular… (More)
Is this relevant?