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.
2011
2011
We propose a novel context-free grammar representation for parsing libraries in a pure programming language. Our representation… 
2010
2010
In a companion paper, we have presented an alternative representation of grammars in Haskell, explicitizing the grammar’s… 
2008
2008
A container label comprises a main portion bearing generic identification indicia, an adhesive or the like for permanently… 
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
  • 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
In this paper, we emphasize the differences of grammar families and their properties versus language families and their… 
1977
1977
In this paper we show that some prevailing ideas on the elimination of left recursion in a context-free grammar are not valid. An…