Juan Alberto de Frutos Velasco wrote:>> I'm looking for works about alternatives for java byte-codes used by> java.>> More precisely, I'd like to study the advantages of using structures> like AST (abstract syntax tree).

I'd suggest starting with the work of Michael Franz and Thomas Kistler.

http://www.ics.uci.edu/~franz/ is Franz's homepage, and there you'll
find links to his work on semantic dictionary encoding of asts using a
lzw type algorithm, and subsequent run time code generation from them.

He originally applied these ideas to a Oberon system (he did his Phd
under Wirth).
Check out the slim binary link off his homepage.

With Kistler, Franz is working on a language called Juice that uses this
approach as well.

Juice's distribution format, on the other hand, is far more complex. It
is based on a tree-shaped program representation as is typically used
transiently within optimizing compilers. Rather than containing a linear
code-sequence that can be interpreted byte-by-byte, a Juice-encoded
applet contains a compressed tree that describes the actions of the
original program. The tree preserves the control-flow structure of the
original
program, which makes it much easier to perform code optimization while
the tree is translated into the native instruction set of the target
machine.