EEMCS EPrints Service
|
||||||||||||||||||||||||||||||||||
|
Nijholt, A.
(1977)
On the covering of left recursive grammars.
In: 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, Los Angeles, USA.
pp. 86-96.
ACM Press.
ISBN not assigned
Full text available as:
Official URL: http://doi.acm.org/10.1145/512950.512959 AbstractIn 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.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
||||||||||||||||||||||||||||||||||