Sethi–Ullman algorithm: Difference between revisions

Content deleted Content added

Revision as of 00:14, 18 February 2024 edit 216.223.104.116 (talk) →Example ← Previous edit		Latest revision as of 15:13, 24 February 2025 edit undo Liu1126 (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 12,270 edits Adding short description: "Algorithm for minimising register usage" Tag: Shortdesc helper
(2 intermediate revisions 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.