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
|
;;; backquote.el --- Full backquote support for elisp. Reverse compatible too.
;; Copyright (C) 1997 Free Software Foundation, Inc.
;; Maintainer: XEmacs Development Team
;; Keywords: extensions, dumped
;; This file is part of XEmacs.
;; XEmacs is free software; you can redistribute it and/or modify it
;; under the terms of the GNU General Public License as published by
;; the Free Software Foundation; either version 2, or (at your option)
;; any later version.
;; XEmacs is distributed in the hope that it will be useful, but
;; WITHOUT ANY WARRANTY; without even the implied warranty of
;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
;; General Public License for more details.
;; You should have received a copy of the GNU General Public License
;; along with XEmacs; see the file COPYING. If not, write to the Free
;; Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
;; 02111-1307, USA.
;;; Synched up with: Not synched with FSF.
;;; Commentary:
;; This file is dumped with XEmacs.
;; The bulk of the code is originally from CMU Common Lisp (original notice
;; below).
;; It correctly supports nested backquotes and backquoted vectors.
;; Converted to work with elisp by Miles Bader <miles@cogsci.ed.ac.uk>
;; Changes by Jonathan Stigelman <Stig@hackvan.com>:
;; - Documentation added
;; - support for old-backquote-compatibility-hook nixed because the
;; old-backquote compatibility is now done in the reader...
;; - nixed support for |,.| because
;; (a) it's not in CLtl2
;; (b) ",.foo" is the same as ". ,foo"
;; (c) because RMS isn't interested in using this version of backquote.el
;;
;; ben@xemacs.org added ,. support back in:
;; (a) yes, it is in CLtl2. Read closely on page 529.
;; (b) RMS in 19.30 adds C support for ,. even if it's not really
;; handled.
;;
;; **********************************************************************
;; This code was written as part of the CMU Common Lisp project at
;; Carnegie Mellon University, and has been placed in the public domain.
;; If you want to use this code or any part of CMU Common Lisp, please contact
;; Scott Fahlman or slisp-group@cs.cmu.edu.
;;
;; **********************************************************************
;;
;; BACKQUOTE: Code Spice Lispified by Lee Schumacher.
;;
;; The flags passed back by BQ-PROCESS-2 can be interpreted as follows:
;;
;; |`,|: [a] => a
;; NIL: [a] => a ;the NIL flag is used only when a is NIL
;; T: [a] => a ;the T flag is used when a is self-evaluating
;; QUOTE: [a] => (QUOTE a)
;; APPEND: [a] => (APPEND . a)
;; NCONC: [a] => (NCONC . a)
;; LIST: [a] => (LIST . a)
;; LIST*: [a] => (LIST* . a)
;;
;; The flags are combined according to the following set of rules:
;; ([a] means that a should be converted according to the previous table)
;;
;; \ car || otherwise | QUOTE or | |`,@| | |`,.|
;;cdr \ || | T or NIL | |
;;============================================================================
;; |`,| ||LIST* ([a] [d]) |LIST* ([a] [d]) |APPEND (a [d]) |NCONC (a [d])
;; NIL ||LIST ([a]) |QUOTE (a) |<hair> a |<hair> a
;;QUOTE or T||LIST* ([a] [d]) |QUOTE (a . d) |APPEND (a [d]) |NCONC (a [d])
;; APPEND ||LIST* ([a] [d]) |LIST* ([a] [d]) |APPEND (a . d) |NCONC (a [d])
;; NCONC ||LIST* ([a] [d]) |LIST* ([a] [d]) |APPEND (a [d]) |NCONC (a . d)
;; LIST ||LIST ([a] . d) |LIST ([a] . d) |APPEND (a [d]) |NCONC (a [d])
;; LIST* ||LIST* ([a] . d) |LIST* ([a] . d) |APPEND (a [d]) |NCONC (a [d])
;;
;;<hair> involves starting over again pretending you had read ".,a)" instead
;; of ",@a)"
;;
;; These are the forms it expects: |backquote| |`| |,| |,@| and |,.|.
;;; Code:
(defconst bq-backquote-marker 'backquote)
(defconst bq-backtick-marker '\`) ; remnant of the old lossage
(defconst bq-comma-marker '\,)
(defconst bq-at-marker '\,@)
(defconst bq-dot-marker '\,\.)
;;; ----------------------------------------------------------------
(fset '\` 'backquote)
(defmacro backquote (template)
"Expand the internal representation of a backquoted TEMPLATE into a lisp form.
The backquote character is like the quote character in that it prevents the
template which follows it from being evaluated, except that backquote
permits you to evaluate portions of the quoted template. A comma character
inside TEMPLATE indicates that the following item should be evaluated. A
comma character may be followed by an at-sign, which indicates that the form
which follows should be evaluated and inserted and \"spliced\" into the
template. Forms following ,@ must evaluate to lists.
Here is how to use backquotes:
(setq p 'b
q '(c d e))
`(a ,p ,@q) -> (a b c d e)
`(a . b) -> (a . b)
`(a . ,p) -> (a . b)
The XEmacs lisp reader expands lisp backquotes as it reads them.
Examples:
`atom is read as (backquote atom)
`(a ,b ,@(c d e)) is read as (backquote (a (\\, b) (\\,\\@ (c d e))))
`(a . ,p) is read as (backquote (a \\, p))
\(backquote TEMPLATE) is a macro that produces code to construct TEMPLATE.
Note that this is very slow in interpreted code, but fast if you compile.
TEMPLATE is one or more nested lists or vectors, which are `almost quoted'.
They are copied recursively, with elements preceded by comma evaluated.
(backquote (a b)) == (list 'a 'b)
(backquote (a [b c])) == (list 'a (vector 'b 'c))
However, certain special lists are not copied. They specify substitution.
Lists that look like (\\, EXP) are evaluated and the result is substituted.
(backquote (a (\\, (+ x 5)))) == (list 'a (+ x 5))
Elements of the form (\\,\\@ EXP) are evaluated and then all the elements
of the result are substituted. This result must be a list; it may
be `nil'.
Elements of the form (\\,\\. EXP) are evaluated and then all the elements
of the result are concatenated to the list of preceding elements in the list.
They must occur as the last element of a list (not a vector).
EXP may evaluate to nil.
As an example, a simple macro `push' could be written:
(defmacro push (v l)
`(setq ,l (cons ,@(list v l))))
or as
(defmacro push (v l)
`(setq ,l (cons ,v ,l)))
For backwards compatibility, old-style emacs-lisp backquotes are still read.
OLD STYLE NEW STYLE
(` (foo (, bar) (,@ bing))) `(foo ,bar ,@bing)
Because of the old-style backquote support, you cannot use a new-style
backquoted form as the first element of a list. Perhaps some day this
restriction will go away, but for now you should be wary of it:
(`(this ,will ,@fail))
((` (but (, this) will (,@ work))))
This is an extremely rare thing to need to do in lisp."
(bq-process template))
;;; ----------------------------------------------------------------
(defconst bq-comma-flag 'unquote)
(defconst bq-at-flag 'unquote-splicing)
(defconst bq-dot-flag 'unquote-nconc-splicing)
(defun bq-process (form)
(let* ((flag-result (bq-process-2 form))
(flag (car flag-result))
(result (cdr flag-result)))
(cond ((eq flag bq-at-flag)
(error ",@ after ` in form: %s" form))
((eq flag bq-dot-flag)
(error ",. after ` in form: %s" form))
(t
(bq-process-1 flag result)))))
;;; ----------------------------------------------------------------
(defun bq-vector-contents (vec)
(let ((contents nil)
(n (length vec)))
(while (> n 0)
(setq n (1- n))
(setq contents (cons (aref vec n) contents)))
contents))
;;; This does the expansion from table 2.
(defun bq-process-2 (code)
(cond ((vectorp code)
(let* ((dflag-d
(bq-process-2 (bq-vector-contents code))))
(cons 'vector (bq-process-1 (car dflag-d) (cdr dflag-d)))))
((atom code)
(cond ((null code) (cons nil nil))
((or (numberp code) (eq code t))
(cons t code))
(t (cons 'quote code))))
((eq (car code) bq-at-marker)
(cons bq-at-flag (nth 1 code)))
((eq (car code) bq-dot-marker)
(cons bq-dot-flag (nth 1 code)))
((eq (car code) bq-comma-marker)
(bq-comma (nth 1 code)))
((or (eq (car code) bq-backquote-marker)
(eq (car code) bq-backtick-marker)) ; old lossage
(bq-process-2 (bq-process (nth 1 code))))
(t (let* ((aflag-a (bq-process-2 (car code)))
(aflag (car aflag-a))
(a (cdr aflag-a)))
(let* ((dflag-d (bq-process-2 (cdr code)))
(dflag (car dflag-d))
(d (cdr dflag-d)))
(if (eq dflag bq-at-flag)
;; get the errors later.
(error ",@ after dot in %s" code))
(if (eq dflag bq-dot-flag)
(error ",. after dot in %s" code))
(cond
((eq aflag bq-at-flag)
(if (null dflag)
(bq-comma a)
(cons 'append
(cond ((eq dflag 'append)
(cons a d ))
(t (list a (bq-process-1 dflag d)))))))
((eq aflag bq-dot-flag)
(if (null dflag)
(bq-comma a)
(cons 'nconc
(cond ((eq dflag 'nconc)
(cons a d))
(t (list a (bq-process-1 dflag d)))))))
((null dflag)
(if (memq aflag '(quote t nil))
(cons 'quote (list a))
(cons 'list (list (bq-process-1 aflag a)))))
((memq dflag '(quote t))
(if (memq aflag '(quote t nil))
(cons 'quote (cons a d ))
(cons 'list* (list (bq-process-1 aflag a)
(bq-process-1 dflag d)))))
(t (setq a (bq-process-1 aflag a))
(if (memq dflag '(list list*))
(cons dflag (cons a d))
(cons 'list*
(list a (bq-process-1 dflag d)))))))))))
;;; This handles the <hair> cases
(defun bq-comma (code)
(cond ((atom code)
(cond ((null code)
(cons nil nil))
((or (numberp code) (eq code 't))
(cons t code))
(t (cons bq-comma-flag code))))
((eq (car code) 'quote)
(cons (car code) (car (cdr code))))
((memq (car code) '(append list list* nconc))
(cons (car code) (cdr code)))
((eq (car code) 'cons)
(cons 'list* (cdr code)))
(t (cons bq-comma-flag code))))
;;; This handles table 1.
(defun bq-process-1 (flag thing)
(cond ((or (eq flag bq-comma-flag)
(memq flag '(t nil)))
thing)
((eq flag 'quote)
(list 'quote thing))
((eq flag 'vector)
(list 'apply '(function vector) thing))
(t (cons (cdr
(assq flag
'((cons . cons)
(list* . bq-list*)
(list . list)
(append . append)
(nconc . nconc))))
thing))))
;;; ----------------------------------------------------------------
(defmacro bq-list* (&rest args)
"Return a list of its arguments with last cons a dotted pair."
(setq args (reverse args))
(let ((result (car args)))
(setq args (cdr args))
(while args
(setq result (list 'cons (car args) result))
(setq args (cdr args)))
result))
(provide 'backquote)
;;; backquote.el ends here
|