Parallel Parsing of Arithmetic Expressions

Parallel algorithms for parsing expressions on mesh, shuffle, cube, and cube-connected cycle parallel computers are presented. With n processors, it requires $O(\sqrt{n})$ time on the mesh-connected model and $O(log^2 n)$ time on others. For the mesh-connected computer, the author uses a wrap-around row-major ordering. For the shuffle computer, he uses an extra connection between adjacent processors, and thus four connections per processor are require