Parallel Generation of Postfix and Tree Forms
From MaRDI portal
Publication:3038609
DOI10.1145/2166.357211zbMath0525.68017MaRDI QIDQ3038609
Eliezer Dekel, Sartaj K. Sahni
Publication date: 1983
Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2166.357211
parallel computing; efficient parallel algorithms; parallel parsing; shared memory model; evaluation of arithmetic expressions; infix arithmetic expression
68N20: Theory of compilers and interpreters
68N25: Theory of operating systems
68W99: Algorithms in computer science
Related Items
Parallel parsing of programming languages, Optimal parallel algorithms for forest and term matching, Matching parentheses in parallel, Almost fully-parallel parentheses matching