Abstract
Abstract : Many non-specialists are intimidated by the mathematical appearance of most applicative, functional, and very-high-level languages. This report presents a simple notation that has an unintimidating, natural-language appearance and that can be adapted to a variety of languages. The paper demonstrates its use as an alternate syntax for LISP, PROLOG, Backus' FP, relational programming, and relational database retrievals. The grammar's eight productions can be handled by a simple recursive-descent parser. (Author)
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.
