Typo fix

Signed-off-by: Jérôme Benoit <jerome.benoit@piment-noir.org>

diff --git a/exercices/arithmetic.lsp b/exercices/arithmetic.lsp
index 0d55480f69eb758f476ebd94033c8dcf0a8612ad..8a474bfd5f424949de8bb109e5f3389f282b65df 100755 (executable)
--- 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.
     ; 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.
 
     ))
     ;do it again on the upper layer recursively until we only have (op A B) that just match no known simplication rules.
 
     ))