Sethi–Ullman algorithm: Difference between revisions

Revision as of 00:13, 18 February 2024

Latest revision as of 15:13, 24 February 2025

(3 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 = y-(ab + d - (ec + f) +* g)*(d+3)</math>, the [[abstract syntax tree]] looks like this:

=