### Abstract

In this report 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. Some additional results concerning parsing and covering strict determinisitc grammars are also given.

Original language | Undefined |
---|---|

Place of Publication | Enschede |

Publisher | University of Twente, Department of Applied Mathematics |

Number of pages | 27 |

Publication status | Published - Apr 1976 |

### Keywords

- HMI-SLT: Speech and Language Technology
- EWI-9554

## Cite this

Nijholt, A. (1976).

*On the covering of left-recursive grammars*. Enschede: University of Twente, Department of Applied Mathematics.