Preview

Evolution of Programming Languages

Good Essays
Open Document
Open Document
452 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Evolution of Programming Languages
The desire to use the power of information processing efficiently in problem solving has pushed the development of newer programming languages. The evolution of programming languages is typically discussed in terms of generation of languages. The first generation of Programming languages is machine language, which required the use of binary symbols (0s and 1s). Because this is the language of the CPU, text file that are translated into binary sets can be read by almost every computer system platform. Developers of programming languages attempted to overcome some of the difficulties inherent in machine language by replacing the binary digits with symbols that programmers could more easily understand. These second-generation languages use codes like A for add, MCV for move, and so on. Another term for these languages in assembly language, which comes from the programs (called assemblers) used to translate it into machine code. Systems software programs such as OSs and utility programs are often written in assembly languages. Third-Generation languages continued the trend toward greater use of symbolic code and away from specifically instructing the computer how to complete an operation. BASIC, COBOL, C and FORTRAN are examples of third-generation languages that use English and Assembly languages because it more closely resembles everyday human communication and understanding. With third-generation and higher-level programming languages, each statement in the languages translates into several instruction in machine language. A special software program called a compiler converts the programmers’s source code into the machine-languages instructions consisting of binary digits. A compiler creates a two-stage process for program execution. First, it translates the program into a machine language; second, the CPU executes that program. Another approach is to use an interpreter, which is a language translator that converts each statement in a programming language into

You May Also Find These Documents Helpful

  • Good Essays

    pt1420 exam review

    • 738 Words
    • 3 Pages

    What is used to translate high level language programs to machine language (or machine code)? Compiler…

    • 738 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Compter Science

    • 819 Words
    • 4 Pages

    Programming statements in a low-level language will be close to natural language and will use standard mathematical notation.…

    • 819 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    •Name and describe the only language that computers understand and explain how the instructions that people write for computers get into that form…

    • 322 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    To apply the stored-program concept, central processing unit (CPUs) are designed to recognize instructions encoded as bit patterns. This collection of instructions along with the encoding system is called the machine language. An instruction expressed in this language is called a machine-level instruction or, more commonly, a machine instruction.…

    • 458 Words
    • 2 Pages
    Good Essays
  • Better Essays

    Assembly language enables programmers to relate op codes using symbolic names in place of numbers to perform an instruction or input a piece of data. Programmers can inscribe op codes using purposeful words like JUMP, CLEAR, and ADD as an alternative to cryptic binary codes consisting of series of 0s and 1s. An example of assembly language, machine language and its meaning are listed in the book called, “Invitation to Computer Science” (Schneider & Gersting, 2013, pp. 285, fig. 6.5). In figure 6.5, assembly language is clearly easier to comprehend than machine language, which makes assembly language user friendly.…

    • 2002 Words
    • 9 Pages
    Better Essays
  • Satisfactory Essays

    Copyright © 2012 Pearson Education, Inc. 0-5 Terminology • Machine instruction: An instruction (or command) encoded as a bit pattern d) d d tt recognizable by the CPU • Machine language: The set of all instructions recognized by a machine Copyright © 2012 Pearson Education, Inc. 0-6 3 Machine Language Philosophies • Reduced Instruction Set Computing (RISC) – Few, simple, efficient, and fast instructions – Examples: PowerPC from Apple/IBM/Motorola and ARM • Complex Instruction Set Computing (CISC) –…

    • 783 Words
    • 4 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Ethics

    • 399 Words
    • 2 Pages

    * The introduction of higher-level programming languages change computing where programs can be moved from one manufacturer's computer to another ,which led to an increasing number of people writing the computer programs .…

    • 399 Words
    • 2 Pages
    Satisfactory Essays
  • Powerful Essays

    The following information will introduce general knowledge in basic programming concepts. It shall discuss basic types of computer programming languages as-well-as program development. There are three basic types of computer programming languages that will be discussed in a simple and easy to understand manner. We shall also describe the program development cycle and discuss why it is important to use a structured and organized process to create a computer programming language.…

    • 1318 Words
    • 6 Pages
    Powerful Essays
  • Powerful Essays

    Which of the following is NOT considered to be one of the three basic features of a…

    • 1228 Words
    • 5 Pages
    Powerful Essays
  • Satisfactory Essays

    the programmer creates ad design for the program, which starts by asking the client what the prograame is supposed to accomplish .…

    • 414 Words
    • 4 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Computer Programming 2 Programming Paradigm Procedural Programming   style of programming in which the programming task is broken down into a series of operations (called procedures) applied to data (or data structures) C and Pascal Object-Oriented Programming    extension of procedural programming breaks down a programming task into a series of interactions among different entities or objects Java, C++, and Smalltalk Introduction to OOP * Property of STI Page 1 of 15 Computer Programming 2 Object-Oriented Programming type of programming in which programmers define not only the data structures, but also the types of operations (methods) that can be applied to the data structure enables programmers to create modules that do not need to be changed when a new type of object is added most widely used paradigm instead of focusing on what the system has to do, focus on:  what objects the system contains  how they interact towards solving the programming problem Introduction to OOP * Property of STI Page 2 of 15 1 _________________ ___________________ ___________________ ___________________ ___________________ ___________________ ___________________ ___________________ ___________________ ___________________ ___________________ ___________________ 2 _________________ ___________________ ___________________ ___________________ ___________________ ___________________ ___________________ ___________________ ___________________ ___________________ ___________________ ___________________ Computer Programming 2 Object-Oriented Programming Illustration of OOP Introduction to OOP * Property of STI Page 3 of 15 Computer Programming 2 Object-Oriented Programming Advantages of OOP over conventional approaches: …

    • 1005 Words
    • 5 Pages
    Satisfactory Essays
  • Better Essays

    Because the first generation languages were regarded as very user unfriendly people set out to look for something faster and easier to understand. The result was the birth of the second generation languages (2GL) at the mid of the 1950's. These generation made use of symbols and are called assemblers. An assembler is a program that translates symbolic instructions to processor instructions.…

    • 948 Words
    • 3 Pages
    Better Essays
  • Powerful Essays

    Languages, grammars and automata theory are all related to computer applications. Grammar is the rule for language structure regardless of the meaning. For computer programming languages context free grammar (CFG) is commonly used. Formal language as opposed to natural language must be used with computer applications because natural language is too vague for computer applications. Automata is a way to test an expression to determine if it is part of the language (Pfeifer, 2005).…

    • 992 Words
    • 4 Pages
    Powerful Essays
  • Good Essays

    Writing a computer is tedious and time consuming task. There are some specialized tools for helping in implementation of various phases of compilers. These tools are called compiler construction tools. These tools are also called compiler-compiler, compiler-generator, or translator writing system.…

    • 2111 Words
    • 6 Pages
    Good Essays
  • Good Essays

    Compiler Construction

    • 376 Words
    • 3 Pages

    Compiler-a program that translates an executable program in one language into an executable program in another language…

    • 376 Words
    • 3 Pages
    Good Essays