On the complexity of parallel parsing of general context-free languages
Let T(n) be the time to recognize context-free languages on a parallel random-access machine without write conflicts (P-RAM) using a polynomial number of processors. We assume that \(T(n)=\Omega (\log n)\). Let P(n) be the time to compute a representation of a parsing tree for strings of length n using a polynomial number of processors. Then we prove \(P(n)=O(T(n))\). A related result is a parallel time log n computation of the transitive closure of directed graphs having special structure.
scientific article; zbMATH DE number 4028937