Content deleted Content added
Sethi-Ullman makes no guarantee as to instruction count. It provides code with a minimal number of registers used. |
Niceguyedc (talk | contribs) m WPCleaner v1.34 - Repaired 1 link to disambiguation page - (You can help) - Registers |
||
Line 1:
In [[computer science]], the '''Sethi–Ullman algorithm''' is an [[algorithm]] named after [[Ravi Sethi]] and [[Jeffrey D. Ullman]], its inventors, for translating [[abstract syntax tree]]s into [[machine code]] that uses as few [[Processor register|registers]] as possible.
==Overview==
| |||