An interpreted language is a type of programming language for which most of its implementations execute instructions directly and freely, without previously compiling a program into machine - language instructions. The interpreter executes the program directly, translating each statement into a sequence of one or more subroutines, and then into anotherlanguage (often machine code).
The terms interpreted language and compiled language are not well defined because, in theory, any programming language can be either interpreted or compiled. In modern programming language implementation, it is increasingly popular for a platform to provide both options.
Interpreted languages can also be contrasted with machine languages. Functionally, both execution and interpretation mean the same thing — fetching the next instruction/statement from the program and executing it. Although interpreted byte code is additionally identical to machine code in form and has an assembler representation, the term "interpreted" is sometimes reserved for " software processed" languages (by virtual machine or emulator ) on top of the native (i.e. hardware ) processor.
In principle, programs in many languages may be compiled or interpreted, emulated or executed natively, so this designation is applied solely based on common implementation practice, rather than representing an essential property of a language.
Many languages have been implemented using both compilers and interpreters, including BASIC, C, Lisp, and Pascal.
Copyright 2024 puzzlefactory.com All rights reserved.
