Abstract
AbstractMost APL systems delay all parsing until run‐time. Because the APL expression language is inherently ambiguous and because identifier binding is delayed until run‐time, some runtime parsing is shown to be necessary. Nevertheless we argue that most APL statement parsing can be done at entry‐time and that there are several reasons for doing so. Then a technique is described whereby APL statements are partially parsed at entry‐time and are parse completed at run‐time.
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 callSimilar 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.
