A new parallel algorithm for parsing arithmetic infix expressions

DOI10.1016/0167-8191(87)90028-7zbMath0641.68121OpenAlexW2009038132MaRDI QIDQ1100920

Y. N. Srikant, Priti Shankar

Publication date: 1987

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(87)90028-7

zbMATH Keywords

time complexityparallel programmingSIMD computerarithmetic infix expressionparallel code generationparallel parsing algorithmparse tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of compilers and interpreters (68N20) Theory of operating systems (68N25)

Related Items

Almost fully-parallel parentheses matching, Parallel parsing of programming languages, A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation