Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!think.com!mintaka!spdcc!iecc!compilers-sender From: ham@Neon.Stanford.EDU (Peter R. Ham) Newsgroups: comp.compilers Subject: info on byte-coded and other fast interpreters Keywords: interpreter, question Message-ID: Date: 16 Mar 91 15:23:36 GMT Sender: compilers-sender@iecc.cambridge.ma.us Reply-To: ham@Neon.Stanford.EDU (Peter R. Ham) Distribution: comp Organization: Stanford University Lines: 14 Approved: compilers@iecc.cambridge.ma.us I'm still looking for some papers/sample implementations of bytecoded interpreters or other fast interpreters (don't want to compile to machine code), especially for extension languages. Already, I know of: emacs lisp xscheme fool's lisp Peter -- [Don't forget Pascal P-code, various PDP-11 threaded Fortran codes, and the SNOBOL4 macro/bytecode implementation. -John] -- Send compilers articles to compilers@iecc.cambridge.ma.us or {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.