The interests in parallel processing raise the question of how to use multiple processors efficiently at compile time. In this paper we present a parallel operator-precedence parsing algorithm. The speedup of our algorithm is also estimated. The results show that performing operator-precedence parsing in parallel is encouraging.

Keywords: compiling, parallel and distributed computing, parsing

Received September 1, 1988; revised July 21, 1989.
Communicated by Lin-Shan Lee.