JF Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on

YR 1997

VO 00

IS

SP 364

TI A new Parallel Algorithm for the Parentheses-Matching Problem

A1 Christophe Cerin,

K1 parallel algorithms on PRAM (Parallel Random Access Machine) model

K1 parentheses-matching problem.

AB The parentheses-matching problem is of crucial importance in the construction of expression tree in order to evaluate, for instance, arithmetic expressions. A new parallel algorithm is introduced in this paper to solve the parentheses-matching problem optimally (in {\cal O}(\log_2 n) parallel time with {\cal O}(n/\log_2 n) processors) on an EREW-PRAM model. An algorithm for an input string of n parentheses with a maximal nested level of \log n is also presented.

PB IEEE Computer Society, [URL:http://www.computer.org]

SN

LA English

DO 10.1109/AISPAS.1997.581700

LK http://doi.ieeecomputersociety.org/10.1109/AISPAS.1997.581700