Cover: Analysis of a Table-Driven Algorithm for Fast Context-Free Parsing

Analysis of a Table-Driven Algorithm for Fast Context-Free Parsing

Published 1988

by James R. Kipps

Purchase Print Copy

 Format Price
Add to Cart Paperback28 pages $20.00

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 paper series. The paper was a product of RAND 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.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND 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.