Abstract
AbstractLoops must often be forced to terminate early. Solutions to such problems are usually either language‐dependent or rather clumsy. A practical alternative is presented. The accompanying methodology clarifies the role of the finalization mechanism in loop construction. It also leads to the idea of control‐structure independence in the context of data representation and forced termination.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
Disclaimer: 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.