20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Sethi-Ullman Algorithm: Code Generation, Compiler, Commutativit, Associativity -

English
2026-03-15
€156.58 €195.73

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

High Quality Content by WIKIPEDIA articles! When generating code for arithmetic expressions, the compiler has to decide which is the best way to translate the expression in terms of number of instructions used as well as number of registers needed to evaluate a certain subtree (especially if free registers are scarce). The Sethi-Ullman algorithm (also known as Sethi-Ullman numbering) fulfills the property o ... Full description

You May Also Like

Description

High Quality Content by WIKIPEDIA articles! When generating code for arithmetic expressions, the compiler has to decide which is the best way to translate the expression in terms of number of instructions used as well as number of registers needed to evaluate a certain subtree (especially if free registers are scarce). The Sethi-Ullman algorithm (also known as Sethi-Ullman numbering) fulfills the property of producing code which needs the least number of instructions possible as well as the least number of storage references (under the assumption that at the most commutativity and associativity apply to the operators used, but distributive laws i.e. a * b + a * c = a * (b + c) do not hold). Please note that the algorithm succeeds as well if neither commutativity nor associativity hold for the expressions used, and therefore arithmetic transformations can not be applied.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786131159336
Write Your Own Review
You're reviewing: Sethi-Ullman Algorithm: Code Generation, Compiler, Commutativit, Associativity
Your Rating:

Goodreads Reviews

€156.58 €195.73