Abstract
An algorithm to solve the “reaching definitions” problem on reducible flow graphs is presented. It is based on the concept of a region of a flow graph, and has the worst-case time bound of O(n2) bit-vector operations. The algorithm is compared for time complexity with the well-known round-robin version of the iterative algorithm. The comparison shows that for every flow graph of n>2 nodes the region analysis algorithm for the “reaching definitions” problem requires in the worst case fewer bit-vector operations than the round-robin version of the iterative algorithm for the same problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
