Take the tree Perl normally uses, make it into bytecode, and then load it back into a tree for Perl to use later. They don't have anything to do with how Perl runs the program internally. Notice that it doesn't work very well for any non-trivial code, and you aren't gaining anything except shaving off the compile-time.
"There is no shame in being self-taught, only in not trying to learn in the first place." -- Atrus, Myst: The Book of D'ni.
In reply to Re^3: High Performance Perl
by hardburn
in thread High Performance Perl
by willyyam
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |