On the covering of left recursive grammars

Anton Nijholt, A.V. Aho (Editor)

    Research output: Contribution to conferencePaperAcademicpeer-review

    6 Citations (Scopus)
    106 Downloads (Pure)

    Abstract

    In this paper we show that some prevailing ideas on the elimination of left recursion in a context-free grammar are not valid. An algorithm and a proof are given to show that every proper context-free grammar is covered by a non-left-recursive grammar.
    Original languageUndefined
    Pages86-96
    Number of pages11
    DOIs
    Publication statusPublished - Jan 1977
    Event4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - Los Angeles, USA
    Duration: 1 Jan 19771 Jan 1977

    Conference

    Conference4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
    Period1/01/771/01/77

    Keywords

    • IR-66787
    • EWI-8806
    • HMI-SLT: Speech and Language Technology

    Cite this