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.
|Number of pages||11|
|Publication status||Published - Jan 1977|
- HMI-SLT: Speech and Language Technology