Left recursion

In the formal language theory of computer science, left recursion is a special case of recursion where a string is recognized as part of a language… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Parsing Expression Grammars (PEGs) are a formalism that can describe all deterministic context-free languages through a set of… (More)
  • table 1
Is this relevant?
2009
2009
The nature and origin of syntactic recursion in natural languages is a topical problem. Important recent contributions include… (More)
  • table 1
Is this relevant?
2009
2009
Parsing Expression Grammars (PEGs) are specifications of unambiguous recursive-descent style parsers. PEGs incorporate both… (More)
Is this relevant?
2008
2008
Packrat parsing offers several advantages over other parsing techniques, such as the guarantee of linear parse times while… (More)
  • figure 5
  • figure 4
  • figure 11
  • table 1
  • figure 12
Is this relevant?
2006
2006
Top-down backtracking language processors are highly modular, can handle ambiguity, and are easy to implement with clear and… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
In this paper we present Chinese word segmentation algorithms based on the socalled LMR tagging. Our LMR taggers are implemented… (More)
  • table 1
  • figure 2
  • figure 3
  • figure 1
  • table 2
Is this relevant?
2000
2000
A long-standing issue regarding algorithms that manipulate context-free grammars (CFGs) in a “top-down” leftto-right fashion is… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Interactive behavior is constrained by the design of the artifacts available (e.g., a mouse and button) as well as by the ways in… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
1995
1995
Error-correcting codes which are ideals in group rings where the underlying group is metacyclic and non-abelian are examined… (More)
Is this relevant?
1977
1977
Brosgol [Br] formalizes the notion that parsing methods can be classified by the positions at which production rules are… (More)
  • figure 1
Is this relevant?