Fast parallel recognition of LR language suffixes
It is shown that suffix recognition for deterministic context-free languages can be done on a PRAM multi-processor within the upper complexity bounds of the graph reachability problem. (C) 2004 Elsevier B.V. All rights reserved.
computational complexity parallel algorithms programming languages