An efficient all-parses systolic algorithm for general context-free parsing
- 650 Downloads
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 n2 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.
KeywordsClock Cycle Systolic Array Parse Tree Input String Recognition Phase
Unable to display preview. Download preview PDF.
- [AHO72]Aho, A. V. and J. D. Ullman, The Theory of Parsing, Translation and Compiling, Vol. 1, Parsing, Prentice-Hall, Englewood Cliffs, N.J., 1972.Google Scholar
- [CHAN87]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.Google Scholar
- [CHIA84]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.Google Scholar
- [GUIB79]Guibas, L. J., H.-T. Kung, and C. D. Thompson, "Direct VLSI implementation of combinatorial algorithms", Proceedings Caltech Conference on VLSI, 1979, 509–525.Google Scholar
- [LANG87]Langlois, L., "Parsing (and other dynamic programming problems) on an array of processors", April 1987. Manuscript.Google Scholar
- [RYTT85]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.Google Scholar
- [VALI75]Valiant, L., "General context-free recognition in less than cubic time", Journal of Computer and Systems Sciences, 10:2 (1975), 308–315.Google Scholar