Parallel Generation of Postfix and Tree Forms
From MaRDI portal
Publication:3038609
DOI10.1145/2166.357211zbMath0525.68017OpenAlexW2065890574MaRDI 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 computingefficient parallel algorithmsparallel parsingshared memory modelevaluation of arithmetic expressionsinfix arithmetic expression
Theory of compilers and interpreters (68N20) Theory of operating systems (68N25) Algorithms in computer science (68W99)
Related Items
Almost fully-parallel parentheses matching, Parallel parsing of programming languages, Optimal parallel algorithms for forest and term matching, Matching parentheses in parallel