PLANC

PLANC (acronym for Programming Language ND Computers, pronounced as "plank") is a high level system programming language.

Compilers were developed by Norsk Data for several architectures, including the Motorola 68000, 88000, x86, and the Norsk Data NORD-10 architecture and ND-500 supermini.

It was mainly used internally at ND for writing high level systems software such as the upper parts of the operating systems and compilers. It was designed to be platform independent.

PLANC basic structure
PLANC programs are structured into modules and routines.

A very simple example of a PLANC program is as follows:

MODULE mod INTEGER ARRAY : stack (0:100) PROGRAM : mprog INTEGER : i, j,k, m      INISTACK stack 1 =: i      2 =: j       i+j =: k =: m    ENDROUTINE ENDMODULE

The most visible difference from other popular programming languages is that the assignment operator goes from left to right: First you compute the value, then you store it. The assignment operator also returns the stored value, so you could store it multiple times: 5 =: a =: b would store 5 into both the A and B variables. It shares this direction with Mary, another little known programming language developed in Norway.

Compile-time initialization of variables, on the other hand, went from right to left.

PLANC data types
As with all high level languages PLANC uses variables as can be seen in the previous sample, here are the allowed data types within PLANC:


 * Simple types
 * INTEGER, REAL, BOOLEAN, LABEL, VOID, ENUMERATION, POINTER
 * Composite types
 * ARRAY, RECORD, SET, ROUTINE
 * User defined types: declared by TYPE T = .....;

An enumeration was declared thus: ENUMERATION (Winter, Spring, Summer, Autumn) : Seasons := Summer

This defines an enumeration of the seasons and sets the default value to Summer.

LABEL is a little different from your normal data type, this is used to pre-define a label within code and is used in conjunction with a GO statement (very much like GOTO in BASIC).

Access modifiers can be applied to make them READ or WRITE only.

For string data several predefined datatypes are used, they are:


 * 1) . BYTE       Contains a single character
 * 2) . BYTES      Contains character strings
 * 3) . BITS       Contains BIT strings

Array pointers were 3-word constructs that included both the base address, the lower bound and the higher bound of the array; this made it possible to do reliable run-time checking of array boundaries, and made the kind of "pointer arithmetic" that makes C such an "interesting" language much less tempting to write.

Some PLANC statements
PLANC was a language in the PASCAL family. However, it lacked the generic BEGIN END construct often found in PASCAL and preferred instead forms like ROUTINE..ENDROUTINE or DO..ENDDO etc.

One feature that set it apart from some other languages was how loops were constructed.

You had the following types of loops:

DO .... loop statements... ENDDO

Hopefully one or more of the loop statements would be WHILE condition that allowed you to break out of the loop.

For example:

DO WHILE test ..... ENDDO

Was similar to a C while (test) { ... } loop.

Another example:

DO   ...... WHILE test ENDDO

Was similar to a C do { .... } while (test). loop.

Some times you could see:

DO WHILE test1 ..... WHILE test2 ENDDO

In C you would have to write something like while (test1) { .... if (! test2) break; } or some such.

For loops had the following structure:

FOR var IN low:high DO .... loop statements.... ENDDO

You could also specify a step by low:high:step. Alternatively you could specify a type (enumeration or integer ranged type) to specify a loop over a range of values or a set to loop over all elements of the set or you could specify an array to loop over an array. You could also specify a pointer:next to walk through a list. For example if you had defined:

TYPE node = RECORD node POINTER : next T           : some_data ENDRECORD

You could write:

FOR p IN first:next DO ..... ENDFOR

to loop over the list.

As a for loop was a loop you could also have WHILE statements inside it. This gave you two possible manners of exiting a for loop, either because the list of values are exhausted or because the test failed. Thus, you could write blocks to catch each of those:

routine void,node pointer (node pointer : list) for p in first:next do while p.val >< 20 exitfor return nil endfor return endroutine

This would return nil if you have exhausted the list but if you exited due to while you just ended up after the loop and returned the pointer to the element found. Alternatively you could have placed that in an exitwhile block which is identical except you would end up there if and only if the while test failed. If you have more than one while statement in the loop you could not tell those apart, they would all make a jump to the same exitwhile block.