Just-in-time (JIT) compilers are reviewed. They are applied for compiling an interpreted code, that is unknown ahead of execution time, in a binary code. Tendencies of JIT development in a field of interpreted languages are analyzed. Optimization of a compiled code based on trace tree structures is offered. A choice of the LLVM technology for machine codes dumping is grounded. Performance of optimization methods is analyzed.
dynamic just-in-time (JIT) compiler, byte code, trees tracy, control-flow graphs