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 (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
We propose a novel unsupervised learning approach to build features suitable for object detection and classification. The… 
Highly Cited
2008
Highly Cited
2008
Our growing dependence on increasingly complex computer and software systems necessitates the development of formalisms… 
Review
2007
Review
2007
. Multiple context-free grammar (MCFG) is a weakly context-sensitive grammar formalism that deals with tuples of strings. An MCFG… 
Highly Cited
2006
Highly Cited
2006
I argue that the impact of context on organizational behavior is not sufficiently recognized or appreciated by researchers. I… 
Highly Cited
2003
Highly Cited
2003
This report extends earlier context-free treatments of turn-taking for conversation by describing the context-sensitive operation… 
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
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
Abstract“Meaning” may be assigned to a string in a context-free language by defining “attributes” of the symbols in a derivation… 
Highly Cited
1968
Highly Cited
1968
A new type of grammar for generating formal languages, called an indexed grammar, is presented. An indexed grammar is an… 
Highly Cited
1966