Деревоподібні формати Адресного програмування
Loading...
Date
2021-12-10
Authors
Ющенко, Юрій
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
В Адресному програмуванні було введено поняття опосередкованої адресації вищих рангів (Pointers), яка дає змогу довільним чином з’єднувати комірки оперативної пам’яті комп’ютера. Засадами цього з’єднання є стандартне слідування адрес комірок в оперативній пам’яті та адресне слідування, яке визначається опосередкованою адресацією. Використання двох відношень дає можливість визначати довільне об’єднання комірок пам’яті з будь-яким їх змістом. Машинні команди комп’ютера "Київ" надають прямий доступ до елементу "списку" за його порядковим номером. У статті на прикладах однозв’язних "списків" продемонстровано особливості деревоподібних форматів та їх відмінності від абстрактних типів даних. Стаття відкриває нову галузь теоретичних досліджень, метою яких є аналіз доцільності включення у сучасні мови програмування окремих можливостей Адресного програмування.
In the Address Programming Language (1955), the concept of indirect addressing of higher ranks (Pointers) was introduced, which allows the arbitrary connection of the computer’s RAM cells. This connection is based on standard sequences of the cell addresses in RAM and addressing sequences, which is determined by the programmer with indirect addressing. Two types of sequences allow programmers to determine an arbitrary connection of RAM cells with the arbitrary content: data, addresses, subroutines, program labels, etc. Therefore, the formed connections of cells can relate to each other. The result of connecting cells with the arbitrary content and any structure is called tree-shaped formats. Tree-shaped formats allow programmers to combine data into complex data structures that are like abstract data types. For tree-shaped formats, the concept of "review scheme" is defined, which is like the concept of "bypassing" trees. Programmers can define multiple overview diagrams for the one tree-shaped format. Programmers can create tree-shaped formats over the connected cells to define the desired overview schemes for these connected cells. The work gives a modern interpretation of the concept of tree-shaped formats in Address Programming. Tree-shaped formats are based on "stroke-operation" (pointer dereference), which was hardware implemented in the command system of computer "Kyiv". Group operations of modernization of computer "Kyiv" addresses accelerate the processing of tree-shaped formats and are designed as organized cycles, like those in high-level imperative programming languages. The commands of computer "Kyiv", due to operations with indirect addressing, have more capabilities than the first high-level programming language – Plankalkül. Machine commands of the computer "Kyiv" allow direct access to the i-th element of the "list" by its serial number in the same way as such access is obtained to the i-th element of the array by its index. Given examples of singly linked lists show the features of tree-shaped formats and their differences from abstract data types. The article opens a new branch of theoretical research, the purpose of which is to analyze the expe- diency of partial inclusion of Address Programming in modern programming languages.
In the Address Programming Language (1955), the concept of indirect addressing of higher ranks (Pointers) was introduced, which allows the arbitrary connection of the computer’s RAM cells. This connection is based on standard sequences of the cell addresses in RAM and addressing sequences, which is determined by the programmer with indirect addressing. Two types of sequences allow programmers to determine an arbitrary connection of RAM cells with the arbitrary content: data, addresses, subroutines, program labels, etc. Therefore, the formed connections of cells can relate to each other. The result of connecting cells with the arbitrary content and any structure is called tree-shaped formats. Tree-shaped formats allow programmers to combine data into complex data structures that are like abstract data types. For tree-shaped formats, the concept of "review scheme" is defined, which is like the concept of "bypassing" trees. Programmers can define multiple overview diagrams for the one tree-shaped format. Programmers can create tree-shaped formats over the connected cells to define the desired overview schemes for these connected cells. The work gives a modern interpretation of the concept of tree-shaped formats in Address Programming. Tree-shaped formats are based on "stroke-operation" (pointer dereference), which was hardware implemented in the command system of computer "Kyiv". Group operations of modernization of computer "Kyiv" addresses accelerate the processing of tree-shaped formats and are designed as organized cycles, like those in high-level imperative programming languages. The commands of computer "Kyiv", due to operations with indirect addressing, have more capabilities than the first high-level programming language – Plankalkül. Machine commands of the computer "Kyiv" allow direct access to the i-th element of the "list" by its serial number in the same way as such access is obtained to the i-th element of the array by its index. Given examples of singly linked lists show the features of tree-shaped formats and their differences from abstract data types. The article opens a new branch of theoretical research, the purpose of which is to analyze the expe- diency of partial inclusion of Address Programming in modern programming languages.
Description
Keywords
вказівники, Pointers, dereference, dereference operator, indirection, multiply indirection, програмування, історія ІТ, історія програмування, архітектура комп’ютерів, деревоподібні формати, абстрактні типи даних, списки, масиви, Адресна мова програмування, Адресне програмування, Ф-операція, комп’ютер "Київ", ЕОМ "Київ", стаття, programming, pointers, dereference, dereference operator, indirection, multiply indirection, tree-shaped formats, Address Programming Language, Address Programming, IT history, programming history, computer architecture, abstract data types, lists, arrays, Ф-operation, computer "Kyiv", article
Citation
Ющенко Ю.О. Деревоподібні формати Адресного програмування / Ющенко Ю. О. // Наукові записки НаУКМА. Комп'ютерні науки. - 2021. - Т. 4. - С. 78-87. - https://doi.org/10.18523/2617-3808.2021.4.78-87