Namespaces
Variants
Actions

Difference between revisions of "Machine-oriented language"

From Encyclopedia of Mathematics
Jump to: navigation, search
(Importing text file)
 
(TeX)
 
Line 1: Line 1:
A programming language that allows one, when compiling programs, to take into account the peculiarities of the systems of commands and representation of information in the object computer. Machine-oriented languages, in contrast to universal problem-oriented languages (cf. [[Problem-oriented language|Problem-oriented language]]) that realize a mapping of the set <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m062/m062050/m0620501.png" /> of input programs into the set <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m062/m062050/m0620502.png" /> of machine programs, try to map <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m062/m062050/m0620503.png" /> onto <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m062/m062050/m0620504.png" />.
+
{{TEX|done}}
 +
A programming language that allows one, when compiling programs, to take into account the peculiarities of the systems of commands and representation of information in the object computer. Machine-oriented languages, in contrast to universal problem-oriented languages (cf. [[Problem-oriented language|Problem-oriented language]]) that realize a mapping of the set $P$ of input programs into the set $M$ of machine programs, try to map $P$ onto $M$.
  
 
The simplest machine-oriented languages are assemblers, which, while completely preserving the structure of the machine programs, allow one to use a symbolic notation for commands and memory addresses, as well as to collect programs from a couple of separately-described parts. For additional possibilities concerning substitutions in the text and other simple transformations when compiling the text of programs, one needs macro-assemblers. Machine-oriented languages of a higher level, like universal languages, have a phrase-structure allowing for compound objects and defining operations. This structure also contains additional means for describing elementary objects and basic operations in terms of the machine structure.
 
The simplest machine-oriented languages are assemblers, which, while completely preserving the structure of the machine programs, allow one to use a symbolic notation for commands and memory addresses, as well as to collect programs from a couple of separately-described parts. For additional possibilities concerning substitutions in the text and other simple transformations when compiling the text of programs, one needs macro-assemblers. Machine-oriented languages of a higher level, like universal languages, have a phrase-structure allowing for compound objects and defining operations. This structure also contains additional means for describing elementary objects and basic operations in terms of the machine structure.
Line 9: Line 10:
  
 
====Comments====
 
====Comments====
A typical contemporary example of a higher-level programming language which supports access to machine-level features is the language <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m062/m062050/m0620505.png" />, which is widely used for general programming in a UNIX environment.
+
A typical contemporary example of a higher-level programming language which supports access to machine-level features is the language $C$, which is widely used for general programming in a UNIX environment.
  
 
====References====
 
====References====
<table><TR><TD valign="top">[a1]</TD> <TD valign="top">  B.W. Kernighan,  D.M. Ritchie,  "The <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m062/m062050/m0620506.png" /> programming language" , Prentice-Hall  (1978)</TD></TR></table>
+
<table><TR><TD valign="top">[a1]</TD> <TD valign="top">  B.W. Kernighan,  D.M. Ritchie,  "The $C$ programming language" , Prentice-Hall  (1978)</TD></TR></table>

Latest revision as of 13:50, 25 April 2014

A programming language that allows one, when compiling programs, to take into account the peculiarities of the systems of commands and representation of information in the object computer. Machine-oriented languages, in contrast to universal problem-oriented languages (cf. Problem-oriented language) that realize a mapping of the set $P$ of input programs into the set $M$ of machine programs, try to map $P$ onto $M$.

The simplest machine-oriented languages are assemblers, which, while completely preserving the structure of the machine programs, allow one to use a symbolic notation for commands and memory addresses, as well as to collect programs from a couple of separately-described parts. For additional possibilities concerning substitutions in the text and other simple transformations when compiling the text of programs, one needs macro-assemblers. Machine-oriented languages of a higher level, like universal languages, have a phrase-structure allowing for compound objects and defining operations. This structure also contains additional means for describing elementary objects and basic operations in terms of the machine structure.

References

[1] G. Struble, "Assembler language programming: the IBM system/360" , Addison-Wesley (1969)
[2] P. Brown, "Macro processors and techniques for portable software" , Wiley (1974)
[3] V.L. Katkov, A.F. Rar, "Programming in Epsilon" , Novosibirsk (1972) (In Russian)


Comments

A typical contemporary example of a higher-level programming language which supports access to machine-level features is the language $C$, which is widely used for general programming in a UNIX environment.

References

[a1] B.W. Kernighan, D.M. Ritchie, "The $C$ programming language" , Prentice-Hall (1978)
How to Cite This Entry:
Machine-oriented language. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Machine-oriented_language&oldid=13924
This article was adapted from an original article by A.P. Ershov (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article