From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-0.8 required=5.0 tests=BAYES_00,INVALID_DATE autolearn=no autolearn_force=no version=3.4.4 Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.3 4.3bsd-beta 6/6/85; site ucbvax.BERKELEY.EDU Path: utzoo!watmath!clyde!burl!ulysses!ucbvax!JPL-VLSI.ARPA!larry From: larry@JPL-VLSI.ARPA Newsgroups: net.lang.ada Subject: Ada EMACS Message-ID: <8605230053.AA26778@ucbvax.Berkeley.EDU> Date: Thu, 22-May-86 18:14:58 EDT Article-I.D.: ucbvax.8605230053.AA26778 Posted: Thu May 22 18:14:58 1986 Date-Received: Sat, 24-May-86 21:41:32 EDT Sender: daemon@ucbvax.BERKELEY.EDU Organization: The ARPA Internet List-Id: Thanks to all those who answered my question about dynmamic rebinding of key-strings to functions. To answer several questions: I'm using several versions of EMACS as guides, trying to factor out the useful approaches that I can translate to Ada. When I get a reasonably working version I'll make it public. The first one will be a minimal version very similar to David Conroy's MicroEMACS. It will compile and run under both DEC Ada and Alsys IBM PC Ada. A later version will resemble GNU EMACS, but I anticipate making one major change. Rather than providing LisP to extend the core program, I'll use Ada. I foresee using two approaches: a very simple subset interpreter built in, and a procedure to simplify compiling and linking new commands into the object code. I've named this Ada version of EMACS Aemacs. (Pronounced emacs.) Please don't use this name for anything else or I promise a horrible retaliation. I'll name my program LOVE (Larry's Own Version of Emacs). Larry @ jpl-vlsi.arpa