Skip to search formSkip to main contentSkip to account menu

Context-free grammar

Known as: Context-free grammars, CFG, Context Free Grammar 
A context-free grammar (CFG) is a term used in formal language theory to describe a certain type of formal grammar. A context-free grammar is a set… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
String expression analysis conservatively approximates the possible string values generated by a program. We consider the… 
2006
2006
Several grammars have been proposed for modeling RNA pseudoknotted structure. In this paper, we focus on multiple context-free… 
2004
2004
OntoLearn is a system for word sense disambiguation, used to automat- ically enrich WordNet with domain concepts and to… 
1997
1997
Given a context free grammar (CFG) G and an integer n >= 0 we present an algorithm for generating strings derivable from the… 
Highly Cited
1997
Highly Cited
1997
Abstract Visual language specification has been investigated for more than two decades now and many different formalisms for… 
Highly Cited
1996
Highly Cited
1996
1. Preface 2. 1. People, Sound Waves, and Illusions 3. 2. Traditions of Grammar and Science 4. 3. Should We Study Language or… 
1993
1993
Stochastic lexicalized context-free grammar (SLCFG) is an attractive compromise between the parsing efficiency of stochastic… 
1973
1973
  • W. Savitch
  • 1973
  • Corpus ID: 26906820
Normal form theorems which factor arbitrary phrase-structure grammars into context-free grammars and “a little more” are… 
Highly Cited
1971
Highly Cited
1971
  • T. W. Pratt
  • 1971
  • Corpus ID: 205894879