Affiliation:
1. Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL
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).
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献