Polylogarithmic parallel parsing
Year: 1992
Type: report
Abstract: The Bird-Meertens theory of lists and two theorems by Bird are used to develop associative operators for parsing. The theorems guarantee the existence of an associative operator for computing a function if right and left directed reductions meeting certain criteria are known that compute the same function. Such reductions are found for several classes of grammars derived from known sequential grammar classes, resulting in several new parallel parsing algorithms that use associative operators. The algorithms for parsing regular languages and Dyck languages in parallel are recast using associative operators. A new parallel algorithm for parsing simple precedence languages is described. A parallel parsing algorithm for languages in LR(1)$\cap$RL(1) is described. A new class of languages, the P(k) languages, and their associated grammars are defined. An algorithm for parsing P(k) languages that runs in $O(log\sp2 N)$ time using O(N) processors (where N is the size of the input) is described.
Author: James P. Schmeiser
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W183281300
