On the covering of left recursive grammars

Authors:
A. Nijholt
Affiliations:
Free University, Amsterdam, The Netherlands
Venue:
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Year:
1977

Citing 2
Cited 1

On the Covering and Reduction Problems for Context-Free Grammars

Journal of the ACM (JACM)
The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling

The nonexistence of some covering context-free grammars

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

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.