Sethi–Ullman algorithm
In computer science, the Sethi–Ullman algorithm is an algorithm named after Ravi Sethi and Jeffrey D. Ullman, its inventors, for translating abstract syntax trees into machine code that uses as few registers as possible.
- Comment
- enIn computer science, the Sethi–Ullman algorithm is an algorithm named after Ravi Sethi and Jeffrey D. Ullman, its inventors, for translating abstract syntax trees into machine code that uses as few registers as possible.
- Has abstract
- enIn computer science, the Sethi–Ullman algorithm is an algorithm named after Ravi Sethi and Jeffrey D. Ullman, its inventors, for translating abstract syntax trees into machine code that uses as few registers as possible.
- Hypernym
- Algorithm
- Is primary topic of
- Sethi–Ullman algorithm
- Label
- enSethi–Ullman algorithm
- Link from a Wikipage to an external page
- lambda.uta.edu/cse5317/fall02/notes/node40.html
- Link from a Wikipage to another Wikipage
- Abstract syntax tree
- Algorithm
- Associativity
- Category:Compiler construction
- Category:Graph algorithms
- Code generation (compiler)
- Commutativity
- Compiler
- Computer science
- Ershov Number
- Jeffrey D. Ullman
- Journal of the Association for Computing Machinery
- Machine code
- Order of evaluation
- Processor register
- Ravi Sethi
- Register allocation
- Register spilling
- store architecture
- Strahler number
- SameAs
- 4ntVr
- Algorytm Sethi-Ullmana
- m.03y13s
- Q6141454
- Алгоритм Сети — Ульмана
- Сети-Улманов алгоритам
- الگوریتم سثی-اولمن
- セシィ–ウルマン法
- Subject
- Category:Compiler construction
- Category:Graph algorithms
- WasDerivedFrom
- Sethi–Ullman algorithm?oldid=1086665290&ns=0
- WikiPageLength
- 6415
- Wikipage page ID
- 999491
- Wikipage revision ID
- 1086665290
- WikiPageUsesTemplate
- Template:Citation