Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Sethi-Ullman Algorithm
CHF 43.10
Auf Lager
SKU
6D4VL6V9VBB
1 Verfügbar 
Geliefert zwischen Mo., 26.01.2026 und Di., 27.01.2026
Details
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.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131159336
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131159336
- Format Fachbuch
- Titel Sethi-Ullman Algorithm
- Herausgeber Betascript Publishing
- Anzahl Seiten 76
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
