1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448
|
;;;-*- Mode:LISP; Package:CHAOS; Base:10; Syntax:Common-lisp -*-
;;;
;;; Copyright (c) 2000-2015, Toshimi Sawada. All rights reserved.
;;;
;;; Redistribution and use in source and binary forms, with or without
;;; modification, are permitted provided that the following conditions
;;; are met:
;;;
;;; * Redistributions of source code must retain the above copyright
;;; notice, this list of conditions and the following disclaimer.
;;;
;;; * Redistributions in binary form must reproduce the above
;;; copyright notice, this list of conditions and the following
;;; disclaimer in the documentation and/or other materials
;;; provided with the distribution.
;;;
;;; THIS SOFTWARE IS PROVIDED BY THE AUTHOR 'AS IS' AND ANY EXPRESSED
;;; OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
;;; WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
;;; ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
;;; DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
;;; DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
;;; GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
;;; INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
;;; WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
;;; NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
;;; SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
;;;
(in-package :chaos)
#|==============================================================================
System: CHAOS
Module: thstuff
File: eval-apply.lisp
==============================================================================|#
#-:chaos-debug
(declaim (optimize (speed 3) (safety 0) #-GCL (debug 0)))
#+:chaos-debug
(declaim (optimize (speed 1) (safety 3) #-GCL (debug 3)))
;;; *****
;;; START
;;; *****
(defun eval-start-command (ast)
(do-eval-start-th (%start-target ast) (get-context-module)))
(defun do-eval-start-th (pre-term &optional context)
(catch 'apply-context-error
(let ((mod (if context
(eval-modexp context)
(get-context-module))))
(if (or (null mod) (modexp-is-error mod))
(if (null mod)
(with-output-chaos-error ('invalid-module)
(princ "no module expression provided and no current module."))
(with-output-chaos-error ('invalid-module)
(format t "incorrect module expression: ~a" context)))
(if pre-term
(with-in-module (mod)
(prepare-for-parsing *current-module*)
(cond ((or (equal pre-term '("$$term"))
(equal pre-term '("$$subterm")))
(let ((target nil))
(catch 'term-context-error
(setq target (get-bound-value (car pre-term))))
(unless target
(return-from do-eval-start-th nil))
(setq $$action-stack nil)
(reset-reduced-flag target)
(reset-target-term target *current-module* mod)))
(t
(let ((*parse-variables* nil))
(let ((res (simple-parse *current-module*
pre-term
*cosmos*)))
(when (term-is-an-error res)
(return-from do-eval-start-th nil))
(setq $$action-stack nil)
(reset-target-term res *current-module* mod))))))
;; try use $$term
(progn
(when (or (null $$term) (eq 'void $$term))
(with-output-chaos-warning ()
(format t "no target term is given!")
(return-from do-eval-start-th nil)))
(check-apply-context mod)
(setq $$action-stack nil)
(reset-reduced-flag $$term)
(reset-target-term $$term (get-context-module) mod))))
(when (command-final) (command-display))
t)))
;;; ******
;;; CHOOSE
;;; ******
(defun eval-choose-command (ast)
(unless $$subterm (setq $$subterm $$term))
(unless $$subterm
(with-output-chaos-warning ()
(format t "no target term is specified yet.")
(print-next)
(princ "please set the target term by `start' command.")
(return-from eval-choose-command nil)))
(let ((selectors (%choose-selectors ast)))
(when (eq selectors ':top)
(setq $$subterm $$term)
(setq $$selection-stack nil)
(return-from eval-choose-command nil))
(with-in-module ((get-context-module))
(multiple-value-bind (subterm-sort subterm)
(compute-selection $$subterm selectors)
(declare (ignore subterm-sort))
(push selectors $$selection-stack)
(setq $$subterm subterm)))))
;;; *************
;;; INSPECT-TERM
;;; *************
(defun eval-inspect-term-command (&optional ast)
(declare (ignore ast))
(unless $$subterm (setq $$subterm $$term))
(unless $$subterm
(with-output-chaos-warning ()
(format t "no target term is specified yet.")
(print-next)
(princ "please set the target term by `choose' command.")
(return-from eval-inspect-term-command nil)))
(inspect-term $$subterm))
;;; *****
;;; APPLY
;;; *****
(defvar *-applied-* nil)
(defvar *-inside-apply-all-* nil)
;;; top-level evaluator
(defun eval-apply-command (ast)
(let ((action (%apply-action ast))
(rule-spec (%apply-rule-spec ast))
(substitution (%apply-substitution ast))
(where-spec (%apply-where-spec ast))
(selectors (%apply-selectors ast)))
(catch 'apply-context-error
(when (eq action :help)
(apply-help)
(return-from eval-apply-command nil))
;; check some evaluation env
(when (or (null $$term) (eq 'void $$term))
(with-output-chaos-error ('invalid-term)
(princ "term to be applied is not defined.")))
;; real work begins here ------------------------------
(with-in-module ((get-context-module))
(multiple-value-bind (subterm-sort subterm)
(compute-selection $$term selectors)
(setq *-applied-* t)
(case action
(:reduce ; full reduction on selections.
(!setup-reduction *current-module*)
(let ((*rewrite-semantic-reduce*
(module-has-behavioural-axioms *current-module*))
(*rewrite-exec-mode* nil))
(term-replace subterm (@copy-term subterm))
(reset-reduced-flag subterm)
(rewrite subterm *current-module*)))
(:breduce
(!setup-reduction *current-module*)
(let ((*rewrite-semantic-reduce* nil)
(*rewrite-exec-mode* nil))
(term-replace subterm (@copy-term subterm))
(reset-reduced-flag subterm)
(rewrite subterm *current-module*)))
(:exec
(!setup-reduction *current-module*)
(let ((*rewrite-semantic-reduce*
(module-has-behavioural-axioms *current-module*))
(*rewrite-exec-mode* t))
(term-replace subterm (@copy-term subterm))
(reset-reduced-flag subterm)
(rewrite subterm *current-module*)))
;;
(:print ; print selections.
(format t "~%term ")
(disp-term subterm)
(format t "~&tree form")
(print-term-tree subterm))
(:apply ; apply specified rule.
(setq *-applied-* nil)
(let* ((actrule (compute-action-rule rule-spec
substitution
selectors))
(*-inside-apply-with-extensions-*
(and
(let ((arlhs (rule-lhs actrule)))
(and (term-is-application-form? arlhs)
(method-is-associative (term-head arlhs)))))))
(if (eq :within where-spec)
(let ((*-inside-apply-all-* t))
(catch 'apply-all-quit
(@apply-all actrule subterm-sort subterm)))
(@apply-rule actrule subterm-sort subterm)))
(when *-applied-*
(update-lowest-parse $$term)
(when (nth 2 rule-spec) ; reverse order
(setq $$term (@copy-term $$term)))
(reset-target-term $$term *current-module* *current-module*))) ; end :apply
(t (with-output-panic-message ()
(format t "unknown apply action : ~a" action)
(chaos-error 'unknown-action))))
;;
(unless *-applied-*
(with-output-chaos-warning ()
(princ "rule not applied")))
;;
(command-final)
(command-display))))))
(defvar *copy-conditions*)
(declaim (special *copy-conditons*))
(defvar *apply-debug* nil)
(defun @apply-one-rule (rule sort term)
(when *apply-debug*
(princ "* @apply-one-rule : rule = ")
(print-chaos-object rule)
(format t "~%- sort = ") (print-sort-name sort)
(format t "~&- term = ") (term-print term))
(let ((*self* term))
(let ((cond (rule-condition rule)))
(if (or *reduce-conditions* (is-true? cond))
(let ((lhs (rule-lhs rule)))
(if (term-is-variable? lhs)
(multiple-value-bind (gs sub no eeq)
(@matcher lhs (@copy-term term) :match) ; why?
(declare (ignore gs))
(when eeq (setq sub nil))
(unless (or no
(and (not (is-true? cond))
(not (is-true?
(!normalize-term
(@copy-term
(substitution-image! sub cond)))))))
(setq *-applied-* t)
(term-replace-dd-simple term
(@copy-term
(substitution-image! sub
(rule-rhs rule))))))
(let ((*copy-conditions* t))
(let ((res (apply-one-rule-no-simplify rule term)))
(when res
(term-replace-dd-simple term
(@copy-term term))
(setq *-applied-* t))
)))
term)
;; "recurse" on condition
(let ((lhs (rule-lhs rule))
(rhs (rule-rhs rule)))
(multiple-value-bind (gs sub no eeq)
(@matcher lhs (@copy-term term) :match)
(declare (ignore gs))
(when eeq (setq sub nil))
(unless no
(setq *-applied-* t)
(format t "~%shifting focus to condition")
(force-output)
(let ((cond-inst (@copy-term (substitution-image! sub cond)))
(rhs-inst
(@copy-term (substitution-image! sub rhs))))
(setq $$action-stack
(cons
(list $$term term rule cond-inst rhs-inst sort)
$$action-stack))
(setq $$term cond-inst)
(when *-inside-apply-all-*
(format t "~%-- applying rule only at first position found: ")
(term-print term)
(force-output)
(throw 'apply-all-quit nil))))))))))
;;; APPLY-ONE-RULE-NO-SIMPLIFY (rule term)
;;;
(defun apply-one-rule-no-simplify (rule term)
(when *apply-debug*
(with-output-simple-msg ()
(princ "[apply]: rule = ")
(print-chaos-object rule)
(print-next)
(princ " term = ")
(print-chaos-object term)))
(block the-end
(let ((condition nil)
next-match-method
;; (*do-unify* t)
(*self* term))
(multiple-value-bind (global-state subst nomatch Eequal)
(funcall (rule-first-match-method rule) (rule-lhs rule) term)
(when nomatch (return-from the-end nil))
(when *apply-debug*
(format t "~%[apply-one-rule] : ")
(format t "~% subst = ")
(print-substitution subst)
(format t "~% Eequal = ~a" eequal))
;; technical assignation related to substitution$image
(when Eequal (setq subst nil))
;; the condition must be checked
(block try-rule
(catch 'rule-failure
(when (is-true? (setq condition (rule-condition rule)))
;; there is no condition
(term-replace-dd-simple term
(if (rule-is-builtin rule)
(multiple-value-bind (newterm success)
(funcall (lisp-form-function
(rule-rhs rule)) subst)
(if success
newterm
(return-from try-rule nil)))
;; note that the computation of the substitution
;; made a copy of the rhs.
(substitution-image!
subst
(rule-rhs rule))))
(return-from the-end t))))
;; if the condition is not trivial, we enter in a loop
;; where one try to find a match such that the condition
;; is satisfied
(setf next-match-method (rule-next-match-method rule))
(loop
(when nomatch (return)) ; exit from loop
(block try-rule
(catch 'rule-failure
(when (is-true?
(let (($$cond (substitution-image
;; want to avoid recopying the whole
(if *copy-conditions*
(mapcar #'(lambda (x)
(cons (car x)
(@copy-term (cdr x))))
subst)
subst)
condition)))
(!normalize-term $$cond)))
;; the condition is satisfied
(term-replace-dd-simple
term
(if (rule-is-builtin rule)
(multiple-value-bind (newterm success)
(funcall (lisp-form-function (rule-rhs rule)) subst)
(if success
newterm
(return-from try-rule nil)))
(substitution-image! subst (rule-rhs rule))))
(return-from the-end t)))
) ; block try-rule
;; else, try another ...
(multiple-value-setq (global-state subst nomatch)
(funcall next-match-method global-state))
) ; end loop
;; In this case there is no match at all and the rule does not apply
(return-from the-end nil)))))
(defun @apply-rule (rule sort term)
(if (and *-inside-apply-with-extensions-*
(term-is-application-form? term)
(method-is-of-same-operator (term-head (rule-lhs rule))
(term-head term)))
(@apply-rule-with-extensions rule sort term)
(@apply-one-rule rule sort term)))
(defun @apply-rule-with-extensions (rule sort term)
(let ((top (term-head (rule-lhs rule))))
(if (method-is-associative top)
(let ((is-applied nil)
(is-AC (method-is-commutative top)))
(when (@test-rule rule term)
(@apply-one-rule rule sort term)
(setq is-applied *-applied-*))
(unless is-applied
(dolist (r (if is-AC
(compute-AC-extension rule top)
(compute-A-extensions rule top)))
(when (and r (@test-rule r term))
(@apply-one-rule r sort term)
(setq is-applied *-applied-*)
(return)))))
;; only hit this case if top of rule lhs wasn't associative
(@apply-one-rule rule sort term)))
nil)
;;;
;;; @apply-all
;;;
(defun @apply-all (rule sort term)
(if (term-is-variable? term)
(when (@test-rule rule term) (@apply-rule rule sort term))
(if (@test-rule rule term)
(@apply-rule rule sort term)
(if (term-is-application-form? term)
(mapc #'(lambda (s x) (@apply-all rule s x))
(method-arity (term-head term))
(term-subterms term)))))
nil)
;;;
;;; apply-print-rule
;;;
(defun apply-print-rule (x)
(unless x
(format t "~%That dosen't make sense as a rule specification.")
(return-from apply-print-rule t))
(let* ((act (get-apply-action x))
(rule-spec (if (eq act :apply)
(parse-rule-spec x))))
;;
(if (eq :reduce act)
(format t "~%special rule for reduction of a selected subterm.")
(if (eq :print act)
(format t "~%special rule to print-the selected subterm.")
(progn
(when (or (eq :error rule-spec) (null rule-spec))
(format t "~%That doesn't make sense as a rule specification.")
(return-from apply-print-rule t))
(let ((num (cadr rule-spec))
(mod (car rule-spec))
(rev (caddr rule-spec)))
(format t "~&rule ~a" num)
(when rev (format t " (reversed)"))
(if (equal "" mod)
(format t " of the last module")
(format t " of module ~a" mod))
(multiple-value-bind (rule module)
(compute-action-rule rule-spec nil)
(with-in-module (module)
(format t "~& ")
(print-chaos-object rule)
(when (and rev (or (rule-is-builtin rule)
(eq (axiom-type rule) :rule)))
(format t "~%This rule cannot be applied reversed."))
(when (and (get-context-module t)
(not (rule-is-builtin rule)))
(format t "~%(This rule rewrites up.)"))))))))
t))
;;; EOF
|