Affiliation:
1. RCA Labs., Princeton, NJ
Abstract
A practical method for constructing LR(
k
) processors is developed. These processors are capable of recognizing and parsing an input during a single no-backup scan in a number of steps equal to the length of the input plus the number of steps in its derivation.
The technique presented here is based on the original method described by Knuth, but decreases both the effort required to construct the processor and the size of the processor produced. This procedure involves partitioning the given grammar into a number of smaller parts. If an LR(
k
) processor can be constructed for each part (using Knuth's algorithm) and if certain conditions relating these individual processors are satisfied, then an LR(
k
) processor for the entire grammar can be constructed for them. Using this procedure, an LR(1) parser for ALGOL has been obtained.
Publisher
Association for Computing Machinery (ACM)
Reference7 articles.
1. Translator writing systems
2. Deterministic context free languages
3. On the translation of languages from left to right
4. KORENJAK A. J. Deterministic language processing. Thesis Princeton U. Princeton N. J. Sept. 1967. KORENJAK A. J. Deterministic language processing. Thesis Princeton U. Princeton N. J. Sept. 1967.
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Abstractions, their algorithms, and their compilers;Communications of the ACM;2022-01-24
2. Shift-Reduce Parsers for Transition Networks;Language and Automata Theory and Applications;2014
3. Die erste Dortmunder Projektgruppe – ein sehr persönlicher Rückblick;Informatik als Dialog zwischen Theorie und Anwendung;2009
4. GLR parsing with multiple grammars for natural language queries;ACM Transactions on Asian Language Information Processing;2002-06
5. PCFG Learning by Nonterminal Partition Search;Grammatical Inference: Algorithms and Applications;2002