Abstract
AbstractThe relationship between parameter passing mechanisms and run time data structures in languages with statically‐nested scopes is examined. It is shown that simpler data structures can be used in some cases, with increased efficiency in accessing non‐local variables. In particular it is true for the call‐by‐value‐result mechanism, where the usage of displays can be eliminated altogether; however there is some additional cost associated with procedure calls. Under certain conditions the same implementation applies to call‐by‐reference.
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.
