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.
2018
2018
Parsing Expression Grammars (PEGs) define languages by specifying a recursive-descent parser that recognises the m. The PEG… 
2014
2014
Résumé. Cet article propose une approche pour la formalisation de grammaires pour les langues des signes, rendant compte de leurs… 
2011
2011
We examine the class of languages that can be defined entirely in terms of provability in an extension of the sorted type theory… 
2004
2004
This paper presents languages and images as sharing the fundamental property of self-similarity. The self-similarity of images… 
2003
2003
This article explores how the effectiveness of learning to parse with neural networks can be improved by including two… 
1997
1997
This paper describes a general and eeective method for backward dependence analysis in the presence of recursive data… 
1997
1997
This paper describes a general and e ective method for backward dependence analysis in the presence of recursive data… 
1996
1996
A dialog on the limitations of the Distributive Interactive Simulation is presented wherein a number of potential and actual…