학술논문
On the Complete Covering Problem for LR(k)Grammars
Document Type
Article
Author
Source
Journal of the ACM (JACM); January 1976, Vol. 23 Issue: 1 p17-30, 14p
Subject
Language
ISSN
00045411
Abstract
A direct, one-step transformation is presented for transforming an arbitrary LR(k) context-free grammar, G, to an LR(1) grammar, G′, which completely covers G. Under additional hypotheses, G′ may be made LR(0).