Perl's current implementation doesn't really have bytecode, at least not in the sense that Java or Python does. Rather, it takes the tree generated by the parser and starts interpreting it directly. In Java or Python, there is another step where the tree is translated to bytecode and then the bytecode is interpreted.
The advantage of interpreting the tree is that the compile phase is fast--you're pretty much done as soon as the parser is finished. However, it also makes it difficult to write the compiler's output to disk--abstract syntax trees are a lot messier than simple bytecode.
Future Perls will be generating bytecode for Parrot.
"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: High Performance Perl
by hardburn
in thread High Performance Perl
by willyyam
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |