From: Jérôme Benoit Date: Mon, 16 Oct 2017 11:00:40 +0000 (+0200) Subject: Typo fix X-Git-Url: https://git.piment-noir.org/?a=commitdiff_plain;h=0d4022bb98731fa1ff6f824928d013a839a0361b;p=TD_LISP.git Typo fix Signed-off-by: Jérôme Benoit --- 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. ))