| 1 | ;;; -*-  Mode: Lisp -*- 
 | 
|---|
| 2 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 | 
|---|
| 3 | ;;;                                                                              
 | 
|---|
| 4 | ;;;  Copyright (C) 1999, 2002, 2009, 2015 Marek Rychlik <rychlik@u.arizona.edu>          
 | 
|---|
| 5 | ;;;                                                                              
 | 
|---|
| 6 | ;;;  This program is free software; you can redistribute it and/or modify        
 | 
|---|
| 7 | ;;;  it under the terms of the GNU General Public License as published by        
 | 
|---|
| 8 | ;;;  the Free Software Foundation; either version 2 of the License, or           
 | 
|---|
| 9 | ;;;  (at your option) any later version.                                         
 | 
|---|
| 10 | ;;;                                                                              
 | 
|---|
| 11 | ;;;  This program is distributed in the hope that it will be useful,             
 | 
|---|
| 12 | ;;;  but WITHOUT ANY WARRANTY; without even the implied warranty of              
 | 
|---|
| 13 | ;;;  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the               
 | 
|---|
| 14 | ;;;  GNU General Public License for more details.                                
 | 
|---|
| 15 | ;;;                                                                              
 | 
|---|
| 16 | ;;;  You should have received a copy of the GNU General Public License           
 | 
|---|
| 17 | ;;;  along with this program; if not, write to the Free Software                 
 | 
|---|
| 18 | ;;;  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.  
 | 
|---|
| 19 | ;;;                                                                              
 | 
|---|
| 20 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 | 
|---|
| 21 | 
 | 
|---|
| 22 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 | 
|---|
| 23 | ;;
 | 
|---|
| 24 | ;; Run tests using 5am unit testing framework
 | 
|---|
| 25 | ;;
 | 
|---|
| 26 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 | 
|---|
| 27 | 
 | 
|---|
| 28 | ;; We assume that QuickLisp package manager is installed.
 | 
|---|
| 29 | ;; See :
 | 
|---|
| 30 | ;;      https://www.quicklisp.org/beta/
 | 
|---|
| 31 | ;;
 | 
|---|
| 32 | 
 | 
|---|
| 33 | ;; The following is unnecessary after running:
 | 
|---|
| 34 | ;; * (ql:add-to-init-file)
 | 
|---|
| 35 | ;; at lisp prompt:
 | 
|---|
| 36 | ;;(load "~/quicklisp/setup")
 | 
|---|
| 37 | 
 | 
|---|
| 38 | (ql:quickload :fiveam)
 | 
|---|
| 39 | 
 | 
|---|
| 40 | (defpackage #:5am-monom
 | 
|---|
| 41 |   (:use :cl :it.bese.fiveam :infix-printer)
 | 
|---|
| 42 |   (:documentation "Infix printing tests"))
 | 
|---|
| 43 | 
 | 
|---|
| 44 | (in-package :5am-monom)
 | 
|---|
| 45 | 
 | 
|---|
| 46 | (def-suite infix-printer-suite
 | 
|---|
| 47 |     :description "Infix printer suite")
 | 
|---|
| 48 | 
 | 
|---|
| 49 | (in-suite infix-printer-suite)
 | 
|---|
| 50 | 
 | 
|---|
| 51 | (test operator-precedence 
 | 
|---|
| 52 |   "Operator precedence"
 | 
|---|
| 53 |   (is (equal (infix-print-to-string '(* (+ a b) c)) "(A+B)*C"))
 | 
|---|
| 54 |   (is (equal (infix-print-to-string '(+ (* a b) c)) "A*B+C"))
 | 
|---|
| 55 |   (is (equal (infix-print-to-string '(sin x)) "SIN(X)"))
 | 
|---|
| 56 |   ;; TODO: Eliminate an extra level of parenthesis in expression below. This
 | 
|---|
| 57 |   ;; requires changing condition to parenthesize in INFIX-PRINT. The deeper
 | 
|---|
| 58 |   ;; complication is that the INFIX package defines the precedence of
 | 
|---|
| 59 |   ;; operators, and it defines token operators. Thus, consistency
 | 
|---|
| 60 |   ;; should be ensured so that the printed expression can be read back
 | 
|---|
| 61 |   ;; observing the precedence defined in the INFIX package
 | 
|---|
| 62 |   (is (equal (infix-print-to-string '(* 3 (sin x))) "3*(SIN(X))"))
 | 
|---|
| 63 |   (is (equal (infix-print-to-string '(+ (* 3 x) (- (* 2 (expt y 2)) z))) "3*X+2*(Y^2)-Z"))
 | 
|---|
| 64 |   ;; Distinguich between unary and binary minus
 | 
|---|
| 65 |   (is (equal (infix-print-to-string '(+ x (- y z))) "X+Y-Z"))
 | 
|---|
| 66 |   (is (equal (infix-print-to-string '(+ x (- y))) "X-Y"))
 | 
|---|
| 67 |   (is (equal (infix-print-to-string '(- x (- y))) "X+Y"))
 | 
|---|
| 68 |   (is (equal (infix-print-to-string '(- x (- y z))) "X-Y+Z"))
 | 
|---|
| 69 |   ;; Distinguich between unary and binary division
 | 
|---|
| 70 |   (is (equal (infix-print-to-string '(* x (/ y z))) "X*Y/Z"))
 | 
|---|
| 71 |   (is (equal (infix-print-to-string '(* x (/ y))) "X/Y"))
 | 
|---|
| 72 |   ;; Handling negative numbers
 | 
|---|
| 73 |   (is (equal (infix-print-to-string '(+ x -1 2 -3)) "X-1+2-3"))
 | 
|---|
| 74 |   (is (equal (infix-print-to-string '(- x (- y 7))) "X-Y+7"))
 | 
|---|
| 75 |   )
 | 
|---|
| 76 | 
 | 
|---|
| 77 | 
 | 
|---|
| 78 | (run! 'infix-printer-suite)
 | 
|---|
| 79 | (format t "All tests done!~%")
 | 
|---|
| 80 | 
 | 
|---|
| 81 | 
 | 
|---|