Abstract
The problem of outputting all parse trees of a string accepted by a context-free grammar is considered. A systolic algorithm is presented that operates in O(m · n) time, where m is the number of distinct parse trees and n is the length of the input. The systolic array uses n 2 processors, each of which requires at most O(log n) bits of storage. This is much more space-efficient than a previously reported systolic algorithm for the same problem, which required O(n log n) space per processor. The algorithm also extends previous algorithms that only output a single parse tree of the input.
Research supported in part by NSF Grants DCR-8420935 and DCR-8604603.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Aho, A. V. and J. D. Ullman, The Theory of Parsing, Translation and Compiling, Vol. 1, Parsing, Prentice-Hall, Englewood Cliffs, N.J., 1972.
Chang, J. H., O. H. Ibarra, and M. A. Palis, "Parallel parsing on a one-way array of finite-state machines", IEEE Transactions on Computers, 36:1 (1987), 64–75.
Chiang, Y. T. and K. S. Fu, "Parallel parsing algorithms and VLSI implementations for syntactic pattern recognition", IEEE Transactions on Pattern Analysis and Machine Intelligence, 6:3 (1984), 302–314.
Earley, J., "An efficient context-free parsing algorithm", Communications of the ACM, 13:2 (1970), 94–102.
Guibas, L. J., H.-T. Kung, and C. D. Thompson, "Direct VLSI implementation of combinatorial algorithms", Proceedings Caltech Conference on VLSI, 1979, 509–525.
Kosaraju, S. R., "Speed of recognition of context-free languages by array automata", SIAM Journal on Computing, 4:3 (1975), 331–340.
Langlois, L., "Parsing (and other dynamic programming problems) on an array of processors", April 1987. Manuscript.
Rytter, W., The complexity of two-way pushdown automata and recursive programs, in Combinatorial Algorithms on Words, A. Apostolico and Z. Galil (eds.), NATO ASI Series F:12, Springer-Verlag: New York/Berlin.
Valiant, L., "General context-free recognition in less than cubic time", Journal of Computer and Systems Sciences, 10:2 (1975), 308–315.
Younger, D. H., "Recognition and parsing of context-free languages in time n 3", Information and Control, 10:2 (1967), 189–208.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ibarra, O.H., Palis, M.A. (1989). An efficient all-parses systolic algorithm for general context-free parsing. In: Dehne, F., Sack, J.R., Santoro, N. (eds) Algorithms and Data Structures. WADS 1989. Lecture Notes in Computer Science, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51542-9_34
Download citation
DOI: https://doi.org/10.1007/3-540-51542-9_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51542-5
Online ISBN: 978-3-540-48237-6
eBook Packages: Springer Book Archive