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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2015
012319772015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Parsing Expression Grammars (PEGs) define languages by specifying a recursive-descent parser that recognises them. The PEG… (More)
  • table 2
Is this relevant?
2014
2014
Résumé. Cet article propose une approche pour la formalisation de grammaires pour les langues des signes, rendant compte de leurs… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Much recent research in Estimation of Distribution Algorithms (EDA) applied to Genetic Programming has adopted a Stochastic… (More)
  • table I
  • table II
  • figure 2
  • figure I
  • figure 3
Is this relevant?
2010
2010
The Visualized LL parsing is presented, the algorithm is based on non-left recursive grammar, and in the environment of VC++, it… (More)
  • figure I
  • figure 2
  • figure 3
Is this relevant?
2010
2010
In a companion paper, we have presented an alternative representation of grammars in Haskell, explicitizing the grammar’s… (More)
  • figure 1
Is this relevant?
2009
2009
Many software development tools that assist with tasks such as testing and maintenance are specific to a particular development… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2003
2003
Attribute grammars (AGs) are known to be a useful formalism for semantic analysis and translation. However, debugging AGs is… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 7
  • figure 8
Is this relevant?
2003
2003
Attribute grammars (AGs) are known to be a useful formalism for semantic analysis and translation. However, debugging AGs is… (More)
  • figure 2
  • figure 4
  • figure 3
  • figure 7
  • table 1
Is this relevant?
1998
1998
This paper describes a general and powerful method for dependence analysis in the presence of recursive data constructions. The… (More)
Is this relevant?
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… (More)
Is this relevant?