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 language | Undefined |
---|---|
Pages | 86-96 |
Number of pages | 11 |
DOIs | |
Publication status | Published - Jan 1977 |
Event | 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - Los Angeles, USA Duration: 1 Jan 1977 → 1 Jan 1977 |
Conference
Conference | 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages |
---|---|
Period | 1/01/77 → 1/01/77 |
Keywords
- IR-66787
- EWI-8806
- HMI-SLT: Speech and Language Technology