Left-recursion Elimination
Left-Recursion Elimination is a grammar transformation technique used in formal language theory to remove left-recursive productions from context-free grammars, thereby enabling efficient top-down parsing.
14
Publications
370
Citations
23
Authors
17
Institutions
Publications per year
2017–2026
0
Parents
14
Terence Parr, Sam Harwell, Kathleen Fisher · 2014 · 84 citations
A Formalization of Transition Diagram Systems
David Lomet · Journal of the ACM · 1973 · 42 citations · Full text
Removing left recursion from context-free grammars
Robert C. Moore · 2000 · 36 citations
Terence Parr, Sam Harwell, Kathleen Fisher · ACM SIGPLAN Notices · 2014 · 32 citations
A lexical functional grammar system in PROLOG
Andreas Eisele, Jochen Dörre · 1986 · 27 citations · Full text
1–5 of 14
23
2
h-index
2
h-index
2
h-index
German Research Centre for Artificial Intelligence, Germany
1 publications · 27 citations
1
h-index
1
h-index
1–5 of 23
17
Tufts University
Medford, United States
2 h-index
2 publications
116 citations
University of San Francisco
San Francisco, United States
2 h-index
2 publications
116 citations
The University of Texas at Austin
Austin, United States
2 h-index
2 publications
116 citations
Centro Tecnológico de Investigación, Desarrollo e Innovación en tecnologías de la Información y las Comunicaciones (TIC)
Valencia, Spain
1 h-index
1 publications
19 citations
University of Stuttgart
Stuttgart, Germany
1 h-index
2 publications
54 citations

University of Rostock
Rostock, Germany
1 h-index
3 publications
57 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
1 h-index
1 publications
42 citations
Universitat Politècnica de València
Valencia, Spain
1 h-index
1 publications
19 citations
1–8 of 17
ENTCS · 2 publications · 38 citations
2
h-index
1 publications · 11 citations
1
h-index
JACM · 1 publications · 42 citations
1
h-index
Repository · 1 publications · 14 citations
1
h-index
1 publications · 32 citations
1
h-index
1–5