Related articles |
---|
Dynamic Evaluation & Precompiled Bytecode acampbellb@hotmail.com (Avatar) (2006-02-11) |
Re: Dynamic Evaluation & Precompiled Bytecode anton@mips.complang.tuwien.ac.at (2006-02-11) |
Re: Dynamic Evaluation & Precompiled Bytecode eliotm@pacbell.net (Eliot Miranda) (2006-03-05) |
From: | "Avatar" <acampbellb@hotmail.com> |
Newsgroups: | comp.compilers |
Date: | 11 Feb 2006 14:04:15 -0500 |
Organization: | http://groups.google.com |
Keywords: | interpreter, question, comment |
Posted-Date: | 11 Feb 2006 14:04:15 EST |
I am researching the development of a dynamic language similar in many
respects to popular "scripting" languages like perl, python, and ruby.
The high-level language should be compiled to bytecode which is then
executed within a VM.
The language should alos support dynamic code evaluation which would
necessitate on-the-fly compilation into bytecode. Is it possible for a
dynamic language to support both forms of generated bytecode?
My specific question has to do with the representation of symbolic
information within precompiled versus on-the-fly compiled bytecode. If
a program is precompiled into bytecode and symbolic information (ie.
variable names) is encoded into the precompiled bytecode... How can
dynamically compiled bytecode that may reference some of those same
symbols (ie. variables) be accurately resolved?
Any thoughts or information would be greatly appreciated.
[It's the same as any time you want to do dynamic linking. You store a
symbol table along with the stuff you want to link to. -John
Return to the
comp.compilers page.
Search the
comp.compilers archives again.