From 77bb2e29ec878a452cb06ca0583c4e7f8d9756b1 Mon Sep 17 00:00:00 2001
From: Markus Uhlin <markus@nifty-networks.net>
Date: Tue, 26 Dec 2023 22:46:43 +0100
Subject: 'on no' -> 'if no'

---
 FICS/formula.c | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/FICS/formula.c b/FICS/formula.c
index f78ff29..816445f 100644
--- a/FICS/formula.c
+++ b/FICS/formula.c
@@ -285,7 +285,7 @@ int OpType (int op)
  * current operator. 'g' and 'clause' specify which formula string to
  * look at, and 'i' tells us where we are in the string. We look for a
  * right operand from position 'i' in the string. And place the
- * expression in 'left'. This function returns 0 on no error.
+ * expression in 'left'. This function returns 0 if no error.
  * Otherwise an error code is returned.
  */
 int
@@ -365,7 +365,7 @@ EvalBinaryOp(int *left, int op, game *g, int clause, int *i)
  * the i'th position. If we come to an operator of higher precedence
  * we must keep going before we can leave this function. If 'eval' is
  * 0, just move past the number we would evaluate. This function
- * returns 0 on no error. Otherwise an error code is returned.
+ * returns 0 if no error. Otherwise an error code is returned.
  */
 int
 ScanForNumber(game *g, int clause, int *i, int op_type, int *token, int eval)
-- 
cgit v1.2.3