Re: Questions about Bytecode

glen herrmannsfeldt <gah@ugcs.caltech.edu>
25 Apr 2007 04:17:08 -0400

          From comp.compilers
Related articles
[4 earlier articles]
Re: Questions about Bytecode Sean.D.Gillespie@gmail.com (Bison) (2007-04-20)
Re: Questions about Bytecode anton@mips.complang.tuwien.ac.at (2007-04-23)
Re: Questions about Bytecode ajohnson@mathworks.com (Andy Johnson) (2007-04-23)
Re: Questions about Bytecode DrDiettrich1@aol.com (Hans-Peter Diettrich) (2007-04-23)
Re: Questions about Bytecode haberg@math.su.se (2007-04-23)
Re: Questions about Bytecode chris.dollin@hp.com (Chris Dollin) (2007-04-23)
Re: Questions about Bytecode gah@ugcs.caltech.edu (glen herrmannsfeldt) (2007-04-25)
Re: Questions about Bytecode Peter_Flass@Yahoo.com (Peter Flass) (2007-04-26)
Re: Questions about Bytecode cdiggins@gmail.com (Christopher Diggins) (2007-04-26)
Re: Questions about Bytecode cdiggins@gmail.com (Christopher Diggins) (2007-04-26)
| List of all articles for this month |
From: glen herrmannsfeldt <gah@ugcs.caltech.edu>
Newsgroups: comp.compilers
Date: 25 Apr 2007 04:17:08 -0400
Organization: Compilers Central
References: 07-04-06107-04-068 07-04-071 07-04-081
Keywords: interpreter, VM, design
Posted-Date: 25 Apr 2007 04:17:08 EDT

Andy Johnson wrote:
> To answer your question about labels, they aren't implemented in the Java
> bytecode at all. Label points are derived from destinations of branch
> points. If you need to know which bytecodes are reachable via branching,
> you have to synthesize the bytecodes.


I wonder how much easier code verification would be if branch points
had to be specified explicitly.


I am remembering programmable calculators with the LABEL instruction,
which in most cases was done as a linear search through program
memory for a label.


-- glen


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.