Abstract
Efficient parallel algorithms for some parsing problems are presented. These problems include the parsing of linear context-free languages, languages accepted by nondeterministic one-counter automata, and transductions defined by a special class of two-tape nondeterministic finite-state transducers. The model of parallel computation is a one-way linear array of identical finite-state machines. The data movement in the array is one-way, from left to right. For inputs of length n, the array uses n nodes, but the design of the node (finite-state machine) is independent of n. Our algorithms can actually produce a parse, i.e., a sequence of rules (moves) that generates (accepts) an input, in linear time. When only a no/yes answer is required, the parsing problem becomes a recognition problem. The best serial (RAM) algorithms for the corresponding recognition problems take O(n2/log2n) time and space. Previous parallel algorithms for the recognition problems run in linear time on a one-way linear array of finite-state machines.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
(Extended Abstract).
This research was 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
Culik II, K., J. Gruska and A. Salomaa, Systolic trellis automata, Internat. J. Comput. Math. 16-1, (1984), pp. 3–22.
Ginsburg, S. and G. Rose, The equivalence of stack counter accepters and quasi-realtime acceptors, J. of Computer and System Sciences 8, (1974), pp. 243–269.
Greibach, S., A note on the recognition of one counter languages, R.A.I.R.O., (1975), pp. 5–12.
Graham, S. and M. Harrison, Parsing of general context-free languages, Advances in Computers, 14, Academic Press, NY, (1976), pp. 77–185.
Hirschberg, D., A linear space algorithm for computing maximal common sequences, Communication of ACM 18-6, (1975), pp. 341–343.
Ibarra, O., M. Palis, and J. Chang, On efficient recognition of transductions and relations, Theoretical Computer Science 39, (1984), pp. 89–106.
Ibarra, O., M. Palis, and S. Kim, Some results concerning linear iterative (systolic) arrays, Journal of Parallel and Distributed Computing 2, (1985), pp. 182–218.
Ibarra, O., S. Kim, and M. Palis, Designing systolic algorithms using sequential machines, IEEE Trans. on Comput. 35-6, (1986), pp. 531–542.
Ibarra, O. and M. Palis, VLSI algorithms for solving recurrence equations and applications, IEEE Trans. on Acoust., Speech, and Signal Process. 35-7, (1987), pp. 1046–1064.
Kung, H. and M. Lam, Fault-tolerance and two level pipelining in VLSI systolic arrays, Proc. 1984 Conference on Advanced Research in VLSI, M.I.T, (ed. Paul Penfield, Jr.), pp. 74–83.
Savage, C. and M. Stallmann, Decomposability and fault-tolerance in one-dimensional array algorithms, (1987), in preparation.
Van Leeuwen, J. and M. Nivat, Efficient recognition of rational relations, Inform. Processing Lett., 14, (1982), pp. 34–38.
Younger, D., Recognition and parsing of context-free languages in time n3, Information and Control 10, (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., Jiang, T., Wang, H. (1989). Parallel parsing on a one-way linear array of finite-state machines. In: Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1989. Lecture Notes in Computer Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52048-1_51
Download citation
DOI: https://doi.org/10.1007/3-540-52048-1_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52048-1
Online ISBN: 978-3-540-46872-1
eBook Packages: Springer Book Archive