Continuing with the basic foundations of programming today we are going to play one of the most used concepts that are algorithms and their representation as a programming language, if you have not read the first part I recommend you see it. See Part One
When we mentioned previously what a program means, we refer to a sequence of instructions or steps to complete a goal, because algorithms is the way to represent the set of steps. It sounds a little confusing at first to distinguish between the two, but the simplest way to differentiate between them is that the program is the result of algorithmically representing the objectives to be completed.
An algorithm represents the sequential instructions of the program in a code or natural language.
The computer, like all living beings, we have ways of interacting with the world around us, through language we can share ideas, in the case of the computer uses language as a mechanism to complete instructions, a program interacts with the computer through logic gates represented in binary.
Representing a set of logic gates in a natural language is the goal of an algorithm.
When we speak of logic gates, is the way in which the electronic circuits of a computer activate or interrupt the flow of current to carry out a process, this form of communication is represented mathematically as binary numbers (zeros and ones).
The zero represents a logic gate deactivated or without current flow and the one that is activated, in computer science it is known a binary as bits and represents the minimum unit of processing, the basic memory unit is one byte (8 bits), this It is an octet of binaries.
When we describe an algorithm as programmers we describe the steps in a natural language, for this the following techniques of representation of an algorithm are used.
A programming language is a language designed to describe the set of consecutive actions that a team must execute. Therefore, a programming language is a practical way for human beings to give instructions to a team.
Every language has a syntax and semantics that together build the language.
Rules that determine how elements of the language can be constructed and sequenced, it is necessary to know these rules in order to create a set of instructions correctly, the most common elements of the programming syntax are:
Each programming language has rules for the elements mentioned above, but does not mean that they are all mandatory.
It is the meaning of each element of language.
It is a low-level language, dependent on the machine that represents, by means of hexadecimal code, instructions to the CPU, memory addresses or data, it must be borne in mind that a 1 byte equals 2 hexadecimal digits, so the language interacts between hexadecimal pairs.
The syntax of the machine language is represented as follows:
<statement> <argument>
The most common instructions:
All high and medium level programming languages must translate their source code into machine language.
It is a medium level language, it represents the machine language through verbs that describe the instruction towards the processor.
The syntax is equal to the machine language except that the instruction is represented by an infinitive verb in the English language.
The most common instructions:
This type of programming language replaces the machine language and is used in the programming of microcontrollers and chips.
They are a way to represent low level language in a more natural and mathematical language, it is much more readable by adding more abstraction in its procedures.
High-level languages require a translator that is capable of generating a low-level language for this use compilers and interpreters.
Among the high level programming languages we have:
I hope you liked this content, for the next tutorial we will talk about high level languages: compilers and interpreters. Do not forget to vote to make this project grow and subscribe if you want to keep getting new content.