Content deleted Content added
m →Simple Sethi–Ullman algorithm: Original description was very verbose |
Adding short description: "Algorithm for minimising register usage" |
||
| (4 intermediate revisions by 2 users 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 13 ⟶ 14:
===Example===
For an arithmetic expression <math>a = (b + c + f * g)
=
| |||