Parallel Generation of Postfix and Tree Forms

DOI10.1145/2166.357211MaRDI QIDQ3038609zbMATH OpenOpenAlexFDO

Authors Eliezer Dekel, Sartaj 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

zbMATH Keywords

efficient parallel algorithmsevaluation of arithmetic expressionsinfix arithmetic expressionparallel computingparallel parsingshared memory model

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Theory of operating systems (68N25) Algorithms in computer science (68W99)

Cited in

(4)

• Parallel parsing of programming languages
• Optimal parallel algorithms for forest and term matching
• Matching parentheses in parallel
• Almost fully-parallel parentheses matching

This page was built for publication: Parallel Generation of Postfix and Tree Forms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3038609)