This paper is a companion to RAND/N-2841, which describes a variation on Tomita's algorithm for general context-free parsing. It analyzes Tomita's algorithm with respect to its time complexity. The author presents a modification of this algorithm for which the time bound is reduced. He also discusses space bounds, as well as two subclasses of context-free grammars.
This report is part of the RAND Corporation paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.