Content deleted Content added
destubified; is longer than a stub |
Removed cyclic redierect |
||
Line 1:
When [[Code_generation|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 so called '''Sethi-Ullman algorithm''' (also known as
==Simple Sethi-Ullman algorithm==
|