Category:PL/0: Difference between revisions

Lang tag(s):	pl0
See Also:	PL/0 on the HOPL; ;

Content added Content deleted

Inline

Revision as of 16:49, 3 October 2023

PL/0 is an educational programming language. It was originally introduced in the book, Algorithms + Data Structures = Programs, by Niklaus Wirth in 1976. Wirth uses PL/0 as an example of how to construct a compiler. This language has simple constructs. Writing real applications in PL/0 is not practical, but the compiler can remain compact and simple.

Features

One must explicitly declare all used constants and variables.

The only data type is integer. The only operators are arithmetical and comparisons. There is a function odd which examines if its integer argument is odd.

In the original implementation presented by Wirth, there are no input and output routines. The interpreter prints the new value of each variable when it changes. So, the program:

var a, b;
begin
  a := 0; b := 10;
  while a < 5 do 
  begin
    a := a + 1;
    b := b - 1;
  end
end.

gives this output:

However, most implementations have single input and single output routines.

The flow control structures are if-then and while-do constructs, and procedures defined by the user. Procedures cannot accept any parameters.

Syntax

The syntax rules of PL/0 can be specified in EBNF as follows:

program = block "." ;

block = [ "const" ident "=" number {"," ident "=" number} ";"]
        [ "var" ident {"," ident} ";"]
        { "procedure" ident ";" block ";" } statement ;

statement = [ ident ":=" expression | "call" ident 
              | "?" ident | "!" expression 
              | "begin" statement {";" statement } "end" 
              | "if" condition "then" statement 
              | "while" condition "do" statement ];

condition = "odd" expression |
            expression ("="|"<>"|"<"|"<="|">"|">=") expression ;

expression = [ "+"|"-"] term { ("+"|"-") term};

term = factor {("*"|"/") factor};

factor = ident | number | "(" expression ")";

Wirth in his book presents the implementation without ? ("receive an integer value and assign it to the variable") and ! ("display a value of the expression") routines. Some implementations use other routines for receiving and displaying data, usually read and write.

Due to typographic conventions, Wirth uses non-ASCII symbols ≠, ≤, and ≥. Some implementations use # for "not equal", [ for "less or equal", and ] for "greater or equal".

Some implementations accept only uppercase letters or only lowercase letters in keywords and identifiers.

External links

Wikipedia has an article about PL/0.
PL/0 - Pascal for small machines

Pages in category "PL/0"

The following 25 pages are in this category, out of 25 total.

@@ Line 1: / Line 1: @@
 {{language|PL/0
 |tags=pl0}}
-'''PL/0''' is an educational programming language. It was originally introduced in the book, ''Algorithms + Data Structures = Programs'', by [[Niklaus Wirth]] in 1976. Wirth uses PL/0 as an example of how to construct a compiler. This language has little constructs. Writing real applications in PL/0 is not practical, but the compiler can remain compact and simple.
+'''PL/0''' is an educational programming language. It was originally introduced in the book, ''Algorithms + Data Structures = Programs'', by [[Niklaus Wirth]] in 1976. Wirth uses PL/0 as an example of how to construct a compiler. This language has simple constructs. Writing real applications in PL/0 is not practical, but the compiler can remain compact and simple.
 == Features ==
 One must explicitly declare all used constants and variables.
-The only data type are integer numbers. The only operators are arithmetical and comparison ones. There is a function <code>odd</code> which examines if the integer argument is odd.
+The only data type is integer. The only operators are arithmetical and comparisons. There is a function <code>odd</code> which examines if its integer argument is odd.
-In the original implementation presented by Wirth, there are no input and output routines. The interpreter prints the new value of each variable when it becomes changed. So, the program:
+In the original implementation presented by Wirth, there are no input and output routines. The interpreter prints the new value of each variable when it changes. So, the program:
 <syntaxhighlight lang="pascal">
 var a, b;
@@ Line 20: / Line 20: @@
 end.
 </syntaxhighlight>
-gives the output:
+gives this output:
 <pre>
@@ Line 67: / Line 67: @@
 Wirth in his book presents the implementation without <code>?</code> ("receive an integer value and assign it to the variable") and <code>!</code> ("display a value of the expression") routines. Some implementations use other routines for receiving and displaying data, usually <code>read</code> and <code>write</code>.
-Due to typograhic conventions, Wirth uses non-ASCII symbols <code>≠</code>, <code>≤</code>, and <code>≥</code>. Some implementations use <code>#</code> for "not equal", <code>[</code>  for "less or equal", and <code>]</code> for "greater or equal".
+Due to typographic conventions, Wirth uses non-ASCII symbols <code>≠</code>, <code>≤</code>, and <code>≥</code>. Some implementations use <code>#</code> for "not equal", <code>[</code>  for "less or equal", and <code>]</code> for "greater or equal".
-Some implementations accept only upper-case letters or only lower-case letters in keywords and identifiers.
+Some implementations accept only uppercase letters or only lowercase letters in keywords and identifiers.
 == External links==