High- level programming language - Wikipedia, the free encyclopedia. In computer science, a high- level programming language is a programming language with strong abstraction from the details of the computer. In comparison to low- level programming languages, it may use natural language elements, be easier to use, or may automate (or even hide entirely) significant areas of computing systems (e. The amount of abstraction provided defines how . The first really widespread high- level language was Fortran, a machine independent development of IBM's earlier Autocode systems. Welcome to thefreecountry.com's collection of free programming resources, free webmasters' resources, free security resources and free utilities. Free Programmers' Resources. Bjarne Stroustrup, a Computer Scientist from Bell Labs, was the designer and original implementer of C++ (originally named 'C with Classes') during the 1980s as an enhancement to the C programming language. Free Java compilers, free Java programming and tools. Links to free Java compilers and tools. In computer science, a high-level programming language is a programming language with strong abstraction from the details of the computer. In comparison to low-level programming languages, it may use natural language elements. A Labautopedia compendium of words and terms related to computer science and computer programming. Click on linked terms for more detail. Refer to the Contributing section for author information. This list is incomplete; you. Do we really need another programming language? There is certainly no shortage of choices already. Between imperative languages, functional languages, object-oriented languages, dynamic languages, compiled languages.Algol, defined in 1. European and American computer scientists, introduced recursion as well as nested functions under lexical scope. It was also the first language with a clear distinction between value and name- parameters and their corresponding semantics. During roughly the same period Cobol introduced records (also called structs) and Lisp introduced a fully general lambda abstraction in a programming language for the first time. Features. Rather than dealing with registers, memory addresses and call stacks, high- level languages deal with variables, arrays, objects, complex arithmetic or boolean expressions, subroutines and functions, loops, threads, locks, and other abstract computer science concepts, with a focus on usability over optimal program efficiency. Unlike low- level assembly languages, high- level languages have few, if any, language elements that translate directly into a machine's native opcodes. Other features, such as string handling routines, object- oriented language features, and file input/output, may also be present. Abstraction penalty. Abstraction penalty is the border that prevents high- level programming techniques from being applied in situations where computational limitations, standards conformance or physical constraints require access to low- level architectural resources (fi, response time(s), hardware integration). High- level programming exhibits features like more generic data structures/operations, run- time interpretation, and intermediate code files; which often result in execution of far more operations than necessary, higher memory consumption, and larger binary program size. In many cases, critical portions of a program mostly in a high- level language can be hand- coded in assembly language, leading to a much faster, more efficient, or simply reliably functioning optimised program.
However, with the growing complexity of modern microprocessor architectures, well- designed compilers for high- level languages frequently produce code comparable in efficiency to what most low- level programmers can produce by hand, and the higher abstraction may allow for more powerful techniques providing better overall results than their low- level counterparts in particular settings. This facilitates executing a program written in such a language on any computing system with compatible support for the Interpreted or . High- level languages can improved as their designers develop improvements. In other cases, new high- level languages evolve from one or more others with the goal of aggregating the most popular constructs with new or improved features. An example of this is . In contrast, low- level programs rarely survive the system architecture which they were written for without major revision. This is the engineering 'trade- off' for the 'Abstraction Penalty'. Relative meaning. Some decades ago, the C language, and similar languages, were most often considered . Today, many programmers might refer to C as low- level, as it lacks a large runtime- system (no garbage collection, etc.), basically supports only scalar operations, and provides direct memory addressing. It, therefore, readily blends with assembly language and the machine level of CPUs and microcontrollers. Assembly language may itself be regarded as a higher level (but often still one- to- one if used without macros) representation of machine code, as it supports concepts such as constants and (limited) expressions, sometimes even variables, procedures, and data structures. Machine code, in its turn, is inherently at a slightly higher level than the microcode or micro- operations used internally in many processors. Execution modes. A program called an interpreter reads each program statement, following the program flow, then 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 of the behavior of a language, compared to the other two variants listed here. Compiled When code written in a language is compiled, its syntax is 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 . See assembly language. Intermediate representations When code written in 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 may be in a form such 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. Source- to- Source Translated or Trans- compiled. Code written in a language may be translated into terms of a lower- level programming language for which native code compilers are already widely available. Java. Script and the C programming language are common targets for such translators. See Coffee. Script, Chicken Scheme, and Eiffel as examples. Specifically, the generated C and C++ code can be seen (as generated from the Eiffel programming language when using the Eiffel. Studio IDE) in the EIFGENs directory of any compiled Eiffel project. Rather, implementations of language behavior use interpretation or compilation. For example, Algol 6. Fortran have both been interpreted (even though they were more typically compiled). Similarly, Java shows the difficulty of trying to apply these labels to languages, rather than to implementations; Java is compiled to bytecode and the bytecode is subsequently executed by either interpretation (in a JVM) or compilation (typically with a just- in- time compiler such as Hot. Spot, again in a JVM). Moreover, compilation, trans- compiling, and interpretation are not strictly limited just a description of the compiler artifact (binary executable or IL assembly). High- level language computer architecture. This is known as a high- level language computer architecture . Introduction to Computers. Russell Square London WC1: Faber and Faber Limited. The 'high' level programming languages are often called autocodes and the processor program, a compiler. Introduction to Computers. Russell Square London WC1: Faber and Faber Limited. Two high level programming languages which can be used here as examples to illustrate the structure and purpose of autocodes are COBOL (Common Business Oriented Language) and FORTRAN (Formular Translation). IEEE Annals of the History of Computing, vol. Several successors, including Algol. W, Algol. 68, Simula, Pascal, Modula and Ada therefore included reference- parameters (The related C- language family instead allowed addresses as value- parameters).^Surana P (2. Procedural Programming Languages. In Blieberger; Strohmeier. Proceedings - 7th International Conference on Reliable Software Technologies - Ada- Europe'2.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
January 2017
Categories |