1. A type of Interpreted language. P-code languages are something of a hybrid, falling between compiled languages and interpreted languages in the way they execute. Like an interpreted language, P-code programming is converted to a binary form automatically when it is run, rather than having to be compiled. However, unlike a compiled language the executable binary file is stored in pseudo-code, not machine language. In addition, unlike an Interpreted language, the program does not have to be converted to binary each time it is run. After it is converted to P-code the first time, the pseudo-code version is used for each additional execution. P-code languages (and thus their programs) tend to be slower than compiled languages and programs but faster than interpreted languages, and they generally have authorization to some low-level operating system functions but not direct hardware access. They do not require sometimes-expensive compilers, are often included along with operating systems, and some p-code languages are easier to program than compiled languages. Examples of Pcode languages are Java, Python and REXX/Object REXX. From I-gloss