FORTH By Wesley Morefield. History Worked at the Smithsonian Astrophysical Observatory. He used programs to allign satellite stations with astronomical.

Slides:



Advertisements
Similar presentations
compilers and interpreters
Advertisements

EC-111 Algorithms & Computing Lecture #1 Instructor: Jahan Zeb Department of Computer Engineering (DCE) College of E&ME NUST.
 A telescope collects light coming off an object, like the moon, planets, and stars.  It focuses the light and magnifies it, making the object appear.
PbForth + sum ! By Josh Jennings Ratnakar Kamath.
Recursion CS 367 – Introduction to Data Structures.
Tail Recursion. Problems with Recursion Recursion is generally favored over iteration in Scheme and many other languages – It’s elegant, minimal, can.
Names and Bindings.
World’s first Forth compiler for the.NET platform Valer BOCAN, PhD.
Lua By: Michael Coffman Peter Sussman. History Lua means ‘moon’ in Portuguese First appeared in 1993 Created by Roberto Ierusalimschy, Luiz Henrique de.
Introduction to Programming Languages Nai-Wei Lin Department of Computer Science and Information Engineering National Chung Cheng University.
Copyright © 1998 by Addison Wesley Longman, Inc. 1 Chapter One Preliminaries, including –Why study PL concepts? –Programming domains –PL evaluation criteria.
Introduction to Programming Lecture 2. Today’s Lecture Software Categories Software Categories System Software System Software Application Software Application.
1 Starting a Program The 4 stages that take a C++ program (or any high-level programming language) and execute it in internal memory are: Compiler - C++
Lecture 3: Topics If-then-else Operator precedence While loops Static methods Recursion.
Three types of computer languages
Copyright © 2006 Addison-Wesley. All rights reserved.1-1 ICS 410: Programming Languages Chapter 3 : Describing Syntax and Semantics Operational Semantics.
Postfix notation. About postfix notation Postfix, or Reverse Polish Notation (RPN) is an alternative to the way we usually write arithmetic expressions.
Cellular Programming Air Forth 1 Ilan Kadar & Ofry Ram
Drew Murphy Drew Ebelhar. History December 18, 1987 Creator- Larry Wall Objective: To develop a general purpose Unix scripting language to make report.
Python Jordan Miller and Lauren Winkleman CS 311 Fall 2011.
Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved The Instruction Set Architecture.
Run-time Environment and Program Organization
Copyright © 1998 by Addison Wesley Longman, Inc. 1 Concepts of Programming Languages Chapter 1.
Testing Dr. Andrew Wallace PhD BEng(hons) EurIng
1 Chapter-01 Introduction to Computers and C++ Programming.
COMPUTER SCIENCE I C++ INTRODUCTION
Language Evaluation Criteria
Comp 245 Data Structures Stacks. What is a Stack? A LIFO (last in, first out) structure Access (storage or retrieval) may only take place at the TOP NO.
Programming Language C++ Xulong Peng CSC415 Programming Languages.
CPRG 215 Introduction to Object-Oriented Programming with Java Module 1-Introduction to Java Topic 1.1 Basics of Java Produced by Harvey Peters, 2008 Copyright.
CS212: DATA STRUCTURES Lecture 1: Introduction. What is this course is about ?  Data structures : conceptual and concrete ways to organize data for efficient.
ISBN Chapter 3 Describing Semantics -Attribute Grammars -Dynamic Semantics.
Interpreter CS 124 Reference: Gamma et al (“Gang-of-4”), Design Patterns Some material taken from:
ORDER OF CONTENT AND INSTRUCTIONS A program in its simplest form usually contains three kinds of activity:  INPUT : The program asks the user for some.
Introduction to the Global Positioning System Introduction to the Global Positioning System GPS.
Introduction to Programming G50PRO University of Nottingham Unit 2 : Introduction To Scratch Paul Tennent
Syntax and Semantics CIS 331 Syntax: the form or structure of the expressions, statements, and program units. Semantics: the meaning of the expressions,
OCR GCSE Computing © Hodder Education 2013 Slide 1 OCR GCSE Computing Python programming 1: Introduction.
Fortran MATTHEW CARSON. History of FORTRAN FORTRAN ; First High Level Language FORTRAN I 1957; First Compiled Language FORTRAN II ; Independent.
Reverse Polish Notation Written by J.J. Shepherd.
JavaScript: An Analysis Michael Owen. Brief History Founded at NetScape by Brendan Eich Mocha, LiveScript, then JavaScript No apparent relation to Java.
By: Dan Andrei D. Leycano.  Simple and easy to learn  Python syntax have a readable structure  Python is flexible.
JavaScript Katie Fowle November 15, History Brendan Eich at Netscape, 1995 Need for interactivity in web pages Mocha, LiveWire, LiveScript, then.
Compilers and Interpreters
Chapter 1: Preliminaries Lecture # 2. Chapter 1: Preliminaries Reasons for Studying Concepts of Programming Languages Programming Domains Language Evaluation.
OCR A Level F453: The function and purpose of translators Translators a. describe the need for, and use of, translators to convert source code.
CSCE 343 – Programming Language Concepts Welcome!.
Topic 2: Hardware and Software
Producer : Sara Astrono my نجوم Producer : Sara
MEMORY REPRESENTATION OF STACKS
The Forth Language CSC 507 – Roy Ford November 22, 2005.
Stack as an ADT.
Chapter 1 Reasons to study concepts of PLs Programming Domains
1.1 Reasons to study concepts of PLs
Chapter 1 Preliminaries.
Python Training in Chennai
QuickBasic Jason Mallory.
Diamond Box Developed by: Darshan Patel 13bce071 Kirtik Patel 13bce078.
Henning Schulzrinne Advanced Programming
CS 3304 Comparative Languages Fall 2011
Space Technology 8.E.4B.5 Obtain and communicate information to describe how data from technologies (including telescopes, spectroscopes, satellites,
CSC128 FUNDAMENTALS OF COMPUTER PROBLEM SOLVING
High Level Programming Languages
The Instruction Set Architecture Level
Tail Recursion.
Buffer Overflows.
Address Spaces Physical Memory Virtual Memory Process Memory Layout
Reasons To Study Programming Languages
Changing Education Paradigms
Presentation transcript:

FORTH By Wesley Morefield

History Worked at the Smithsonian Astrophysical Observatory. He used programs to allign satellite stations with astronomical positions. The formula for each satellite station was different, so he had to use different code for each one. In 1950 he created an interpreter so that he could have one main program and change out chunks of code for each satellite without recompiling the whole program.

Stack Stack based language. Reverse Polish Notation * STACKSTACKSTACK STACK

Control Structures

Dictionary Compiled list that remains in memory that contains all of the built-in and user created methods.  Example of how methods work and can be linked. ( Large letter F ) : STAR 42 EMIT ; ***** : STARS 0 DO STAR LOOP ;* : MARGIN CR 30 SPACES ;***** : BLIP MARGIN STAR ;* : BAR MARGIN 5 STARS ;* : F BAR BLIP BAR BLIP BLIP CR ;

Evaluation Readability Writability Reliability Cost

Readability

Writability

Reliability Unsafe Direct editing of memory Reliable when programmed correctly

Cost Language is free Not an easy language to learn Formal training would be expensive

References