0
How many compilers ie front ends and back ends are required for m languages and n machines by making use of an intermediate language?
If the intermediate code generated is the same for all the machines. Hence the
number of Front end conversions is one for each language. Similarly the number of
back end conversions is equal to the number of machines.
Intermediate representation has a variety of forms. There are also many algorithms for
generating intermediate codes for typical programming language constructs.
To generalize, for M languages on N machines we would require M Front end
conversions. The number of back end conversions would then be equal to N*M.
What else can I help you with?
What are some examples of Turing recognizable languages and how do they differ from other types of languages?
Turing recognizable languages are those that can be accepted by a Turing machine, a theoretical model of computation. Examples include regular languages, context-free languages, and recursively enumerable languages. These languages differ from others in terms of their computational complexity and the types of machines that can recognize them. Regular languages are the simplest and can be recognized by finite automata, while context-free languages require pushdown automata. Recursively enumerable languages are the most complex and can be recognized by Turing machines.
Is the assembly language for x86 processors the same as those for computer systems such as the Vax or Motorola 68x00?
No. Each assembly language is based on either a processor family or a specific computer. Different. Each assembly language is based on a series of processors or specific machines.
What is the relationship between the theory of computation, formal languages, automata, and complexity?
The theory of computation studies how machines solve problems. Formal languages are used to describe the structure of data. Automata are abstract machines that recognize patterns in input. Complexity theory analyzes the resources needed to solve problems. These areas are interconnected, as automata can recognize formal languages, which are used in the theory of computation to analyze problem complexity.
What is the relationship between s-grammar and automata?
S-grammar and automata are related in the field of theoretical computer science. S-grammar is a formal system used to generate strings in a language, while automata are abstract machines that can recognize patterns in strings. Automata can be used to simulate the behavior of S-grammar, helping to analyze and understand the properties of languages generated by the grammar.
Define the languages accepted by NFA and DFA?
In general, finite state machines can model regular grammars. Deterministic finite automata can represent deterministic context-free grammars. Non-deterministic finite automata can represent context-free grammars.
Can high level languages can be understood by machines?
Not directly. They need to be converted to "machine language" by compilers and linkers before they can be executed by the machine.
What was the earliest computer languages and were they Binary Code FORTRAN COBOL.?
The oldest computer language is machine code and all computer languages are binary encoded. It's unavoidable on binary machines.
Name three high level languages and describe their original uses?
InterpretedInterpreted languages are read and then executed directly, with no compilation stage. A program called an interpreter reads each program statement following the program flow, decides what to do, and does it. A hybrid of an interpreter and a compiler will compile the statement into machine code and execute that; the machine code is then discarded, to be interpreted anew if the line is executed again. Interpreters are commonly the simplest implementations, compared to the other two variants listed here.CompiledCompiled languages are transformed into an executable form before running. There are two types of compilation: Machine code generation Some compilers compile source code directly into machine code. This is the original mode of compilation, and languages that are directly and completely transformed to machine-native code in this way may be called "truly compiled" languages. See assembly language.Intermediate representations When a language is compiled to an intermediate representation, that representation can be optimized or saved for later execution without the need to re-read the source file. When the intermediate representation is saved, it is often represented as byte code. The intermediate representation must then be interpreted or further compiled to execute it. Virtual machines that execute byte code directly or transform it further into machine code have blurred the once clear distinction between intermediate representations and truly compiled languages.
Oliver owns a paper mill. It has machines that use wood pulp to make paper. Which is an intermediate good?
machines
Is there any possibility that computers work without any programming language?
No. Computers are machines and require machine code to work. Machine code is a programming language. All other languages have to be converted to machine code in order to work.
How the machine language differ from machine to machine?
Its like the human language, there are Polish, Russian, German, English, Chinese, Italian, French ect... It is exactly the same in machines, but they have languages such as Jargon, Python, ect. each machine will communicate differently, depending on what language has been programmed into them.
What are scripting languages?
Scripting languages are more complex languages which are written to make/complete specific task in machines like PC's. This is simple script from C scripting language: #include <stdio.h> #include <stdlib.h> int main() { printf("Hello world!\n"); return 0; } This script will say "Hello World".
Short note on high level language?
Generally languages are used for communication, In the case of computers languages are used to communicate with the Hardware. Language consist of set of rules and syntaxes to frame the valid instructions to work with the Machines.
What were the major differences between first generation languages and second generation languages?
The main difference is that first generation languages (1GL) are low-level while second generation languages (2GL) are high-level. Before there were any programming languages everything had to be coded manually using machine code, the native language of the machine (0GL if you like). However, it was quickly realised that the computer itself could be programmed to assemble the machine code from a symbolic language which became known as assembly language, the first 1GL language. Each machine required its own assembler because the symbolic assembly language, like the machine code it produced, was machine-specific. That is, machine code could only operate upon machines of the same type. 1GL languages made programming easier, however every program still had to be designed and coded in minute detail. Thus more complex languages began to appear, languages which incorporated a greater degree of abstraction between the source code and the machine itself, allowing the production of many assembly instructions in just a few lines of "high-level" source code. These became the first of the 2GL languages. The programs that performed the translation from source code to assembly code became known as compilers (which were originally written in assembly language, of course). The resultant assembly code could then be optimised by hand before being fully assembled. However, as these new languages advanced, they began to incorporate their own optimisers and could emit the machine code directly. More importantly, as each machine had its own compiler, the same high-level source code could be "ported" to different machines. These became the 3GL languages, with C being the most prevalent until the introduction of C++ in 1983. These days the terms 4GL, 5GL (and even 6GL!) are used to describe some new languages, but they are meaningless terms because once you have portability between machines (which was achieved with 3GL), there's really nothing new you can add to any language that can surpass portability. All new languages are just better 3GL languages! The "generation" labels are typically used by marketing types to make one language seem superior to another even when the perceived "enhancement" is insignificant or, in some case, completely non-existent! There are perfectly adequate 3GL languages that, through simple improvements and continued development, are fully capable of achieving the same ends as any so-called 4GL+ language. Languages are best categorised by their primary features: whether they are functional, empirical, procedural, structured, object-oriented, and so on, or by the fields in which they specialise, whether it be general purpose programming, business programming or artificial intelligence programming. These tell you far more about a specific language than any meaningless "generation" label ever can.
What are some examples of Turing recognizable languages and how do they differ from other types of languages?
Turing recognizable languages are those that can be accepted by a Turing machine, a theoretical model of computation. Examples include regular languages, context-free languages, and recursively enumerable languages. These languages differ from others in terms of their computational complexity and the types of machines that can recognize them. Regular languages are the simplest and can be recognized by finite automata, while context-free languages require pushdown automata. Recursively enumerable languages are the most complex and can be recognized by Turing machines.
What are two types of machines?
1- Binary language 2- Assembly Language
Can machines understand high level language?
yes
