Skip to search formSkip to main contentSkip to account menu

Recursive grammar

Known as: Non-recursive grammar 
In computer science, a grammar is informally called a recursive grammar if it contains production rules that are recursive, meaning that expanding a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We introduce PURE, a pure declarative approach to implementing declarative transformations with declarative tools. This… 
2010
2010
In a companion paper, we have presented an alternative representation of grammars in Haskell, explicitizing the grammar’s… 
2009
2009
Many software development tools that assist with tasks such as testing and maintenance are specific to a particular development… 
2008
2008
A container label comprises a main portion bearing generic identification indicia, an adhesive or the like for permanently… 
2007
2007
1999
1999
This paper presents a memory-based model of human syntactic processing: Data-Oriented Parsing. After a brief introduction… 
1998
1998
  • Yanhong A. Liu
  • Proceedings of the International Conference on…
  • 1998
  • Corpus ID: 564656
The paper describes a general and powerful method for dependence analysis in the presence of recursive data constructions. The… 
1996
1996
  • H. Fernau
  • Fundam. Informaticae
  • 1996
  • Corpus ID: 10539071
In this paper, we emphasize the differences of grammar families and their properties versus language families and their…