-COMMENT -*-algol-68-*-
+COMMENT -*-a68-*-
Algol 68 implementation of a `same-fringe' solver.
END;
PROC fail = ([] CHAR message) VOID:
- ### Mournfully announce an error and quit.
+ ### Mournfully announce an error and quit.
#
BEGIN put(stand error, (program name, ": ", message, new line));
- execve("/bin/false", "false", ()) # Can this be any worse? #
+ execve("/bin/false", "false", "die=now") # Can this be any worse? #
END;
###--------------------------------------------------------------------------
IF i > UPB string THEN fail("no data") FI;
CHAR data = string[i]; i +:= 1;
REF NODE right = parse;
- IF (i > UPB string | TRUE | string[i] /= ")")
+ IF (i > UPB string | TRUE | string[i] /= ")")
THEN fail("missing )") FI;
i +:= 1;
HEAP NODE := (left, right, data)
#
BEGIN REF NODEITER i = node iterator(n), ii = node iterator(nn);
BOOL win := FALSE;
- DO REF NODE n = next node(i), nn = next node(ii);
+ DO REF NODE n = next node(i), nn = next node(ii);
IF tree is not empty(n)
THEN IF tree is not empty(nn)
THEN IF data OF n = data OF nn THEN SKIP ELSE done FI