Abstract
We present two simpler versions of the log( n) time parallel recognition of unambiguous context-free languages on CREW PRAM's. The first algorithm combines the ideas of the algorithms given in [3] and [7]. The result related to that algorithm is an unambiguous decomposition of trees into smaller ones. The analysis of this algorithm is quite simple. The second algorithm is based on unique paths decomposing trees into smaller subtrees. It has a shorter description and it is simpler to explain how it works. However, its correctness is nontrivial. Both algorithms reduce the numbers of processors by a linear factor in the case of general unambiguous cfl's. For linear unambiguous cfl's the number of processors is reduced to O( n 2) by a very simple algorithm. We show how to remove write conflicts in parallel computations on trees by using two kinds of unique decompositions of trees. Finally we show that our results can be generalized for finitely ambiguous cfl's.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
