This programming language may be used to instruct a computer to perform a task.
If you know PL/M, please write code for some of the tasks not implemented in PL/M.
Designed and implemented in 1973 by Gary Kildall, PL/M (Programming Language for Microcomputers) is (as the name suggests) a language designed for microcomputer software, particularly system software.
It is approximately a very small subset of PL/1 (though not a strict subset).
The following statements from PL/1 (with some changes) were available:
Additionally, a HALT statement, interrupt related statements and a number of compiler directive statements existed.
There are no built-in I/O statements - calls to appropriate routines would be made instead.
Unlike PL/1, PL/M keywords are reserved and so cannot be used as identifiers. The Boolean operators are reserved words: AND, OR and NOT instead of the symbols: &, |, ¬.
Available datatypes (BYTE, WORD, etc.) reflected the available types of the microprocessors.
The declaration of structures in PL/M does not use level-numbers, instead a syntax more like C structs is used, e.g.:
DECLARE A STRUCTURE ( B BYTE, C WORD );
declares a structure A with two members, B and C.
PL/M was used in the development of the CP/M operating system and associated applications.
Compilers were available for a number of microprocessors including the 8080/Z80, 8051, 8086, 80186, 80286 and 80386.
The available datatypes varied depending on the processor.
Kildall's original PL/M compiler was implemented entirely in standard Fortran 66.
This category has the following 3 subcategories, out of 3 total.
Pages in category "PL/M"
The following 100 pages are in this category, out of 100 total.
- Nice primes
- Non-decimal radices/Convert
- Number names
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers in base-16 representation that cannot be written with decimal digits
- Numbers which binary and ternary digit sum are prime
- Sequence: smallest number greater than previous term with exactly n divisors
- Show ASCII table
- Sierpinski triangle
- Sieve of Eratosthenes
- Smallest square that begins with n
- Smith numbers
- Sorting algorithms/Heapsort
- Sorting algorithms/Insertion sort
- Special Divisors
- Special pythagorean triplet
- Square but not cube
- Stern-Brocot sequence
- Strange numbers
- Sum of divisors
- Sum of elements below main diagonal of matrix
- Sum of first n cubes
- Sum of the digits of n is substring of n
- Sylvester's sequence