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

Authors

23

  1. KF
    Kathleen Fisher

    AT&T (United States), United States

    2 publications · 116 citations

    2

    h-index

  2. TP
    Terence Parr

    University of San Francisco, United States

    2 publications · 116 citations

    2

    h-index

  3. SH
    Sam Harwell

    The University of Texas at Austin, United States

    2 publications · 116 citations

    2

    h-index

  4. AE
    Andreas Eisele

    German Research Centre for Artificial Intelligence, Germany

    1 publications · 27 citations

    1

    h-index

  5. FP
    François Perrault

    Communications Research Centre Canada, Canada

    1 publications · 24 citations

    1

    h-index

1–5 of 23

Venues

  1. Electronic Notes in Theoretical Computer Science

    ENTCS · 2 publications · 38 citations

    2

    h-index

  2. Journal of Functional Programming

    1 publications · 11 citations

    1

    h-index

  3. Journal of the ACM

    JACM · 1 publications · 42 citations

    1

    h-index

  4. Research Portal (King's College London)

    Repository · 1 publications · 14 citations

    1

    h-index

  5. ACM SIGPLAN Notices

    1 publications · 32 citations

    1

    h-index

1–5