Diclib.com
Dicionário ChatGPT

Pesquisa de dicionário Soluções personalizadas

Digite uma palavra ou frase em qualquer idioma 👆

Idioma:

Tradução e análise de palavras por inteligência artificial ChatGPT

Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:

como a palavra é usada
frequência de uso
é usado com mais frequência na fala oral ou escrita
opções de tradução de palavras
exemplos de uso (várias frases com tradução)
etimologia

O que (quem) é embedded interpreter - definição

PROGRAM THAT EXECUTES SOURCE CODE WITHOUT A SEPARATE COMPILATION STEP

Interpreted language; Interpreted Language; Interpreted programming language; Interpreter (computer software); Self-interpreter; Interpreter (programming); Interpreted (programming languages); Runtime interpreter; Evaluator; Metainterpreter; Interpretive language; Interpretive Languages; Interprted language; Interpreter (computer science); Interpreter computing; Interpreted computer language; Bytecode interpreter; Code interpretation; Interpretive programming language; Code interpreter; Interpreter (software); Abstract syntax tree interpreter; Compreter; Compiler-interpreter; Compiler–interpreter

Interpreter (computing)

In computer science, an interpreter is a computer program that directly executes instructions written in a programming or scripting language, without requiring them previously to have been compiled into a machine language program. An interpreter generally uses one of the following strategies for program execution:

https://en.wikipedia.org/wiki/Interpreter_(computing)

evaluator

<theory> Geoff Burn defines evaluators E0, E1, E2 and E3 which when applied to an expression, reduce it to varying degrees. E0 does no evaluation, E1 it evaluates to {weak head normal form} (WHNF), E2 evaluates the structure of a list, i.e. it evaluates it either to NIL or evaluates it to a CONS and then applies E2 to the second argument of the CONS. E3 evaluates the structure of a list and evaluates each element of the list to WHNF. This concept can be extended to data structures other than lists and forms the basis of the {evaluation transformer} style of strictness analysis. (1994-12-12)

embedded system

COMPUTER SYSTEM WITH A DEDICATED FUNCTION WITHIN A LARGER MECHANICAL OR ELECTRICAL SYSTEM.

Embeded computer; Embedded computer; Embedded device; Embedded devices; Embedded processor; Embedded Systems; Embedded System; Embeded system; Embeded System; Embedded computers; Special purpose computer; Vehicle electronics; Embedded system overview; Embedded Devices; Imbedded system; Special-purpose computer; Embedded control; Embedded Computing; Embedded computing; T.E.C.; Embedded engineer; Embedded system testing; Embedded hardware; Embedded systems; Embedded computer system; Applications of embedded systems; History of embedded systems; Industrial computer; Embedded computer systems

<computer> Hardware and software which forms a component of some larger system and which is expected to function without human intervention. A typical embedded system consists of a single-board microcomputer with software in ROM, which starts running some special purpose application program as soon as it is turned on and will not stop until it is turned off (if ever). An embedded system may include some kind of operating system but often it will be simple enough to be written as a single program. It will not usually have any of the normal peripherals such as a keyboard, monitor, serial connections, mass storage, etc. or any kind of user interface software unless these are required by the overall system of which it is a part. Often it must provide real-time response. Usenet newsgroup: news:comp.arch.embedded. (1995-04-12)

Wikipédia

Interpreter (computing)

In computer science, an interpreter is a computer program that directly executes instructions written in a programming or scripting language, without requiring them previously to have been compiled into a machine language program. An interpreter generally uses one of the following strategies for program execution:

Parse the source code and perform its behavior directly;
Translate source code into some efficient intermediate representation or object code and immediately execute that;
Explicitly execute stored precompiled bytecode made by a compiler and matched with the interpreter Virtual Machine.

Early versions of Lisp programming language and minicomputer and microcomputer BASIC dialects would be examples of the first type. Perl, Raku, Python, MATLAB, and Ruby are examples of the second, while UCSD Pascal is an example of the third type. Source programs are compiled ahead of time and stored as machine independent code, which is then linked at run-time and executed by an interpreter and/or compiler (for JIT systems). Some systems, such as Smalltalk and contemporary versions of BASIC and Java may also combine two and three. Interpreters of various types have also been constructed for many languages traditionally associated with compilation, such as Algol, Fortran, Cobol, C and C++.

While interpretation and compilation are the two main means by which programming languages are implemented, they are not mutually exclusive, as most interpreting systems also perform some translation work, just like compilers. The terms "interpreted language" or "compiled language" signify that the canonical implementation of that language is an interpreter or a compiler, respectively. A high-level language is ideally an abstraction independent of particular implementations.

https://en.wikipedia.org/wiki/Interpreter (computing)