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

Related topics

Related topics

26 relations
ANTLRAmbiguous grammarBottom-up parsingCYK algorithm
(More)

Broader (1)

Control flow

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Left Recursion in Parsing Expression Grammars
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
Syntactic recursion and iteration
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
Direct Left-Recursive Parsing Expressing Grammars
Parsing Expression Grammars (PEGs) are specifications of unambiguous recursive-descent style parsers. PEGs incorporate both… (More)
Is this relevant?
2008
2008
Packrat parsers can support left recursion
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
A new top-down parsing algorithm to accommodate ambiguity and left recursion in polynomial time
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
Chinese Word Segmentation as LMR Tagging
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
Removing Left Recursion from Context-Free Grammars
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
Milliseconds matter: an introduction to microstrategies and to their use in describing and predicting interactive behavior.
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
Metacyclic error-correcting codes
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
Generalized Left Corner Parsing
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?