Skip to main content
Article thumbnail
Location of Repository

Removing Left Recursion from Context-Free Grammars

By Robert Moore

Abstract

context-free grammars (CFGs) in a "topdown " left-to-right fashion is that left recursion can lead to nontermination. An algorithm is known that transforms any CFG into an equivalent nonleft -recursive CFG, but the resulting grammars are often too large for practical use. We present a new method for removing left recursion from CFGs that is both theoretically superior to the standard algorithm, and produces very compact non-left-recursive CFGs in practice

Year: 2000
OAI identifier: oai:CiteSeerX.psu:10.1.1.19.8928
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://acl.ldc.upenn.edu/A/A00... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.