From 0d4022bb98731fa1ff6f824928d013a839a0361b Mon Sep 17 00:00:00 2001
From: =?utf8?q?J=C3=A9r=C3=B4me=20Benoit?= <jerome.benoit@piment-noir.org>
Date: Mon, 16 Oct 2017 13:00:40 +0200
Subject: [PATCH] Typo fix
MIME-Version: 1.0
Content-Type: text/plain; charset=utf8
Content-Transfer-Encoding: 8bit
Signed-off-by: Jérôme Benoit <jerome.benoit@piment-noir.org>
---
exercices/arithmetic.lsp | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/exercices/arithmetic.lsp b/exercices/arithmetic.lsp
index 0d55480..8a474bf 100755
--- a/exercices/arithmetic.lsp
+++ b/exercices/arithmetic.lsp
@@ -86,7 +86,7 @@
; I'm having hard time to find a way of escaping the '(' and ')' characters
((= (first L) ) (rest L))
;here is the idea: detect the lower well formed expression: begin with (op and finish with ) where op = + - * / and have only two parameters that are atoms.
- ;then if it match a know pattern, simplify it by following the matching rule.
+ ;then if it match a known pattern, simplify it by following the matching rule.
;do it again on the upper layer recursively until we only have (op A B) that just match no known simplication rules.
))
--
2.43.0