Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,630,690 papers from all fields of science
Search
Sign In
Create Free Account
Context-free language
Known as:
CFL
, Context-free
, Context-free languages
Expand
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
Create Alert
Alert
Related topics
Related topics
50 relations
Abstract family of languages
Ambiguous grammar
Automata theory
CYK algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Semantics of context-free languages
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
Context-Free Languages and Pushdown Automata
Jean-Michel Autebert
,
J. Berstel
,
L. Boasson
Handbook of Formal Languages
1997
Corpus ID: 1974181
This chapter is devoted to context-free languages. Context-free languages and grammars were designed initially to formalize…
Expand
Highly Cited
1990
Highly Cited
1990
Context-Free Languages
J. Berstel
,
L. Boasson
Handbook of Theoretical Computer Science, Volume…
1990
Corpus ID: 308443
Highly Cited
1983
Highly Cited
1983
An efficient context-free parsing algorithm
J. Earley
CACM
1983
Corpus ID: 35664
A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both…
Expand
Highly Cited
1979
Highly Cited
1979
Transductions and context-free languages
J. Berstel
Teubner Studienbücher : Informatik
1979
Corpus ID: 41460170
Highly Cited
1978
Highly Cited
1978
Introduction to formal language theory
M. Harrison
1978
Corpus ID: 57856433
From the Publisher: Formal language theory was fist developed in the mid 1950's in an attempt to develop theories of natural…
Expand
Highly Cited
1970
Highly Cited
1970
An efficient context-free parsing algorithm
J. Earley
CACM
1970
Corpus ID: 47032707
A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both…
Expand
Highly Cited
1968
Highly Cited
1968
Indexed Grammars—An Extension of Context-Free Grammars
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
Highly Cited
1966
Highly Cited
1966
On Context-Free Languages
R. Parikh
JACM
1966
Corpus ID: 12263468
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
Highly Cited
1966
The mathematical theory of context free languages
S. Ginsburg
1966
Corpus ID: 61616162
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE