Oberon Oral Exam English. index The creator The history The use The syntax An example Conclusion.

Slides:



Advertisements
Similar presentations
Decision Structures - If / Else If / Else. Decisions Often we need to make decisions based on information that we receive. Often we need to make decisions.
Advertisements

Control Structures Any mechanism that departs from straight-line execution: –Selection: if-statements –Multiway-selection: case statements –Unbounded iteration:
Chapter 2.5 Modula 2 Control Instructions. Modula 2 Control Statements Selection statements –BOOLEAN Selector : IF statement –Ordinal Selector : CASE.
Pascal Programming Today Chapter 4 1 »Conditional statements allow the execution of one of a number of possible operations. »Conditional statements include:
Program CheckPass; var TestScore, ExamScore : integer; FinalScore : real; Status : string; begin write(‘Enter the Test score:’); readln(Testscore); write(‘Enter.
Program Development Procedures 1.Program definition clearly define what the problem is. clearly define Input and output data (types, precision, units used)
Software Engineering at Faculty of EE in Belgrade Prof. Dr Miroslav Bojovic Baile Herculane, August 2005.
Computer Science 103 Chapter 3 Introduction to JavaScript.
Pascal Regina Bellamy Katitia Eaddy Corinthia Cunningham Anthony Mancuso.
CMP 131 Introduction to Computer Programming Violetta Cavalli-Sforza Week 3, Lecture 2.
1 ) Definition 2) Note on structured and modular programming, and information hiding 3) Example imperative languages 4) Features of imperative languages.
Web Infrastructure Week 3 INFM 603. The Key Ideas Questions Structured Programming Modular Programming Data Structures Object-Oriented Programming.
Copyright © 2006 The McGraw-Hill Companies, Inc. Programming Languages 2nd edition Tucker and Noonan Chapter 2 Syntax A language that is simple to parse.
CS31: Introduction to Computer Science I Discussion 1A 4/2/2010 Sungwon Yang
Chapter 8: Introduction to High-level Language Programming Invitation to Computer Science, C++ Version, Third Edition.
Introduction to a Programming Environment
1 Midterm Review COMP 102. Tips l Eat a light meal before the exam l NO electronic devices (including calculators, dictionaries, phones, pagers, etc.)
Pascal By: Liane Tom. Outline o Background o Data types and Syntax o Procedures and Functions o Advantages o Disadvantages.
Pascal Programming Pascal Units, Abstract Data, Ordinals, Arrays.
VB .NET Programming Fundamentals
Introduction to C++ Programming
PASCAL. HISTORY OF PASCAL Developed by Niklaus Wirth a member of the International Federation of Information Processing(IFIP) To provide features that.
Chapter 8 High-Level Programming Languages (modified by Erin Chambers)
Pascal Course Spring Introduction Designed: 1968/9 by Niklaus Wirth Published: 1970 Imperative, structural, procedural Static and strong.
AS Computing Introduction to Programming. What is a Computer Program? A list of instructions that a computer must work through, in a logical sequence,
1 The CONST definition CONST Pi = , City = ‘New York’; Constant identifiers are used when you do not want the value of an identifier to change why.
Chapter 8 High-Level Programming Languages. 8-2 Chapter Goals Describe the translation process and distinguish between assembly, compilation, interpretation,
Pascal language Slides of Omar Al-Nahal. Components of Pascal Language Components of Pascal Language 1. Pascal Character set: - English Letters. - Decimal.
Principle of Programming Lanugages 2: Imperative languages Isao Sasano Department of Information Science and Engineering ( structured programming, control.
INFORMATION TECHNOLOGY CSEC CXC 10/25/ PASCAL is a programming language named after the 17th century mathematician Blaise Pascal. Pascal provides.
CIS-165 C++ Programming I CIS-165 C++ Programming I Bergen Community College Prof. Faisal Aljamal.
Chapter 6 Programming Languages (1) Introduction to CS 1 st Semester, 2015 Sanghyun Park.
Introduction to Pascal The Basics of Program writing.
PHP - 1h. How it works Client requests document Server loads document in memory Server processes document with relevant module (PHP) Server sends XHTML.
Programming, an introduction to Pascal
Pascal Course Spring Introduction Designed: 1968/9 by Niklaus Wirth Published: 1970 Imperative, structural, procedural Static and strong.
Pascal Programming Written by Leung King Yung. Simple Program 1 begin end.
I Power Higher Computing Software Development High Level Language Constructs.
Loops Brent M. Dingle Texas A&M University Chapter 7 – part B (and some from Mastering Turbo Pascal 5.5, 3 rd Edition by Tom Swan)
How Are Computers Programmed? CPS120: Introduction to Computer Science Lecture 5.
Repetition. Loops Allows the same set of instructions to be used over and over again Starts with the keyword loop and ends with end loop. This will create.
ISM 2110 Programming for Business Applications Lecture 2 - Section 2 Delphi and Object Pascal Basic By Tony Chun-Kuen WONG Tutorial after 12/09/2002.
Ch. 5 Ch. 51 jcmt Summer 2003Programming Languages CSE3302 Programming Languages (more notes) Summer 2003 Dr. Carter Tiernan.
CS 153: Concepts of Compiler Design September 30 Class Meeting Department of Computer Science San Jose State University Fall 2015 Instructor: Ron Mak
COMP 102 Programming Fundamentals I Presented by : Timture Choi COMP102 Lab 011.
Midterm Exam Topics (Prof. Chang's section) CMSC 201.
12/14/2016CS150 Introduction to Computer Science 1 Announcements  Website is up!   All lecture slides, assignments,
1-1 1 Introduction  Programming linguistics: concepts and paradigms syntax, semantics, and pragmatics language processors.  Historical development of.
Scion Macros How to make macros for Scion The Fast and Easy Guide.
Java Basics. Tokens: 1.Keywords int test12 = 10, i; int TEst12 = 20; Int keyword is used to declare integer variables All Key words are lower case java.
2 nd Semester Module1 Introduction to Computer and Programming อภิรักษ์ จันทร์สร้าง Aphirak Jansang
Copyright © 2014 Pearson Addison-Wesley. All rights reserved. 4 Simple Flow of Control.
Basic concepts of C++ Presented by Prof. Satyajit De
Definition of the Programming Language CPRL
IGCSE 4 Cambridge Data types and arrays Computer Science Section 2
Def: A control structure is a control statement and
Principle of Programming Lanugages 2: Imperative languages
Written by Al.So. Software solutions
Computing Fundamentals
Programming Language : Algol
Introduction to Modula-2
البرمجة بلغة الفيجول بيسك ستوديو
Programming Languages 2nd edition Tucker and Noonan
CS150 Introduction to Computer Science 1
Conference on the History of Programming Languages III
High Level Programming Languages
C# Revision Cards Data types
Сабақтың тақырыбы: Мәлімет типтері. Шамалардың сипатталуы
Identifiers & Lifetimes
CMPE 152: Compiler Design September 19 Class Meeting
Presentation transcript:

Oberon Oral Exam English

index The creator The history The use The syntax An example Conclusion

The creator - Niklaus Wirth Swiss computer scientist born February 1934 Academic history Electronics Engineering (ETH in Zürich) Master degree from Laval University, Canada Ph.D from University of California Berkeley

The creator - Niklaus Wirth Assistant professor Comp Science at Stanford University and University of Zürich Prof Informatics at ETH Zürich Chief designer of Algol W, Pascal, Modula, Modula-2, and Oberon

history ALGOL – 60’s Pascal – 70’s (first OO) Modula / Modula-2 –- 80’s (Modules) Oberon / Oberon-2 –- 80’s-90’s (OO)

The use Pascal’s syntax, style More power Very clear structure Object-Oriented 20 years experience Executable problem  Used for teaching

The syntax - introduction Case sensitive Line end  ; Comment  (* *) MODULE Hello; (* first program *) IMPORT Out; PROCEDURE Do* BEGIN Out.String(“Hello”); Out.Ln; END Do; END Hello;

The syntax – Programme Structure MODULE Hello; (* first program *) IMPORT Out; PROCEDURE Do* BEGIN Out.String(“Hello”); Out.Ln; END Do; END Hello; MODULE PROCEDURE BEGIN END  predefined words

The syntax – VAR & CONST Predefined section Marked by “VAR” Varname : TYPE; Assignment operator  := constants in “CONST” section PROCEDURE Vartest* CONST numb = 6; VAR a : INTEGER; b : REAL; c : REAL; BEGIN a := 3; c := numb*a; Out.Real(c); Out.Ln; END Vartest;

The syntax - Datatypes BOOLEAN  TRUE / FALSE CHAR  ASCII SHORTINT  INTEGER  LONGINT  -2E+9...2E+9 REAL  -3,4E E+38

The syntax – Loops / Conditions WHILE WHILE (var1 < 3) DO var2 := var2 + 1; END; REPEAT var2 := var2 + 1; UNTIL (var1 < 3); LOOP var2 := var2 + 1; EXIT; END; IF IF (var1 = 3) THEN Out.String(“Hurray”); ELSE Out.String(“Booh”); END; CASE CASE var1 OF 1 : Out.String(“1”); | 2 : Out.String(“2”); | 3 : Out.String(“3”); ELSE Out.String(“none”); END;

Example – GFX engine Very powerful language Example : my GFX engine 5 months experience in Oberon No other programming background Many GFX possibilities

Example – GFX engine Dynamic 3D Object Rendered by Oberon Backface culling Z-buffer Shading

Example – GFX examples

Conclusion Structured, Compact, Powerful Many possible compilers Downside : Executable files Used for teaching

Thank you for your attention Any questions?