Efficient bytecode generation?

I was wondering if anyone could tell me some good resources which
explain generation of bytecode and a corresponding interpreter for
it. I have defined BNF grammar and have generated the .y and .l file
for it and I am confused on how to approach code generation. What
criteria do I need to consider for writing my own bytecode and
instruction set.


thanks.
[For a software interpreter, you'll probably find that a complex high-level
bytecode is faster than a simple one, since the work in the interpreter
of cracking and dispatching the codes is significant. The simplest way
to start is reverse polish at about the same semantic level as the
source language, since you can usually generate that directly from the
parser. -John]

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