Related articles |
---|
info on byte-coded and other fast interpreters ham@Neon.Stanford.EDU (1991-03-16) |
Re: info on byte-coded and other fast interpreters bremner@cs.sfu.ca (1991-03-19) |
Re: info on byte-coded and other fast interpreters acha@CS.CMU.EDU (1991-03-19) |
Re: info on byte-coded and other fast interpreters oz@nexus.yorku.ca (1991-03-19) |
Re: info on byte-coded and other fast interpreters andrew@brownvm.brown.edu (1991-03-20) |
Re: info on byte-coded and other fast interpreters adrianho@barkley.Berkeley.EDU (Adrian J Ho) (1991-03-21) |
Re: info on byte-coded and other fast interpreters eliot@cs.qmw.ac.uk (Eliot Miranda) (1991-03-24) |
[1 later articles] |
Newsgroups: | comp.compilers |
From: | ham@Neon.Stanford.EDU (Peter R. Ham) |
Keywords: | interpreter, question |
Organization: | Stanford University |
Distribution: | comp |
Date: | 16 Mar 91 10:23:36 |
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]
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.