Revision as of 17:56, 11 February 2014 edit Davew haverford (talk \| contribs) 78 edits Red Dragon Book, page 566. ← Previous edit		Revision as of 06:32, 30 December 2014 edit undo Chrisfeilbach (talk \| contribs) 22 edits Sethi-Ullman makes no guarantee as to instruction count. It provides code with a minimal number of registers used. Next edit →
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 ~~instructions~~[[registers]] as possible. ==Overview==

Sethi–Ullman algorithm: Difference between revisions