We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published bySantiago Caufield
Modified over 4 years ago
Dr. Ken Hoganson, © August 2014 Programming in R COURSE NOTES 2 Hoganson Language Translation
Dr. Ken Hoganson, © August 2014 Computer is all 0s and 1s, which is hard for humans. So we have created languages that are easier for us (humans) to work with. Human-friendly languages require computer time to translate into computer-executable programs. Ongoing trend since computer was created: make better human interfaces to the machine, using the ever increasing power of the computer to do the translation work “behind the scenes”. Thing GUI interfaces and virtual-reality interfaces. Language Translation
Dr. Ken Hoganson, © August 2014 Machine code – the bottom line in programming. Machine code instructions are divided into fields, and the instruction has a specified format. Simple example: Machine Code Just a taste
Dr. Ken Hoganson, © August 2014 This instruction has four fields: –Instruction type (two bits) –Operation code (6 bits) –Register operand 1 (4 bits) –Register operand 2 (4 bits) 16-bit (two-byte) instruction Machine Code
Dr. Ken Hoganson, © August 2014 Two bits for instruction type. How many types of instructions are possible within this format? Operation Code is 6 bits. How many types of operations are possible for a format? The register operands are 4 bits each. How many different registers can be indicated with 4 bits? (similar to addressing) Machine Code
Dr. Ken Hoganson, © August 2014 This instruction format is a Register-Register instruction. That means that it takes its inputs from two register operands. The operation is performed on those two data elements, and the result goes back into the register specified by the first register operand. Machine Code
Dr. Ken Hoganson, © August 2014 Machine code is not hard, just painful and slow to work with. –Register-Register instruction format is ‘00’ –Op Code to add two registers is ‘010000’ –Add contents of register 2 specify ‘0010’ –Add contents of register 4 specify ‘0100’ Complete instruction in 0s and 1s: 00 010000 0010 0100 Machine Code Instruction Do you remember where the result of the addition is stored?
Dr. Ken Hoganson, © August 2014 Working with 0s and 1s is hard – and humans are prone to making errors. Languages have been created to make programming easier. Assembly language is the lowest level language. –Uses mnemonics and abbreviations. Our add two register instruction: –00 010000 0010 0100 Can be represented (1 to 1) with an assembly instruction: –ADR R2 R4 – AD d R egisters R2 and R4, result in R2 Assembly Language
Dr. Ken Hoganson, © August 2014 Assembly language is a big improvement over machine code. Assembly is translated by an assembler program to 0s and 1s that the computer can work with. More powerful (and human-readable) languages have been created (which must also be translated to 0s and 1s). These are called High Level Languages Basic, Fortran, C, C++, C#, R, etc. High-Level Languages
Dr. Ken Hoganson, © August 2014 Our add two register instruction: –00 010000 0010 0100 In assembly language: –ADR R2 R4 – AD d R egisters R2 and R4, result in R2 In a high level language might look like: –Number1 = Number1 + Number2 –Better? High-Level Languages
Dr. Ken Hoganson, © August 2014 ADR R2 R4 High level language might look like: –Sum = Number1 + Number2 But this high-level language has another type of translation embedded : memory addressing –Number1, Number2, and SUM are data values stored in memory, not registers. –The values for Number1 and Number 2 must be first loaded from memory into registers. –Then the add operation can be performed –Then the result stored back to memory in SUM. Additional machine-level instructions needed to do this one high-level language instruction Many-to-1 translation
Dr. Ken Hoganson, © August 2014 High-level language instructions must be translated/converted to machine code before the computer can run them. This process requires a translation program: –Compiler –Interpreter –(Assembler was used for assembly language) Languages like C, C++, Cobol, Fortran and Pascal are all compiled languages. High-level Language Translation
Dr. Ken Hoganson, © August 2014 Compiler takes the high-level language program (as text) as its input. It produces the machine code version of the program as its output. It does not change the high-level program, the machine code program is a new file. Compiler
Dr. Ken Hoganson, © August 2014 Interpreter Some languages like BASIC and VisualBASIC are interpreted languages, not compiled. The Interpreter does not convert the entire program all at once. Instead, it converts instructions one at a time, and has the computer execute each instruction. Slower, because every time the program is run, it must be interpreted.
Dr. Ken Hoganson, © August 2014 A third and more recent way to translate high-level programs is with a Virtual Machine (or byte-code interpreter). Java is an example. Separates translation into two steps. –Convert the program to “byte-code” –The “byte-code” is then interpreted by a virtual machine. Virtual Machine
Dr. Ken Hoganson, © August 2014 The virtual machine/byte-code interpreter makes programs transportable and device- independent. Converted byte-code can move over the internet. Virtual Machine
Dr. Ken Hoganson, © August 2014 Each different processor/machine needs its own virtual machine, which will be different from CPU to CPU. Different because of different machine codes and operating systems. Virtual Machine
Dr. Ken Hoganson, © August 2014 A structured programming language (no objects or agents) With extensions for Big Data – functions and techniques for manipulating large data sets using parallel opportunities. An interpreted language, running on a Virtual Machine written in a language called “S”. S code is compiled, using a complier for the platform. The “R” interpreter is compiled “S” code. “R” is
Dr. Ken Hoganson, © August 2014 End Of Today’s Lecture. End of Lecture
compilers and interpreters
Suppose for a moment that you were asked to perform a task and were given the following list of instructions to perform:
Copyright © 2002 W. A. Tucker1 Chapter 1 Lecture Notes Bill Tucker Austin Community College COSC 1315.
1 Lecture-2 CSIT-120 Spring 2001 Revision of Lecture-1 Introducing Computer Architecture The FOUR Main Elements Fetch-Execute Cycle A Look Under the Hood.
The Binary Machine Modern high-level programming languages are designed to make programming easier. On the other end, the low level, all modern digital.
Computer Concepts 5th Edition Parsons/Oja Page 546 CHAPTER 11 Software Engineering Section A PARSONS/OJA Computer Programming.
1 Lecture 1 Getting ready to program Hardware Model Software Model Programming Languages The C Language Software Engineering Programming.
CSCE 121, Sec 200, 507, 508 Fall 2010 Prof. Jennifer L. Welch.
Chapter 7 Low-Level Programming Languages. 2 Chapter Goals List the operations that a computer can perform Discuss the relationship between levels of.
1 Lecture-2 CS-120 Fall 2000 Revision of Lecture-1 Introducing Computer Architecture The FOUR Main Elements Fetch-Execute Cycle A Look Under the Hood.
1 Programming & Programming Languages Overview l Machine operations and machine language. l Example of machine language. l Different types of processor.
CMP 131 Introduction to Computer Programming Violetta Cavalli-Sforza Week 1, Lab.
CS 104 Introduction to Computer Science and Graphics Problems Software and Programming Language (2) Programming Languages 09/26/2008 Yang Song (Prepared.
The CPU The Central Presentation Unit Language Levels Fetch execute cycle Processor speed.
CSE 1301 J Lecture 2 Intro to Java Programming Richard Gesick.
Assembly & Machine Languages
1 Chapter-01 Introduction to Computers and C++ Programming.
COMPUTER SOFTWARE Section 2 “System Software: Computer System Management ” CHAPTER 4 Lecture-6/ T. Nouf Almujally 1.
© 2019 SlidePlayer.com Inc. All rights reserved.