0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
Difference between machine language and binary code?
Machine language is often (incorrectly) referred to as binary language. Binary is a numbering system comprised of zeros and ones. (Also thought of as true/false, or originally from the electronic ancestry, on and off.) Machine language is the instructions that computers understand. These instructions are comprized of binary values which instruct the CPU to perform specific actions.
Do you have information on linguistics of Mexican Americans?
The language is often termed Spanglish which has evolved as something quite different from Spanish.
Is machine language is also called a assembly language?
Computers only understand machine code. Low-level Assembler language and all high-level languages must be assembled or compiled to machine code in order to execute. However, the computer itself can be programmed (with a machine-code program) to generate the required machine code from either a low-level or high-level input. Low-level Assembler is an almost one-to-one translation of symbols and mnemonics to machine code whereas high-level languages often compile to object code which is then linked to produce machine code. Interpreted high-level languages are not compiled to machine code but are interpreted by another program, an interpreter, which translates each line of high-level code into the required machine code at runtime. Java, for instance, compiles to byte code suitable for the Java virtual machine. The JVM is a machine code program that interprets the byte code to produce machine-specific machine code. As a result of this interpretation, Java programs are much slower than machine-coded implementations of the same program.
Which language is used in robotics?
Ultimately, the processor that is used in any robotic device must execute the binary instructions that correspond with that processor. But processors are often programmed using a high level language such as C++ or Java, then the programmer runs the code through either a compiler or interpreter to convert the program into binary. Often the manufacturers of a processor may have provided several high level languages that work with a specific processor, giving the programmer options as to which language might best serve his/her needs. The binary instructions and the higher level programming language are often referred to as a language for processors, whether in robots or other automation devices.
What converts high level language to machine language?
Converting machine language to a high-level language is very difficult. It is not possible to convert machine language back to the original high-level source code because there are an infinite number of source code files that can produce any given machine language output. For example, machine language uses memory addresses or stack locations to store variables, so all variable names used in the source code are lost and cannot be regenerated. There are some reverse compiler tools that can produce a probable high level language file from machine language. And some machine code file formats store information about source code for debugging or tracing, and when available, that information can be very useful to reverse-compile machine code. It is also possible to generate an assembly language file that is close to the machine code, and although that is not high-level it is more human readable.
Business communication is often termed as the lifeblood of business concern justify this statement with an example?
Business communication is often termed as the lifeblood of business concern justify this statement with an example?
Is groovy an interpreted language?
Yes, Groovy is primarily an interpreted language. It is often run on the Java Virtual Machine (JVM) and is compiled to bytecode at runtime. This makes Groovy a dynamic language with scripting capabilities.
What is the base 2 system?
It is often called Binary. There are only 2 symbols, usually "0" and "1". Digital devices often use Binary.
What is the difference between compiled language and interpreted language?
A compiled language is written and then run through a compiler which checks its syntax and compresses it into a binary executable. Since an interpreted language is not compiled, it must be checked for errors at run-time, which makes it quite a bit slower than a compiled language (like C or Java). Perl is an example of an interpreted language. Remember, though, that just because a language is interpreted doesn't necessarily mean it is not full-featured, or simplistic. Perl can get very complex and very cryptic, very quickly.
How did the Spanish-American War go?
It is often termed a splendid little war.
What are the difficulties in writing programs in machine language?
Machine language is error prone simply because it is so difficult to write programs using nothing more than binary notation. Every instruction, every register and every memory address has to be converted to binary. Just one bit out of place would render the code invalid. Trying to find one errant bit amongst many millions is no easy task. Of course we don't actually use binary (base-2) to write machine code. Any base that is itself a power of 2 will do. Binary is 2^1 while 2^2 is base-4, 2^3 is base-8 (octal) and 2^4 is base-16 (hexadecimal). The advantage of using these higher bases is that instead of entering machine code one bit at a time, we can enter a group of bits using just one symbol. If we divide binary data into groups of 2 bits, then there can be only 4 possible combinations (00, 01, 10 and 11). Base-4 only has 4 possible digits (0, 1, 2 and 3) so it is trivial to map each group of 2 bits to just one base-4 digit. If we divide binary data into groups of 3 bits then there would be 8 possible combinations, each of which can be represented by just one octal digit. And if we divide into groups of 4 bits we get 16 possible combinations each of which can be represented with just one hexadecimal digit. A byte is usually 8 bits long, so if one hexadecimal digit represents half a byte (a nybble) then two hexadecimal digits represent a full byte. Converting from hexadecimal to binary is so trivial that we can easily write a simple machine code program to perform the conversion for us. This reduces the chances of making errors during input by a factor of 4. However, reducing the chances of error doesn't eliminate errors. Programmer's are only human and if a programmer can make mistakes using a high-level language, then the odds of making a mistake in low-level machine code is greatly multiplied. No matter how much time you spend designing, one mistake is all it takes. And if a mistake is made, finding it is easier said than done. To reduce the chances of mistake even further, it is best to steer clear of machine code altogether and use assembly language. Assembly language is a symbolic language, so just as binary values can be symbolised through hexadecimal notation, operation codes can be symbolised through easy-to-remember mnemonics. That is, instead of having to remember that code 80 moves a memory address into a register and that 81 moves a register value to that memory address, we need only remember that MOV does both and will translate to the appropriate instruction according to the operands we provide. Assembly language also allows us to use any notion that is most convenient, including decimal, octal, hexadecimal or even binary itself. Every register has a unique identifier and we can also give static, global and constant data user-defined names, so we don't need to keep track of every memory address. We can also insert comments! Although assembly language is not machine code, the translation from assembly language to machine code is virtually 1:1, there is very little in the way of abstraction. We still won't eliminate programming errors, but at least we have a fighting chance of locating them and ultimately fixing them. Writing machine code programs in assembly is nonetheless a laborious process. So much so that machine code programmers often prefer to use high-level languages like C and C++ to do the bulk of the work to generate the assembly language which they can then tweak further by hand where necessary. However, C++ in particular produces such good machine code by itself that programmers rarely need to "bang the metal". Indeed, many of the optimisations utilised by the C++ compiler came from the tricks of the trade used by machine code programmers themselves. As a result, C++ can often produce machine code that surpasses anything that can be produced by hand -- but even when it can't, tweaking machine code is so much easier when you don't have to write every single bit from scratch.
Why does micro processor work in assembly language?
Microprocessors work in microcode, not assembly language. Microcode processes machine instructions, which are often assembled from assembler languages; higher level languages often convert each line of code into multiple lines of assembler language before their ultimate compilation into an executable. The assembler language contains mnomonics that are used to translate each line of source code into a machine instruction. When those machine instructions are loaded in memory, the CPU will use microcode to interpret and execute those instructions. Barring some experimental CPUs that use non-traditional machine code (such as Sun's Java CPU), all production-class CPUs use machine instructions as their basis for software execution.
