Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Interpreter (computing)
open-in-new
<h2 id="history">History</h2> <p>Interpreters were used as early as 1952 to ease programming within the limitations of computers at the time (e.g. a shortage of program storage space, or no native support for floating point numbers). Interpreters were also used to translate between low-level machine languages, allowing code to be written for machines that were still under construction and tested on computers that already existed.<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a> The first interpreted high-level language was <a href="/facts/Lisp_(programming_language)/xJHA3CrX">Lisp</a>. Lisp was first implemented by <a href="/facts/Steve_Russell_(computer_scientist)/gVNlFx9j">Steve Russell</a> on an <a href="/facts/IBM_704/bKkwXYb3">IBM 704</a> computer. Russell had read <a href="/facts/John_McCarthy_(computer_scientist)/ajKU4SdD">John McCarthy</a>'s paper, "Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I", and realized (to McCarthy's surprise) that the Lisp <i>eval</i> function could be implemented in machine code.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a> The result was a working Lisp interpreter which could be used to run Lisp programs, or more properly, "evaluate Lisp expressions". </p><p>The development of editing interpreters was influenced by the need for interactive computing. In the 1960s, the introduction of time-sharing systems allowed multiple users to access a computer simultaneously, and editing interpreters became essential for managing and modifying code in real-time. The first editing interpreters were likely developed for mainframe computers, where they were used to create and modify programs on the fly. One of the earliest examples of an editing interpreter is the EDT (Editor and Debugger for the TECO) system, which was developed in the late 1960s for the PDP-1 computer. EDT allowed users to edit and debug programs using a combination of commands and macros, paving the way for modern text editors and interactive development environments. </p> <h2 id="general-operation">General operation</h2> <p>An interpreter usually consists of a set of known <a href="/facts/Command_(computing)/zUrvQbFy">commands</a> it can <a href="/facts/Execution_(computing)/1fyfGMFm">execute</a>, and a list of these commands in the order a programmer wishes to execute them. Each command (also known as an <a href="/facts/Instruction_(computer_science)/8p8vwUeE">Instruction</a>) contains the data the programmer wants to mutate, and information on how to mutate the data. For example, an interpreter might read ADD Books, 5 and <i>interpret</i> it as a request to add five to the Books <a href="/facts/Variable_(computer_science)/VoCKtwml">variable</a>. </p><p>Interpreters have a wide variety of instructions which are specialized to perform different tasks, but you will commonly find interpreter instructions for basic <a href="/facts/Operation_(mathematics)/Yplv602Q">mathematical operations</a>, <a href="/facts/Branch_(computer_science)/obBGrnor">branching</a>, and <a href="/facts/Memory_management/vthLkUpz">memory management</a>, making most interpreters <a href="/facts/Turing_completeness/73goop44">Turing complete</a>. Many interpreters are also closely integrated with a <a href="/facts/Garbage_collection_(computer_science)/j2vlIu7g">garbage collector</a> and <a href="/facts/Debugger/mCe6UsWj">debugger</a>. </p> <h2 id="compilers-versus-interpreters">Compilers versus interpreters</h2> <p>Programs written in a <a href="/facts/High-level_language/smjECUhx">high-level language</a> are either directly executed by some kind of interpreter or converted into <a href="/facts/Machine_code/bgdQ1Fxf">machine code</a> by a compiler (and <a href="/facts/Assembler_(computing)/7XuV0cla">assembler</a> and <a href="/facts/Linker_(computing)/pn1hztYe">linker</a>) for the <a href="/facts/CPU/Jxp1bqMV">CPU</a> to execute. </p><p>While compilers (and assemblers) generally produce machine code directly executable by computer hardware, they can often (optionally) produce an intermediate form called <a href="/facts/Object_code/Sht3h4lW">object code</a>. This is basically the same machine specific code but augmented with a <a href="/facts/Symbol_table/ILc0WE9u">symbol table</a> with names and tags to make executable blocks (or modules) identifiable and relocatable. Compiled programs will typically use building blocks (functions) kept in a library of such object code modules. A <a href="/facts/Linker_(computing)/pn1hztYe">linker</a> is used to combine (pre-made) library files with the object file(s) of the application to form a single executable file. The object files that are used to generate an executable file are thus often produced at different times, and sometimes even by different languages (capable of generating the same object format). </p><p>A simple interpreter written in a low-level language (e.g. <a href="/facts/Assembly_language/7XuV0cla">assembly</a>) may have similar machine code blocks implementing functions of the high-level language stored, and executed when a function's entry in a look up table points to that code. However, an interpreter written in a high-level language typically uses another approach, such as generating and then walking a <a href="/facts/Parse_tree/FeBEtXcz">parse tree</a>, or by generating and executing intermediate software-defined instructions, or both. </p><p>Thus, both compilers and interpreters generally turn source code (text files) into tokens, both may (or may not) generate a parse tree, and both may generate immediate instructions (for a <a href="/facts/Stack_machine/IBtk4NRA">stack machine</a>, <a href="/facts/Three-address_code/q8Loz34Y">quadruple code</a>, or by other means). The basic difference is that a compiler system, including a (built in or separate) linker, generates a stand-alone <i>machine code</i> program, while an interpreter system instead <i>performs</i> the actions described by the high-level program. </p><p>A compiler can thus make almost all the conversions from source code semantics to the machine level once and for all (i.e. until the program has to be changed) while an interpreter has to do <i>some</i> of this conversion work every time a statement or function is executed. However, in an efficient interpreter, much of the translation work (including analysis of types, and similar) is factored out and done only the first time a program, module, function, or even statement, is run, thus quite akin to how a compiler works. However, a compiled program still runs much faster, under most circumstances, in part because compilers are designed to optimize code, and may be given ample time for this. This is especially true for simpler high-level languages without (many) dynamic data structures, checks, or <a href="/facts/Type_checking/Tz0bAMS9">type checking</a>. </p><p>In traditional compilation, the executable output of the <a href="/facts/Linker_(computing)/pn1hztYe">linkers</a> (.exe files or .dll files or a library, see picture) is typically relocatable when run under a general operating system, much like the object code modules are but with the difference that this relocation is done dynamically at run time, i.e. when the program is loaded for execution. On the other hand, compiled and linked programs for small <a href="/facts/Embedded_systems/a4muX1wU">embedded systems</a> are typically statically allocated, often hard coded in a <a href="/facts/NOR_flash/Cn8JsStx">NOR flash</a> memory, as there is often no secondary storage and no operating system in this sense. </p><p>Historically, most interpreter systems have had a self-contained editor built in. This is becoming more common also for compilers (then often called an <a href="/facts/Integrated_development_environment/jbEINSQf">IDE</a>), although some programmers prefer to use an editor of their choice and run the compiler, linker and other tools manually. Historically, compilers predate interpreters because hardware at that time could not support both the interpreter and interpreted code and the typical batch environment of the time limited the advantages of interpretation.<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a> </p> <h3>Development cycle</h3> <p>During the <a href="/facts/Software_development_cycle/cIDtuNPN">software development cycle</a>, programmers make frequent changes to source code. When using a compiler, each time a change is made to the source code, they must wait for the compiler to translate the altered source files and <a href="/facts/Linker_(computing)/pn1hztYe">link</a> all of the binary code files together before the program can be executed. The larger the program, the longer the wait. By contrast, a programmer using an interpreter does a lot less waiting, as the interpreter usually just needs to translate the code being worked on to an intermediate representation (or not translate it at all), thus requiring much less time before the changes can be tested. Effects are evident upon saving the source code and reloading the program. Compiled code is generally less readily debugged as editing, compiling, and linking are sequential processes that have to be conducted in the proper sequence with a proper set of commands. For this reason, many compilers also have an executive aid, known as a <a href="/facts/Make_(software)/5q1DQ4ot">Makefile</a> and program. The Makefile lists compiler and linker command lines and program source code files, but might take a simple command line menu input (e.g. "Make 3") which selects the third group (set) of instructions then issues the commands to the compiler, and linker feeding the specified source code files. </p> <h3>Distribution</h3> <p>A <a href="/facts/Compiler/WNfCDFJe">compiler</a> converts source code into binary instruction for a specific processor's architecture, thus making it less <a href="/facts/Software_portability/tWKVGCBb">portable</a>. This conversion is made just once, on the developer's environment, and after that the same binary can be distributed to the user's machines where it can be executed without further translation. A <a href="/facts/Cross_compiler/8hXgCWB9">cross compiler</a> can generate binary code for the user machine even if it has a different processor than the machine where the code is compiled. </p><p>An interpreted program can be distributed as source code. It needs to be translated in each final machine, which takes more time but makes the program distribution independent of the machine's architecture. However, the portability of interpreted source code is dependent on the target machine actually having a suitable interpreter. If the interpreter needs to be supplied along with the source, the overall installation process is more complex than delivery of a monolithic executable, since the interpreter itself is part of what needs to be installed. </p><p>The fact that interpreted code can easily be read and copied by humans can be of concern from the point of view of <a href="/facts/Copyright/7GHEWEx9">copyright</a>. However, various systems of <a href="/facts/Encryption/16q29Fdv">encryption</a> and <a href="/facts/Obfuscation/4HXs1ICy">obfuscation</a> exist. Delivery of intermediate code, such as bytecode, has a similar effect to obfuscation, but bytecode could be decoded with a <a href="/facts/Decompiler/Lz46oVoa">decompiler</a> or <a href="/facts/Disassembler/4PR39BbK">disassembler</a>. </p> <h3>Efficiency</h3> <p>The main disadvantage of interpreters is that an interpreted program typically runs more slowly than if it had been <a href="/facts/Compiler/WNfCDFJe">compiled</a>. The difference in speeds could be tiny or great; often an order of magnitude and sometimes more. It generally takes longer to run a program under an interpreter than to run the compiled code but it can take less time to interpret it than the total time required to compile and run it. This is especially important when prototyping and testing code when an edit-interpret-debug cycle can often be much shorter than an edit-compile-run-debug cycle.<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a><a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a> </p><p>Interpreting code is slower than running the compiled code because the interpreter must analyze each <a href="/facts/Statement_(computer_science)/bEkBufqX">statement</a> in the program each time it is executed and then perform the desired action, whereas the compiled code just performs the action within a fixed context determined by the compilation. This <a href="/facts/Run_time_(program_lifecycle_phase)/lCxKsrzB">run-time</a> analysis is known as "interpretive overhead". Access to variables is also slower in an interpreter because the mapping of identifiers to storage locations must be done repeatedly at run-time rather than at <a href="/facts/Compile_time/yCdI3oqn">compile time</a>.<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a> </p><p>There are various compromises between the development speed when using an interpreter and the execution speed when using a compiler. Some systems (such as some <a href="/facts/Lisp_(programming_language)/xJHA3CrX">Lisps</a>) allow interpreted and compiled code to call each other and to share variables. This means that once a routine has been tested and debugged under the interpreter it can be compiled and thus benefit from faster execution while other routines are being developed. Many interpreters do not execute the source code as it stands but convert it into some more compact internal form. Many <a href="/facts/BASIC/VYMl5TmA">BASIC</a> interpreters replace <a href="/facts/Keyword_(computer_programming)/pHDlUUgY">keywords</a> with single <a href="/facts/Byte/BNHUp9Qq">byte</a> <a href="/facts/Token_threading/RwL3h6DJ">tokens</a> which can be used to find the instruction in a <a href="/facts/Jump_table/LcfPVyQS">jump table</a>.<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a> A few interpreters, such as the <a href="/facts/PBASIC/eJofIYuq">PBASIC</a> interpreter, achieve even higher levels of program compaction by using a bit-oriented rather than a byte-oriented program memory structure, where commands tokens occupy perhaps 5 bits, nominally "16-bit" constants are stored in a <a href="/facts/Variable-length_code/DImYG6eg">variable-length code</a> requiring 3, 6, 10, or 18 bits, and address operands include a "bit offset". Many BASIC interpreters can store and read back their own tokenized internal representation. </p> <table><tbody><tr><th>Toy <a href="/facts/C_(programming_language)/Ky2No763">C</a> expression interpreter</th></tr><tr><td>// data types for abstract syntax treeenum _kind { kVar, kConst, kSum, kDiff, kMult, kDiv, kPlus, kMinus, kNot };struct _variable { int *memory; };struct _constant { int value; };struct _unaryOperation { struct _node *right; };struct _binaryOperation { struct _node *left, *right; };struct _node { enum _kind kind; union _expression { struct _variable variable; struct _constant constant; struct _binaryOperation binary; struct _unaryOperation unary; } e;};// interpreter procedureint executeIntExpression(const struct _node *n) { int leftValue, rightValue; switch (n->kind) { case kVar: return *n->e.variable.memory; case kConst: return n->e.constant.value; case kSum: case kDiff: case kMult: case kDiv: leftValue = executeIntExpression(n->e.binary.left); rightValue = executeIntExpression(n->e.binary.right); switch (n->kind) { case kSum: return leftValue + rightValue; case kDiff: return leftValue - rightValue; case kMult: return leftValue * rightValue; case kDiv: if (rightValue == 0) exception("division by zero"); // doesn't return return leftValue / rightValue; } case kPlus: case kMinus: case kNot: rightValue = executeIntExpression(n->e.unary.right); switch (n->kind) { case kPlus: return + rightValue; case kMinus: return - rightValue; case kNot: return ! rightValue; } default: exception("internal error: illegal expression kind"); }}</td></tr></tbody></table> <p>An interpreter might well use the same <a href="/facts/Lexical_analysis/T1JYWpIf">lexical analyzer</a> and <a href="/facts/Parser/nRKB01S3">parser</a> as the compiler and then interpret the resulting <a href="/facts/Abstract_syntax_tree/73AUK1jI">abstract syntax tree</a>. Example data type definitions for the latter, and a toy interpreter for syntax trees obtained from <a href="/facts/C_(programming_language)/Ky2No763">C</a> expressions are shown in the box. </p> <h3>Regression</h3> <p>Interpretation cannot be used as the sole method of execution: even though an interpreter can itself be interpreted and so on, a directly executed program is needed somewhere at the bottom of the stack because the code being interpreted is not, by definition, the same as the machine code that the CPU can execute.<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a><a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a> </p> <h2 id="variations">Variations</h2> <h3>Bytecode interpreters</h3> <p class="note">Main article: <a href="/facts/Bytecode/EPkMFR7M">Bytecode</a></p> <p>There is a spectrum of possibilities between interpreting and compiling, depending on the amount of analysis performed before the program is executed. For example, <a href="/facts/Emacs_Lisp/JHdBcPwM">Emacs Lisp</a> is compiled to <a href="/facts/Bytecode/EPkMFR7M">bytecode</a>, which is a highly compressed and optimized representation of the Lisp source, but is not machine code (and therefore not tied to any particular hardware). This "compiled" code is then interpreted by a bytecode interpreter (itself written in <a href="/facts/C_(programming_language)/Ky2No763">C</a>). The compiled code in this case is machine code for a <a href="/facts/Virtual_machine/BLevU3sx">virtual machine</a>, which is implemented not in hardware, but in the bytecode interpreter. Such compiling interpreters are sometimes also called <i>compreters</i>.<a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a><a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a> In a bytecode interpreter each instruction starts with a byte, and therefore bytecode interpreters have up to 256 instructions, although not all may be used. Some bytecodes may take multiple bytes, and may be arbitrarily complicated. </p><p><a href="/facts/Control_table/AMkFG0mQ">Control tables</a> - that do not necessarily ever need to pass through a compiling phase - dictate appropriate algorithmic <a href="/facts/Control_flow/2XTDfErC">control flow</a> via customized interpreters in similar fashion to bytecode interpreters. </p> <h3>Threaded code interpreters</h3> <p class="note">Main article: <a href="/facts/Threaded_code/RwL3h6DJ">Threaded code</a></p> <p>Threaded code interpreters are similar to bytecode interpreters but instead of bytes they use pointers. Each "instruction" is a word that points to a function or an instruction sequence, possibly followed by a parameter. The threaded code interpreter either loops fetching instructions and calling the functions they point to, or fetches the first instruction and jumps to it, and every instruction sequence ends with a fetch and jump to the next instruction. Unlike bytecode there is no effective limit on the number of different instructions other than available memory and address space. The classic example of threaded code is the <a href="/facts/Forth_(programming_language)/mYtWVNhF">Forth</a> code used in <a href="/facts/Open_Firmware/M9e578XY">Open Firmware</a> systems: the source language is compiled into "F code" (a bytecode), which is then interpreted by a <a href="/facts/Virtual_machine/BLevU3sx">virtual machine</a>. </p> <h3>Abstract syntax tree interpreters</h3> <p class="note">Main article: <a href="/facts/Abstract_syntax_tree/73AUK1jI">Abstract syntax tree</a></p> <p>In the spectrum between interpreting and compiling, another approach is to transform the source code into an optimized abstract syntax tree (AST), then execute the program following this tree structure, or use it to generate native code <a href="/facts/Just-in-time_compilation/rEYDsd8l">just-in-time</a>.<a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a> In this approach, each sentence needs to be parsed just once. As an advantage over bytecode, the AST keeps the global program structure and relations between statements (which is lost in a bytecode representation), and when compressed provides a more compact representation.<a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a> Thus, using AST has been proposed as a better intermediate format for just-in-time compilers than bytecode. Also, it allows the system to perform better analysis during runtime. </p><p>However, for interpreters, an AST causes more overhead than a bytecode interpreter, because of nodes related to syntax performing no useful work, of a less sequential representation (requiring traversal of more pointers) and of overhead visiting the tree.<a class="footnote-ref" id="fnref:16" href="#fn:16"><sup>16</sup></a> </p> <h3>Just-in-time compilation</h3> <p class="note">Main article: <a href="/facts/Just-in-time_compilation/rEYDsd8l">Just-in-time compilation</a></p> <p>Further blurring the distinction between interpreters, bytecode interpreters and compilation is just-in-time (JIT) compilation, a technique in which the intermediate representation is compiled to native <a href="/facts/Machine_code/bgdQ1Fxf">machine code</a> at runtime. This confers the efficiency of running native code, at the cost of startup time and increased memory use when the bytecode or AST is first compiled. The earliest published JIT compiler is generally attributed to work on <a href="/facts/Lisp_(programming_language)/xJHA3CrX">LISP</a> by <a href="/facts/John_McCarthy_(computer_scientist)/ajKU4SdD">John McCarthy</a> in 1960.<a class="footnote-ref" id="fnref:17" href="#fn:17"><sup>17</sup></a> <a href="/facts/Adaptive_optimization/T3VwrLyd">Adaptive optimization</a> is a complementary technique in which the interpreter profiles the running program and compiles its most frequently executed parts into native code. The latter technique is a few decades old, appearing in languages such as <a href="/facts/Smalltalk/Ru2UPVDE">Smalltalk</a> in the 1980s.<a class="footnote-ref" id="fnref:18" href="#fn:18"><sup>18</sup></a> </p><p>Just-in-time compilation has gained mainstream attention amongst language implementers in recent years, with <a href="/facts/Java_platform/fpn6x8WL">Java</a>, the <a href="/facts/.NET_Framework/J6QDAUhP">.NET Framework</a>, most modern <a href="/facts/JavaScript/XhhIIEsl">JavaScript</a> implementations, and <a href="/facts/Matlab/qPjLISCk">Matlab</a> now including JIT compilers. </p> <h3>Template Interpreter</h3> <p>Making the distinction between compilers and interpreters yet again even more vague is a special interpreter design known as a template interpreter. Rather than implement the execution of code by virtue of a large switch statement containing every possible bytecode, while operating on a software stack or a tree walk, a template interpreter maintains a large array of bytecode (or any efficient intermediate representation) mapped directly to corresponding native machine instructions that can be executed on the host hardware as key value pairs (or in more efficient designs, direct addresses to the native instructions),<a class="footnote-ref" id="fnref:19" href="#fn:19"><sup>19</sup></a><a class="footnote-ref" id="fnref:20" href="#fn:20"><sup>20</sup></a> known as a "Template". When the particular code segment is executed the interpreter simply loads or jumps to the opcode mapping in the template and directly runs it on the hardware.<a class="footnote-ref" id="fnref:21" href="#fn:21"><sup>21</sup></a><a class="footnote-ref" id="fnref:22" href="#fn:22"><sup>22</sup></a> Due to its design, the template interpreter very strongly resembles a just-in-time compiler rather than a traditional interpreter, however it is technically not a JIT due to the fact that it merely translates code from the language into native calls one opcode at a time rather than creating optimized sequences of CPU executable instructions from the entire code segment. Due to the interpreter's simple design of simply passing calls directly to the hardware rather than implementing them directly, it is much faster than every other type, even bytecode interpreters, and to an extent less prone to bugs, but as a tradeoff is more difficult to maintain due to the interpreter having to support translation to multiple different architectures instead of a platform independent virtual machine/stack. To date, the only template interpreter implementations of widely known languages to exist are the interpreter within Java's official reference implementation, the Sun HotSpot Java Virtual Machine,<a class="footnote-ref" id="fnref:23" href="#fn:23"><sup>23</sup></a> and the Ignition Interpreter in the Google V8 javascript execution engine. </p> <h3>Self-interpreter</h3> <p class="note">Main article: <a href="/facts/Meta-circular_evaluator/1V4CyuTQ">Meta-circular evaluator</a></p> <p>A self-interpreter is a <a href="/facts/Programming_language/cWTYbgWa">programming language</a> interpreter written in a programming language which can interpret itself; an example is a <a href="/facts/BASIC_programming_language/VYMl5TmA">BASIC</a> interpreter written in BASIC. Self-interpreters are related to <a href="/facts/Self-hosting_(compilers)/0Q3F2Buy">self-hosting compilers</a>. </p><p>If no <a href="/facts/Compiler/WNfCDFJe">compiler</a> exists for the language to be interpreted, creating a self-interpreter requires the implementation of the language in a host language (which may be another programming language or <a href="/facts/Assembler_(computing)/7XuV0cla">assembler</a>). By having a first interpreter such as this, the system is <a href="/facts/Bootstrapping_(compilers)/uvQscbU5">bootstrapped</a> and new versions of the interpreter can be developed in the language itself. It was in this way that <a href="/facts/Donald_Knuth/GozNzDM6">Donald Knuth</a> developed the TANGLE interpreter for the language <a href="/facts/WEB/hUS0X35L">WEB</a> of the de-facto standard <a href="/facts/TeX/HDrl3Yvd">TeX</a> <a href="/facts/Typesetting/CsKmfY0t">typesetting system</a>. </p><p>Defining a computer language is usually done in relation to an abstract machine (so-called <a href="/facts/Operational_semantics/G24LXz6e">operational semantics</a>) or as a mathematical function (<a href="/facts/Denotational_semantics/yRs3ygRA">denotational semantics</a>). A language may also be defined by an interpreter in which the semantics of the host language is given. The definition of a language by a self-interpreter is not well-founded (it cannot define a language), but a self-interpreter tells a reader about the expressiveness and elegance of a language. It also enables the interpreter to interpret its source code, the first step towards reflective interpreting. </p><p>An important design dimension in the implementation of a self-interpreter is whether a feature of the interpreted language is implemented with the same feature in the interpreter's host language. An example is whether a <a href="/facts/Closure_(computer_science)/droP22Xn">closure</a> in a <a href="/facts/Lisp_programming_language/xJHA3CrX">Lisp</a>-like language is implemented using closures in the interpreter language or implemented "manually" with a data structure explicitly storing the environment. The more features implemented by the same feature in the host language, the less control the programmer of the interpreter has; for example, a different behavior for dealing with number overflows cannot be realized if the arithmetic operations are delegated to corresponding operations in the host language. </p><p>Some languages such as <a href="/facts/Lisp_programming_language/xJHA3CrX">Lisp</a> and <a href="/facts/Prolog/r5h66Qh1">Prolog</a> have elegant self-interpreters.<a class="footnote-ref" id="fnref:24" href="#fn:24"><sup>24</sup></a> Much research on self-interpreters (particularly reflective interpreters) has been conducted in the <a href="/facts/Scheme_(programming_language)/0aGdf3SC">Scheme programming language</a>, a dialect of Lisp. In general, however, any <a href="/facts/Turing_completeness/73goop44">Turing-complete</a> language allows writing of its own interpreter. Lisp is such a language, because Lisp programs are lists of symbols and other lists. XSLT is such a language, because XSLT programs are written in XML. A sub-domain of <a href="/facts/Metaprogramming/ujbjjJTY">metaprogramming</a> is the writing of <a href="/facts/Domain-specific_language/n18H1foD">domain-specific languages</a> (DSLs). </p><p>Clive Gifford introduced<a class="footnote-ref" id="fnref:25" href="#fn:25"><sup>25</sup></a> a measure quality of self-interpreter (the eigenratio), the limit of the ratio between computer time spent running a stack of <i>N</i> self-interpreters and time spent to run a stack of <i>N</i> − 1 self-interpreters as <i>N</i> goes to infinity. This value does not depend on the program being run. </p><p>The book <i><a href="/facts/Structure_and_Interpretation_of_Computer_Programs/1uQnItn6">Structure and Interpretation of Computer Programs</a></i> presents examples of <a href="/facts/Meta-circular_evaluator/1V4CyuTQ">meta-circular interpretation</a> for Scheme and its dialects. Other examples of languages with a self-interpreter are <a href="/facts/Forth_(programming_language)/mYtWVNhF">Forth</a> and <a href="/facts/Pascal_(programming_language)/b3yvp8bF">Pascal</a>. </p> <h3>Microcode</h3> <p class="note">Main article: <a href="/facts/Microcode/XQEsr2X3">Microcode</a></p> <p>Microcode is a very commonly used technique "that imposes an interpreter between the hardware and the architectural level of a computer".<a class="footnote-ref" id="fnref:26" href="#fn:26"><sup>26</sup></a> As such, the microcode is a layer of hardware-level instructions that implement higher-level <a href="/facts/Machine_code/bgdQ1Fxf">machine code</a> instructions or internal <a href="/facts/State_machine/GMusWd0a">state machine</a> sequencing in many <a href="/facts/Digital_processing/JChckAvr">digital processing</a> elements. Microcode is used in general-purpose <a href="/facts/Central_processing_unit/Jxp1bqMV">central processing units</a>, as well as in more specialized processors such as <a href="/facts/Microcontroller/MKrnAhnm">microcontrollers</a>, <a href="/facts/Digital_signal_processor/YuBXweos">digital signal processors</a>, <a href="/facts/Channel_I%2fO/vDBtN2wQ">channel controllers</a>, <a href="/facts/Disk_controller/dfRSYlMq">disk controllers</a>, <a href="/facts/Network_interface_controller/wyf5FR29">network interface controllers</a>, <a href="/facts/Network_processor/SW5Lv8UM">network processors</a>, <a href="/facts/Graphics_processing_unit/PTK1RQVp">graphics processing units</a>, and in other hardware. </p><p>Microcode typically resides in special high-speed memory and translates machine instructions, <a href="/facts/State_machine/GMusWd0a">state machine</a> data or other input into sequences of detailed circuit-level operations. It separates the machine instructions from the underlying <a href="/facts/Electronics/E4JhgISq">electronics</a> so that instructions can be designed and altered more freely. It also facilitates the building of complex multi-step instructions, while reducing the complexity of computer circuits. Writing microcode is often called microprogramming and the microcode in a particular processor implementation is sometimes called a microprogram. </p><p>More extensive microcoding allows small and simple <a href="/facts/Microarchitecture/NFRd4NUL">microarchitectures</a> to <a href="/facts/Emulator/FMHE8qDj">emulate</a> more powerful architectures with wider <a href="/facts/Word_length/2e5umRaj">word length</a>, more <a href="/facts/Execution_unit/uvg54JcX">execution units</a> and so on, which is a relatively simple way to achieve software compatibility between different products in a processor family. </p> <h3>Computer processor</h3> <p>Even a non microcoding computer processor itself can be considered to be a parsing immediate execution interpreter that is written in a general purpose hardware description language such as <a href="/facts/VHDL/H6Exdjfs">VHDL</a> to create a system that parses the machine code instructions and immediately executes them. </p> <h2 id="applications">Applications</h2> <ul><li>Interpreters are frequently used to execute <a href="/facts/Command_language/YVXavbxQ">command languages</a>, and <a href="/facts/Glue_language/8pF4ajBL">glue languages</a> since each operator executed in command language is usually an invocation of a complex routine such as an editor or compiler.</li> <li><a href="/facts/Self-modifying_code/sbdqYrRp">Self-modifying code</a> can easily be implemented in an interpreted language. This relates to the origins of interpretation in Lisp and <a href="/facts/Artificial_intelligence/lJGauQwX">artificial intelligence</a> research.</li> <li><a href="/facts/Virtualization/bEqH0Wtf">Virtualization</a>. Machine code intended for a hardware architecture can be run using a <a href="/facts/Virtual_machine/BLevU3sx">virtual machine</a>. This is often used when the intended architecture is unavailable, or among other uses, for running multiple copies.</li> <li><a href="/facts/Sandbox_(computer_security)/WEm2u7oG">Sandboxing</a>: While some types of sandboxes rely on operating system protections, an interpreter or virtual machine is often used. The actual hardware architecture and the originally intended hardware architecture may or may not be the same. This may seem pointless, except that sandboxes are not compelled to actually execute all the instructions the source code it is processing. In particular, it can refuse to execute code that violates any <a href="/facts/Computer_security/7E5dIy7G">security</a> constraints it is operating under.</li> <li><a href="/facts/Emulator/FMHE8qDj">Emulators</a> for running computer software written for obsolete and unavailable hardware on more modern equipment.</li></ul> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/BASIC_interpreter/AbVeR56f">BASIC interpreter</a></li> <li><a href="/facts/Command-line_interpreter/R9JpGmXQ">Command-line interpreter</a></li> <li><a href="/facts/Compiled_language/WRqIRjFx">Compiled language</a></li> <li><a href="/facts/Dynamic_compilation/8kvGv9nE">Dynamic compilation</a></li> <li><a href="/facts/Homoiconicity/jNG51mrs">Homoiconicity</a></li> <li><a href="/facts/Meta-circular_evaluator/1V4CyuTQ">Meta-circular evaluator</a></li> <li><a href="/facts/Partial_evaluation/cSBKhRPo">Partial evaluation</a></li> <li><a href="/facts/Read%25E2%2580%2593eval%25E2%2580%2593print_loop/lddjCYxt">Read–eval–print loop</a></li></ul> <h2 id="sources">Sources</h2> <ul><li>Aycock, J. (June 2003). "A brief history of just-in-time". <i>ACM Computing Surveys</i>. 35 (2): 97–113. <a href="/facts/CiteSeerX_(identifier)/SceDmd3c">CiteSeerX</a> <a href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.3985">10.1.1.97.3985</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1145%2F857076.857077">10.1145/857076.857077</a>. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:15345671">15345671</a>.</li></ul> <h2 id="external-links">External links</h2> <ul><li><a href="http://www.columbia.edu/acis/history/interpreter.html">IBM Card Interpreters</a> page at Columbia University</li> <li><a href="https://archive.org/download/TheoreticalFoundationsForPracticaltotallyFunctionalProgramming/33429551_PHD_totalthesis.pdf">Theoretical Foundations For Practical 'Totally Functional Programming'</a> (Chapter 7 especially) Doctoral dissertation tackling the problem of formalising what is an interpreter</li> <li><a href="https://www.youtube.com/watch?v=_C5AHaS1mOA">Short animation</a> explaining the key conceptual difference between interpreters and compilers. Archived at <a href="http://ghostarchive.org/varchive/_C5AHaS1mOA">ghostarchive.org</a> on May 9, 2022.</li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>In this sense, the CPU is also an interpreter, of machine instructions. <a href="/wiki/Central_processing_unit" target="_blank">/wiki/Central_processing_unit</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Although this scheme (combining strategy 2 and 3) was used to implement certain BASIC interpreters already in the 1970s, such as the efficient BASIC interpreter of the ABC 80, for instance. <a href="/wiki/ABC_80" target="_blank">/wiki/ABC_80</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Bennett, J. M.; Prinz, D. G.; Woods, M. L. (1952). "Interpretative sub-routines". Proceedings of the ACM National Conference, Toronto. <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>According to what reported by Paul Graham in Hackers & Painters, p. 185, McCarthy said: "Steve Russell said, look, why don't I program this eval..., and I said to him, ho, ho, you're confusing theory with practice, this eval is intended for reading, not for computing. But he went ahead and did it. That is, he compiled the eval in my paper into IBM 704 machine code, fixing bug, and then advertised this as a Lisp interpreter, which it certainly was. So at that point Lisp had essentially the form that it has today..." <a href="/wiki/Paul_Graham_(computer_programmer)" target="_blank">/wiki/Paul_Graham_(computer_programmer)</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>"Why was the first compiler written before the first interpreter?". Ars Technica. 8 November 2014. Retrieved 9 November 2014. <a href="https://arstechnica.com/information-technology/2014/11/why-was-the-first-compiler-written-before-the-first-interpreter/" target="_blank">https://arstechnica.com/information-technology/2014/11/why-was-the-first-compiler-written-before-the-first-interpreter/</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>This article is based on material taken from Interpreter at the Free On-line Dictionary of Computing prior to 1 November 2008 and incorporated under the "relicensing" terms of the GFDL, version 1.3 or later. <a href="https://foldoc.org/Interpreter" target="_blank">https://foldoc.org/Interpreter</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>"Compilers vs. interpreters: explanation and differences". IONOS Digital Guide. Retrieved 2022-09-16. <a href="https://www.ionos.com/digitalguide/websites/web-development/compilers-vs-interpreters/" target="_blank">https://www.ionos.com/digitalguide/websites/web-development/compilers-vs-interpreters/</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>This article is based on material taken from Interpreter at the Free On-line Dictionary of Computing prior to 1 November 2008 and incorporated under the "relicensing" terms of the GFDL, version 1.3 or later. <a href="https://foldoc.org/Interpreter" target="_blank">https://foldoc.org/Interpreter</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>This article is based on material taken from Interpreter at the Free On-line Dictionary of Computing prior to 1 November 2008 and incorporated under the "relicensing" terms of the GFDL, version 1.3 or later. <a href="https://foldoc.org/Interpreter" target="_blank">https://foldoc.org/Interpreter</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>Theodore H. Romer, Dennis Lee, Geoffrey M. Voelker, Alec Wolman, Wayne A. Wong, Jean-Loup Baer, Brian N. Bershad, and Henry M. Levy, The Structure and Performance of Interpreters <a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.41.2582&rep=rep1&type=pdf" target="_blank">http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.41.2582&rep=rep1&type=pdf</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>Terence Parr, Johannes Luber, The Difference Between Compilers and Interpreters Archived 2014-01-06 at the Wayback Machine <a href="http://www.antlr.org/wiki/display/ANTLR3/The+difference+between+compilers+and+interpreters" target="_blank">http://www.antlr.org/wiki/display/ANTLR3/The+difference+between+compilers+and+interpreters</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>Kühnel, Claus (1987) [1986]. "4. Kleincomputer - Eigenschaften und Möglichkeiten" [4. Microcomputer - Properties and possibilities]. In Erlekampf, Rainer; Mönk, Hans-Joachim (eds.). Mikroelektronik in der Amateurpraxis [Micro-electronics for the practical amateur] (in German) (3 ed.). Berlin: Militärverlag der Deutschen Demokratischen Republik [de], Leipzig. p. 222. ISBN 3-327-00357-2. 7469332. <a href="3-327-00357-2" target="_blank">3-327-00357-2</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> <li id="fn:13"><p>Heyne, R. (1984). "Basic-Compreter für U880" [BASIC compreter for U880 (Z80)]. radio-fernsehn-elektronik [de] (in German). 1984 (3): 150–152. <a href="/w/index.php?title=Radio-fernsehn-elektronik&action=edit&redlink=1" target="_blank">/w/index.php?title=Radio-fernsehn-elektronik&action=edit&redlink=1</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li> <li id="fn:14"><p>AST intermediate representations, Lambda the Ultimate forum <a href="http://lambda-the-ultimate.org/node/716" target="_blank">http://lambda-the-ultimate.org/node/716</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li> <li id="fn:15"><p>Kistler, Thomas; Franz, Michael (February 1999). "A Tree-Based Alternative to Java Byte-Codes" (PDF). International Journal of Parallel Programming. 27 (1): 21–33. CiteSeerX 10.1.1.87.2257. doi:10.1023/A:1018740018601. ISSN 0885-7458. S2CID 14330985. Retrieved 2020-12-20. <a href="/wiki/Michael_Franz" target="_blank">/wiki/Michael_Franz</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li> <li id="fn:16"><p>Surfin' Safari - Blog Archive » Announcing SquirrelFish. Webkit.org (2008-06-02). Retrieved on 2013-08-10. <a href="http://webkit.org/blog/189/announcing-squirrelfish/" target="_blank">http://webkit.org/blog/189/announcing-squirrelfish/</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></p></li> <li id="fn:17"><p>Aycock 2003, 2. JIT Compilation Techniques, 2.1 Genesis, p. 98. - Aycock, J. (June 2003). "A brief history of just-in-time". ACM Computing Surveys. 35 (2): 97–113. CiteSeerX 10.1.1.97.3985. doi:10.1145/857076.857077. S2CID 15345671. <a href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.3985" target="_blank">https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.3985</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></p></li> <li id="fn:18"><p>L. Deutsch, A. Schiffman, Efficient implementation of the Smalltalk-80 system, Proceedings of 11th POPL symposium, 1984. <a href="http://portal.acm.org/citation.cfm?id=800017.800542" target="_blank">http://portal.acm.org/citation.cfm?id=800017.800542</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></p></li> <li id="fn:19"><p>"openjdk/jdk". GitHub. 18 November 2021. <a href="https://github.com/openjdk/jdk" target="_blank">https://github.com/openjdk/jdk</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></p></li> <li id="fn:20"><p>"HotSpot Runtime Overview". Openjdk.java.net. Retrieved 2022-08-06. <a href="https://openjdk.java.net/groups/hotspot/docs/RuntimeOverview.html#Interpreter" target="_blank">https://openjdk.java.net/groups/hotspot/docs/RuntimeOverview.html#Interpreter</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></p></li> <li id="fn:21"><p>"Demystifying the JVM: JVM Variants, Cppinterpreter and TemplateInterpreter". metebalci.com. <a href="https://metebalci.com/blog/demystifying-the-jvm-jvm-variants-cppinterpreter-and-templateinterpreter/" target="_blank">https://metebalci.com/blog/demystifying-the-jvm-jvm-variants-cppinterpreter-and-templateinterpreter/</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></p></li> <li id="fn:22"><p>"JVM template interpreter". ProgrammerSought. <a href="https://programmersought.com/article/5521858566/" target="_blank">https://programmersought.com/article/5521858566/</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></p></li> <li id="fn:23"><p>"openjdk/jdk". GitHub. 18 November 2021. <a href="https://github.com/openjdk/jdk" target="_blank">https://github.com/openjdk/jdk</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></p></li> <li id="fn:24"><p>Bondorf, Anders. "Logimix: A self-applicable partial evaluator for Prolog." Logic Program Synthesis and Transformation. Springer, London, 1993. 214-227. <a href="https://web.archive.org/web/20181112101324/https://pdfs.semanticscholar.org/a089/c5ae66c3311b45de0aaddfa457e4eb821316.pdf" target="_blank">https://web.archive.org/web/20181112101324/https://pdfs.semanticscholar.org/a089/c5ae66c3311b45de0aaddfa457e4eb821316.pdf</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></p></li> <li id="fn:25"><p>Gifford, Clive. "Eigenratios of Self-Interpreters". Blogger. Retrieved 10 November 2019. <a href="http://eigenratios.blogspot.com/2006/11/wanted-eigenratios-of-brainfck-self.html" target="_blank">http://eigenratios.blogspot.com/2006/11/wanted-eigenratios-of-brainfck-self.html</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></p></li> <li id="fn:26"><p>Kent, Allen; Williams, James G. (April 5, 1993). Encyclopedia of Computer Science and Technology: Volume 28 - Supplement 13. New York: Marcel Dekker, Inc. ISBN 0-8247-2281-7. Retrieved Jan 17, 2016. <a href="0-8247-2281-7" target="_blank">0-8247-2281-7</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></p></li> </ol>