Optimal parallel parsing of bracket languages
We prove that the parsing problem for bracket context-free languages can be solved in log(n) time using n/log(n) processors on a parallel random access machine without write conflicts (P-RAM). On the way we develop a new technique for tree compression based on the bracket structure of the tree. It is especially useful when a function is to be computed for all nodes of the tree, because the decompression is easy, while the technique from  is best suited for computing the value associated only with the root.
Unable to display preview. Download preview PDF.
- A.Gibbons, W.Rytter. An optimal parallel algorithm for dynamic expression evaluation and its applications. accepted for Found.of Software Techn.and Theoretical Comp.Science,december (1986), to appear in Lect.Notes in Comp.Science,Springer-Verlag.Google Scholar
- Fortune,S. and Wyllie,J. Parallelism in random access machines, Proceedings of the 10th ACM Symp. Theory of Comp.(1978) 114–118.Google Scholar
- G. Kindervater,J. Lenstra. An introduction to parallelism in combinatorial optimization. Report OS-R8501, Centre for Math.and Comp.Science, Amsterdam (1984)Google Scholar
- R.Mattheyses, and C.M.Fiduccia, Parsing Dyck languages on parallel machines. 20th Allerton Conference on Comm.Control and Computing (1982)Google Scholar
- K. Mehlhorn. Bracket languages are recognizable in logarithmic space. Inf.Proc.Letters 5:6 (1976) 169–170Google Scholar
- W. Ruzzo. On the complexity of general context free language parsing and recognition. Automata, languages and programming. Lect.Notes in Computer Science (1979),pp.489–499Google Scholar
- W.Rytter. On the complexity of parallel parsing of general context-free languages. Accepted for Theoretical Computer ScienceGoogle Scholar
- W. Rytter. On the recognition of context free languages. Computation Theory, Lect.Notes in Comp.Science 208,Springer Verlag (1985),pp.318–325Google Scholar
- W.Rytter. The complexity of two-way pushdown automata and recursive programs. in Combinatorial algorithms on words (ed.A.Apostolico,Z.Galil), Springer-Verlag (1985) 341–356Google Scholar
- W. Rytter. Parallel time log n recognition of unambiguous cfl's. Fund.of Computation Theory, Lect.Notes in Computer Science 199 (1985) 380–389,full version to appear in Inf. and ControlGoogle Scholar