X-Git-Url: https://git.distorted.org.uk/~mdw/fringe/blobdiff_plain/ca488b918794c92c47c157a9e18ccb478cf6be40..b4ccf28fdae8b63e4c2abc154e8bba1ec8ace6ab:/algol68-fringe.a68

diff --git a/algol68-fringe.a68 b/algol68-fringe.a68
index fdea7c8..b04ee27 100644
--- a/algol68-fringe.a68
+++ b/algol68-fringe.a68
@@ -1,4 +1,4 @@
-COMMENT -*-algol-68-*-
+COMMENT -*-a68-*-
 
 	Algol 68 implementation of a `same-fringe' solver.
 
@@ -19,10 +19,10 @@ BEGIN
   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;
 
 ###--------------------------------------------------------------------------
@@ -52,7 +52,7 @@ PROC parse tree = ([] CHAR string) REF NODE:
 	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)
@@ -128,7 +128,7 @@ PROC same fringes = (REF NODE n, REF NODE nn) BOOL:
   #
   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