The Generation of Optimal Code for Arithmetic Expressions

DOI10.1145/321607.321620zbMath0212.18802OpenAlexW2024598204WikidataQ56446033 ScholiaQ56446033MaRDI QIDQ5613555

Ravi Sethi, Jeffrey D. Ullman

Publication date: 1970

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321607.321620

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Theory of operating systems (68N25)

Related Items

Optimal contiguous expression DAG evaluations ⋮ Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP ⋮ TSFC: A Structure-Preserving Form Compiler ⋮ Unnamed Item ⋮ Scheduling series-parallel task graphs to minimize peak memory ⋮ Minimizing I/Os in Out-of-Core Task Tree Scheduling ⋮ Automata for the verification of monadic second-order graph properties ⋮ Typical sequences revisited -- computing width parameters of graphs ⋮ Unnamed Item ⋮ Uniform random generation of expressions respecting algebraic identities ⋮ On the Sethi-Ullman algorithm ⋮ Unnamed Item ⋮ DNA-templated synthesis optimization ⋮ Unnamed Item ⋮ Speicheroptimale Formelübersetzung ⋮ Unnamed Item ⋮ Memory-optimal evaluation of expression trees involving large objects ⋮ The average number of registers needed to evaluate a binary tree optimally ⋮ The number of registers required for evaluating arithmetic expressions ⋮ Generalizations of the sethi‐ullman algorithm for register allocation ⋮ The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs ⋮ Complexity of optimal vector code generation