Parallel time O(log n) recognition of unambiguous context-free languages (Q1096400)

We prove that every unambiguous context-free language can be recognized in O(log n) time on a parallel random access machine without write conflicts (P-RAM) using a polynomial number of processors. This strengthens the result of \textit{J. Reif} [Proc. 23rd IEEE Symp. Found. Comput., 114-118 (1982)], who proved that every deterministic context- free language can be recognized on a P-RAM in O(log n) time.