1 votes 1 votes The minimum number of registers required by an optimal code generation algorithm (intermediate results can be stored in memory). And if possible solve it using Sethi-Ullman Algorithm. Compiler Design compiler-design code-generation made-easy-test-series numerical-answers + – Ajit J asked Dec 6, 2018 • retagged Aug 1, 2022 by Shubham Sharma 2 Ajit J 1.6k views answer comment Share Follow See all 25 Comments See all 25 25 Comments reply Show 22 previous comments Shubhgupta commented Jan 8, 2019 reply Follow Share in that question its clearly mentioned that you can not store intermediate result in memory but in this question you can store result in memory whenever required(spilling). 1 votes 1 votes srestha commented Jan 8, 2019 reply Follow Share @Shubhgupta I think t need filling, not spilling 0 votes 0 votes Deepanshu commented Jan 30, 2019 reply Follow Share in a nutshell here without spilling we need 4 registers here and with spilling 2 okkk.... 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 4 register needed. GovindYadav29 answered Dec 9, 2022 GovindYadav29 comment Share Follow See all 3 Comments See all 3 3 Comments reply shikhar500 commented Dec 9, 2022 reply Follow Share @GovindYadav29 any standard resource to study this topic ? 0 votes 0 votes Shaikh727 commented Dec 16, 2022 reply Follow Share Please explain using Sethi Ullman 0 votes 0 votes GovindYadav29 commented Dec 23, 2022 reply Follow Share @shikhar500 bro just once you go through spilling and filling of registers,then this topic can easily be understood. For that you can follow GFG . https://www.geeksforgeeks.org/what-is-spilling/ 1 votes 1 votes Please log in or register to add a comment.