Content deleted Content added
m Moving Category:Graph algorithms to Category:Algorithms in graph theory per Wikipedia:Categories for discussion/Log/2024 October 4#Category:Graph algorithms Tag: Reverted |
Adding short description: "Algorithm for minimising register usage" |
||
| (One intermediate revision by one other user not shown) | |||
Line 1:
{{Short description|Algorithm for minimising register usage}}
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.
Line 65 ⟶ 66:
{{DEFAULTSORT:Sethi-Ullman algorithm}}
[[Category:Compiler construction]]
[[Category:
| |||