Affiliation:
1. Univ. of Florida
2. Univ. of California, Santa Cruz, CA
Abstract
We present a practical technique that provides an
LR
(0) parser with either fixed or arbitrary look-ahead. The construction algorithm is based on certain paths in the
LR
(0) state diagram, which must be restricted to a maximum length
m
. The technique determines the amount of look-ahead required, and the user is spared the task of guessing it. Instead, the user provides
m
. In situations where single symbol look-ahead is sufficient, the corresponding grammar class (called
LAR
(
m
)) is identical to the
NQLALR
(1) class. For practical grammars that require arbitrary look-ahead, the storage requirements typically do not exceed an amount linear in the size of the corresponding
LR
(0) parser. The technique is shown to work for a practical programming language grammar, and has been used to solve particular cases of the PL/1 keyword problem.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference11 articles.
1. EfficientLR (1) parsers
2. Extending lookahead for LR parsers
3. Bermudez Manuel E. Regular Look-ahead and Look-back for LR Parsers Ph.D. Thesis Computer and Information Sciences Board of Studies University of California Sant~a Cruz June 1984. Bermudez Manuel E. Regular Look-ahead and Look-back for LR Parsers Ph.D. Thesis Computer and Information Sciences Board of Studies University of California Sant~a Cruz June 1984.
4. LR-regular grammars—an extension of LR(k) grammars
5. DeRemer Franklin L. Practical Translators for LR (k) languages Ph.D. Thesis Department of Electrical Engineering M.I.T. Cambridge Mass. 1969. DeRemer Franklin L. Practical Translators for LR (k) languages Ph.D. Thesis Department of Electrical Engineering M.I.T. Cambridge Mass. 1969.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献