Shankar, P
(1990)
*O(log(n)) parallel parsing of a subclass of LL(1) languages.*
In: Proceedings of the International Conference Parallel Computing 89, 29 Aug.-1 Sept. 1989, Leiden, Netherlands, pp. 511-516.

## Abstract

A parallel algorithm that requires O(log(n)) time on O(n) processors on a CREW PRAM, is presented for the parsing of a subclass of the strong LL(1) languages. The technique involves mapping an input string into an output string representing the sequence of changes to the parsing stack during a parse sequence. If the input string is in the language, the output string is a member of the semi-Dyck set with r parenthesis pairs where r is the number of stack symbols. There exists an optimal algorithm for testing membership in this set.

Item Type: | Conference Paper |
---|---|

Additional Information: | Copyright of this article belongs to North-Holland. |

Keywords: | computational complexity;formal languages;grammars;parallel algorithms;parallel programming |

Department/Centre: | Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation) |

Date Deposited: | 28 Jan 2008 |

Last Modified: | 12 Jan 2012 09:21 |

URI: | http://eprints.iisc.ernet.in/id/eprint/11203 |

### Actions (login required)

View Item |