Programming in Modula-2Springer Science & Business Media, 06.12.2012 - 182 Seiten This text is an introduction to programming in general, and a manual for programming with the language Modula-2 in particular. It is oriented primarily towards people who have already acquired some basic knowledge of programming and would like to deepen their understanding in a more structured way. Neveltheless, an introductory chapter is included for the benefit of the beginner, displaying in a concise form some of the fundamental concepts of computers and their programming. The text is therefore also suitable as a self-contained tutorial. The notation used is Modula-2, which lends itself well for a structured approach and leads the student to a working style that has generally become known under the title of structured programming. As a manual for programming in Modula-2, the text covers practically all facilities of that language. Part 1 covers the basic notions of the variable, expression, assignment, conditional and repetitive statement, and array data structure. Together with Palt 2 which introduces the important concept of the procedure or subroutine, it contains essentially the material commonly discussed in introductory programming courses. Part 3 concerns data types and structures and constitutes the essence of an advanced course on programming. Palt 4 introduces the notion of the module, a concept that is fundamental to the design of larger programmed systems and to programming as team work. The most commonly used utility programs for input and output are presented as examples of modules. |
Inhalt
9 | |
11 | |
14 | |
Representation of Modula Programs | 16 |
Statements and Expressions | 19 |
Control Structures | 22 |
Elementary Data Types | 28 |
Constant and Variable Declarations | 36 |
Records with Variant Parts | 71 |
Dynamic Structures and Pointers | 74 |
Procedure Types | 79 |
Modules | 81 |
Definition and Implementation Parts | 83 |
Program Decomposition into Modules | 87 |
Local Modules | 94 |
Sequential Input and Output | 101 |
The Data Structure Array | 37 |
Procedures | 47 |
The Concept of Locality | 49 |
Parameters | 51 |
Function Procedures | 54 |
Recursion | 56 |
Type Declarations | 62 |
Enumeration Types | 64 |
Subrange Types | 65 |
Set Types | 66 |
Record Types | 68 |
ScreenOriented Input and Output | 109 |
LowLevel Facilities | 119 |
Concurrent Processes and Coroutines | 122 |
Device Handling Concurrency and Interrupts | 129 |
Report on the Programming Language Modula2 | 133 |
The Syntax of Modula2 | 157 |
Standard Utility Modules | 161 |
The ASCII Character Set | 170 |
Syntax Diagrams | 171 |
181 | |
Andere Ausgaben - Alle anzeigen
Häufige Begriffe und Wortgruppen
ADDRESS algorithm ARRAY OF CHAR assignment base type BEGIN BITSET BOOLEAN buffer CaseLabels character compiler CONST constant ConstExpression coroutine data type defined DEFINITION MODULE denotes designator device digit digit EBNF element ELSIF ch END END enumeration type example executed ExpList export expression facilities factor FieldListSequence file system formal parameter FormalType function procedure GetCh GetSym ident identifier IdentList implementation module InOut IMPORT input and output keyboard language Lilith computer Modula-2 module Files nodes objects octal operands operating system pointer type procedure call procedure declaration Procedure Heading procedure type processor qualident Read ch ReadWord real numbers recursion REPEAT repetition return statement rules sequential SIGNAL SimpleExpression SimpleType so-called specified standard statement sequence StatementSequence END storage stream string subrange type symbol syntactic syntax terminal symbols termination transfer TreePtr type declaration type INTEGER Variable Declaration variant Window words Write WriteLn WriteString