In the first part of this paper a slow parallel recognizer is described for general CFG’s. The recognizer runs in 𝛩(n³/p(n)) time with p(n) = O(n²) processors. It generalizes the items of the Earley algorithm to double dotted items, which are more suited to parallel parsing. In the second part a fast parallel recognizer is given for general CFG’s. The recognizer runs in O(log n) time using O(n⁶) processors. It is a generalisation of the Gibbons and Rytter algorithm for grammars in CNF.