SR-ALGOL

SR-ALGOL

HOME :: THEORY ::

SLIDE RULE
ALGORITHMIC
LANGUAGE

Andrew Nikitin has produced a notation for algorithms to solve slide rule problems (see links below). It is an interesting and valuable exercise to be able to write algorithms or solutions to problems using a notation which is standardized. In many ways, it can be consider a type of language used specifically for programming a slide rule, although the instructions must be transferred by the user.

SR-ALGOL (Slider Rule Algorithmic Language) will be used throughout this site where appropriate.

As with all mathematics, the language is generally symbolic and that is the beauty of it all. So it is not surprising to use this same symbolic nature for a device based on mathematical principles.

Some people will not think the notation useful, whereas other will delight in it. Personally, I believe that it is a beautiful way to express the generally written solutions to slide rule problems.

SR-ALGOL
SR-ALGOL has very few operators, the syntax of each operator will be demonstrated in the following sections. Throughout most explanations of the syntax, numerical values will be used to aid in a clearer explanation. For developing algorithms, variables, constants and gauge marks may be introduced. All examples will be accompanied by a screen shot of the decoder. Keep in mind the following:

Algorithms are written in one line.
Algorithms are read from left to right.
Multiple statements are separated by a semi-colon (;).
No spaces are used.

Provided Javascript is enabled, when you move the cursor over the algorithm string the cursor will change to a cross hair and you can then click on the string to pop up the decoded instructions.