From f53245ae55b35029e0ada6ea2556d06f2db691dc Mon Sep 17 00:00:00 2001 From: "Eric S. Raymond" Date: Thu, 19 Feb 2004 03:07:03 +0000 Subject: [PATCH] Added example headers. --- doc/mad-manual.xml | 30 +++++++++++++++++++----------- 1 file changed, 19 insertions(+), 11 deletions(-) diff --git a/doc/mad-manual.xml b/doc/mad-manual.xml index 3f32b89..2d58116 100644 --- a/doc/mad-manual.xml +++ b/doc/mad-manual.xml @@ -16,6 +16,7 @@ + A"> B"> @@ -32,10 +33,11 @@ Most of this document is a faithful transcription of the reference manual for MAD (Michigan Algorithm Decoder), an early academic computer language from 1962. The manual should be -accompanied by an implementation. MAD has been revived as a work of -reconstructive archeology, so that language connoisseurs of the -present and future will be able to appreciate what computing life was -like back in that day. +accompanied by an implementation; if not, it can be found at the Retrocomputing Museum. MAD has been revived +as a work of reconstructive archeology, so that language connoisseurs +of the present and future will be able to appreciate what computing +life was like back in that day. MAD was an extended dialect of ALGOL 58, first released in 1959 near the beginning of the great age of invention in compiled languages @@ -319,6 +321,13 @@ in Chapter 1 include small hand-drawn geometrical shapes after each of the items A, B, and the words "diamonds" and "rectangles" in item D were corresponding shapes. +In the original, each example in Chapter 3 was introduced by a +centered numbered header "Example N" with no section numbering. These +headers have been turned into second-level sections, and descriptive +titles added because the Contents page looked awful without +them. To remind the reader that these are additions by the redactor, +they are highlighted like redactor's notes. + The PIC diagrams preserve the logic of the original hand-drawn ones, but are not exact geometrical duplicates. The proportions of the flowchart elements are slightly different. One detail we have not @@ -3016,7 +3025,7 @@ relation is true. Scientific Examples -Example 1 +Example 1<emphasis role='note'>: Compute roots of linear and quadratic equations</emphasis> Problem: To solve the quadratic equation ax2 + bx + c = 0 for vartious sets of @@ -3061,7 +3070,7 @@ idea!). -Example 2 +Example 2<emphasis role='note'>: Printting the truth table of a Boolean expression</emphasis> Problem: A logical (Boolean) expression such as (P .AND. Q) .OR.(.NOT. P .AND. R .AND. S).OR.(R .OR. P) will @@ -3171,7 +3180,7 @@ instead of the BOOLEAN declaration. -Example 3 +Example 3<emphasis role='note'>: Simpson's Rule approximation of a definite integral</emphasis> Problem: To approximate a∫b f(x) by Simpson's @@ -3254,11 +3263,10 @@ READ READ FORMAT INPUTS,A,B,N,R -Example 4 +Example 4<emphasis role='note'>: Find roots of a function by half-interval approximation</emphasis> - Flow diagram: @@ -3289,7 +3297,7 @@ program deck. -Example 5 +Example 5<emphasis role='note'>: Compute the transpose of a matrix</emphasis> Problem: Find the transpose A' of an n×n matrix A = (aij). @@ -3324,7 +3332,7 @@ function would be called with a statement of the form EXECUTE TRANS.(A, N). -Example 6 +Example 6<emphasis role='note'>: Matrix multiplication</emphasis> Problem: Multiply the matrix A = (aij) by the matrix B = -- 2.43.0