Fortran - Fortran Fortran (also FORTRAN) is a programming language originally developed in the 1950s and still in use today. The name is short for "Formula Translation". Early versions of the language were known as FORTRAN, but the capitalization has been dropped in newer revisions beginning with Fortran 90. The official language standards now refer to the language as "Fortran". Fortran is mainly used for scientific computing and numerical analysis. Although originally a procedural language, recent versions of Fortran have included some features to support object-oriented programming. The first FORTRAN compiler was developed for the IBM 704 in 1954-57 by an IBM team led by John W. Backus. This was an optimizing compiler, because the authors reasoned that no one would use the language if its performance was.
KDevelop - many other IDEs, KDevelop does not include a compiler, instead relying on gcc to produce executable code. The new version 3.0 ("Gideon"), is currently under development, and supports many more programming languages like Ada, Bash, Fortran, Java, Pascal, Perl, Python, Ruby and SQL..
J programming language - Hui, is a synthesis of APL (also by Iverson) and FP, the functional programming language created by John Backus (of Fortran, Algol, and BNF fame). To avoid the problems faced by the special character set of APL, J requires only the basic ASCII character set, resorting to the use of dot and colon characters to extend the meaning of the basic characters available. J is a very terse and powerful language, and is often found to be useful for math programming, especially when performing operations on matrices. It also offers a flexible namespace scheme ("locales") which can be used as a framework for OOP. Since J has no explicit print statement, the Hello World program would be simply: "Hello world".
John Backus - 1924) is an American computer scientist, notable as the inventor of the Fortran programming language, the first high-level language to achieve widespread use, and the Backus-Naur form almost universally used to define language syntax. He received a Turing Award in 1977 for these two seminal achievements. Backus was born in Philadelphia, Pennsylvania but grew up in Wilmington, Delaware. He studied at the Hill School in Pottstown, Pennsylvania, and was apparently not a diligent student. After entering the University of Virginia to study chemistry, and failing that, he then joined the US Army and began medical training, which he also dropped out of after nine months. After moving to New York City he initially took training as a radio technician and discovered an interest in mathematics. He graduated from Columbia University with.
Imperative programming - value to memory. Looping statements allow a sequence of statements to be executed multiple times. Loops can either execute the statements they contain a predefined number of times, or they can execute them repeatedly until some condition changes. Conditional branching statements allow a block of statements to be executed only if some condition is met. Otherwise, the statements are skipped and the execution sequence continues from the statement following the block. Unconditional branching statements allow the execution sequence to be transferred to some other part of the program. These include the jump, called "goto" in many languages, and the subprogram, or procedure, call. The earliest imperative languages were the machine languages of the original computers. In these languages, instructions were very simple, which made hardware implementation easier, but hindered the creation.
Hello world program - 1.1 ABC 1.2 Ada 1.3 AmigaE 1.4 APL 1.5 Assembly language 1.5.1 Accumulator-only architecture: DEC PDP-8, PAL-III assembler 1.5.2 Accumulator + index register machine: MOS 6502, CBM, ca65 asm 1.5.3 Accumulator/Index microcoded machine: Data General Nova, RDOS 1.5.4 Expanded accumulator machine: Intel x86, MS-DOS, TASM 1.5.5 General-purpose-register CISC: DEC PDP-11, RT-11, MACRO-11 1.5.6 CISC: VAX, VMS, MACRO32 1.6 AWK 1.7 BASIC 1.7.7 MS BASIC (traditional, unstructured) 1.7.8 TI-BASIC 1.7.9 Structured BASIC 1.8 BCPL 1.9 C 1.10 C++ 1.11 C# 1.12 Clean 1.13 CLIST 1.14 COBOL 1.15 Common Lisp 1.16 Eiffel 1.17 Erlang 1.18 Forth 1.19 Fortran 1.20 Haskell 1.21 Iptscrae 1.22 Java 1.23 Logo 1.24 Lua 1.25 MIXAL 1.26 MSDOS batch 1.27 OCaml 1.28 OPL 1.29 Pascal 1.30 Perl 1.31 PHP 1.32 Pike 1.33 PL/I 1.34 Python 1.35 REXX, also NetRexx.
How to program in object-oriented languages - as a bottom-up approach. This model fits very well with procedural programming, even more with non-modular languages, such as Fortran and Basic. Object-oriented concepts, however, should be learned and used in a top-down approach, starting from modeling objects and object interactions. Although some object-oriented languages follow the object metaphor down to the statement level, like Smalltalk, the most widely known languages of today, i.e. C++, Object Pascal and Java follow an almost procedural notation. So, to devise a good object-oriented program, one should first devise an effective model and later implement the model in the chosen language..
Generational list of programming languages - Coyote programming language Pike programming language C++ C# CFM Objective C QuakeC COBOL DIBOL WATBOL CORAL FORTH FORTRAN FORTRAN II FORTRAN 66 FORTRAN 77 FORTRAN IV RATFOR WATFOR WATFIV ECMAScript (JavaScript; originally, LiveScript) Java J# Joy Lisp AutoLISP Common Lisp Emacs Lisp Logo Scheme Pico Guile ML Ocaml (Objective CAML) SML MUMPS Caché ObjectScript OCCAM PL/1 PL/M PL/M-86 PL/c SP/k Progress PROLOG PROLOG II, III, IV CLP(R), CLP(FD) Today BuildProfessional.
GNU Compiler Collection - that EGCS was eventually "blessed" as the official version of GCC in April 1999. GCC has been adopted as the main compiler used to build and develop for a number of systems, including GNU/Linux, the BSDss, Mac OS X, NeXTSTEP, and BeOS. As of version 3.2, the standard compiler release includes front ends for: Ada (GCC for Ada aka GNAT) C C++ (GCC for C++ aka G++) Fortran (GCC for Fortran aka G77) Java Objective-C Treelang A front end for CHILL was previously included, but has been dropped due to lack of maintenance. Pascal, Modula-2, Modula-3, Mercury and Objective-C++ frontends also exist. GCC target processors (as of version 3.2) include: Alpha ARM H8/300 System/370, System 390 X86 and X86-64 IA-64 "Itanium" Motorola 68000 Motorola 88000 MIPS PA-RISC PDP-11 PowerPC SuperH SPARC.
GNU Debugger - portable debugger which runs on many Unix-like systems and works for many programming languages, including C, C++, and FORTRAN. It is free software released under the GNU General Public License. GDB offers extensive facilities for tracing and altering the execution of computer programs. The user can monitor and modify the values of programs' internal variables, and even call functions independently of the program's normal behavior. The debugger does not contain its own graphical user interface, and defaults to a command-line interface. However, several front-ends have been built for it, such as DDD and the "GUD mode" in Emacs. These offer facilities similar to debuggers found in integrated development environments. Some other debugging tools have been designed to work with GDB, such as memory leak detectors. GDB target processors (as of 2003).
Goto - for transfer of control from one part of a program to another, and most compilers will translate other flow control statements into GOTOs. GOTO is found in FORTRAN, Algol, COBOL, SNOBOL, BASIC, C, C++, Pascal and many other languages, particularly assembly languages. In the assembly languages, the GOTO command is usually called BRA (from "branch"), JMP or JUMP, and is often the only way of organizing program flow. However GOTO is not found in all programming languages. Certain languages, such as Java, do not contain a GOTO statement. Unlike a function call, a GOTO does not demand any preparation or restructuring of the code. Because of that, it becomes very easy to produce inconsistent, incomplete and generally unmaintainable spaghetti code. Consequently, as structured programming became more prominent in the 1960s and.
FAP - FAP FORTRAN Assembly Program (FAP) was a macro assembler for the IBM 704, 709, 7090, and 7094 computers. Its pseudo-operation BSS, used to reserve memory, is the origin of the BSS section still used today for space in memory that is reserved, but does not have to be saved in the executable image. External Links http://www.frobenius.com/fap.htm bss.
Free-form language - languages descend from Algol, including C, Pascal, and Perl. These are also structured programming languages, which is sometimes thought to go along with the free-form syntax: Earlier imperative programming languages such as Fortran used particular columns for line numbers, which structured languages don't use or need. Lisp languages are also free-form, although they do not descend from Algol. One recent language which has abandoned parts of the free-form idiom is Python, which uses indentation with whitespace to delimit program blocks. Some critics regard this as a throwback, and find Python text harder to read and edit as it lacks the obvious punctuation of C or Pascal. Python aficionados, however, find that it improves readability: since indentation is commonly used in structured languages to make block structure visible, Python's use of whitespace.
Egon Zakrajsek - was one of the pioneers of computer science in Slovenia. He became an expert about the first computers of the University of Ljubljana, the Zuse Z-23 and its successor the IBM 1130. Later on he participated in the development of programming languages, tools and operating systems. He wrote textbooks and manuals for them simultaneously: for Z-23 assembler, Algol, Fortran, Algol 68, Pascal, for domestic structran. In 1982 he set off for United States and he became the manager of the programming equipment at the firm Cromemco. In 1994 he returned to homeland, where he occupied professorship again. With his advocacies about the C and open operating systems, that is unix and linux, he helped to modernize the lessons of computer science. He became an expert again for TeX, LaTeX and Matlab..
EGCS - other than C - were free to develop their own fork of the compiler. Having multiple forks proved inefficient and unwieldy, however, and the difficulty in getting work accepted by the official GCC project was greatly frustrating for many. In 1997, a group of developers formed EGCS, to merge several experimental forks into a single project. Projects merged included g77 (Fortran), PGCC (Pentium-optimised GCC), many C++ improvements and many new architectures and operating system variants. EGCS development proved sufficiently more vital than GCC development that the FSF officially halted development on their GCC 2.x compiler and appointed the EGCS project as the official GCC maintainers in April 1999. Furthermore, the project explicitly adopted the "bazaar" model over the "cathedral" model..
El Camino Real (computers) - (computers) El Camino Real (computers): In the FORTRAN language, a 'real' quantity is a number typically precise to seven significant digits, and a `double precision' quantity is a larger floating-point number, precise to perhaps fourteen significant digits (other languages have similar 'real' types). When a hacker from MIT, Guy L. Steele, visited Stanford in 1976, he remarked what a long road El Camino Real was. Making a pun on 'real', he started calling it 'El Camino Double Precision' -- but when he was told that the road was hundreds of miles long (resulting in extremely large street address numbers), he renamed it 'El Camino Bignum' ("bignum" is LISP jargon for an indefinite-precision integer), and that name has stuck. In recent years, the synonym "El Camino Virtual" has been reported as an.
Yorick - has become the most lasting embodiment of this idea. Yorick is the name of a vicar in Laurence Sterne's novel Tristram Shandy. The figure of Yorick is often taken for a rueful self-portrait. Yorick is also an interpreted programming language designed for numerics, graph plotting and steering large scientific simulation codes. It is quite fast due to array syntax, and extensible via C or Fortran routines. It was created in 1996 by David Munro. Visit the Yorick Homepage.
Extents of an array - Extents of an array In Fortran and other high level languages, the number of elements in each dimension of an array..
Dynamic programming language - an abstract class of which it purports to belong. For methods to come and go from existence, a virtual machine is handling then run-time lookup of methods, the binary code is heavily self-modifying, or some sort of method dispatch logic is invoked. Smalltalk, Scheme, Lisp, Dylan, Python, Perl and many other languages fit this category. C, C++, Java, and FORTRAN do not, as languages, though it is always possible to build layers on top of a language. The article is originally from Perl Design Patterns Book.
DOS/BATCH 11 - DOS/BATCH 11 came with XXDP, a diagnostics and monitor program for the PDP-11. Like other Digital operating systems, DOS/BATCH 11 also had a FORTRAN compiler..
