; with-dynamic-binding routines to associate symbols to different bindings
; over a dynamic extent.
-
; Record type used to hold the data necessary.
(define bindings-type
(make-record-type 'bindings
'(needed-globals lexical-bindings)))
-
; Construct an 'empty' instance of the bindings data structure to be used
; at the start of a fresh compilation.
(define (make-bindings)
((record-constructor bindings-type) '() (make-hash-table)))
-
; Mark that a given symbol is needed as global in the specified slot-module.
(define (mark-global-needed! bindings sym module)
(new-needed (assoc-set! old-needed module new-in-module)))
((record-modifier bindings-type 'needed-globals) bindings new-needed)))
-
; Cycle through all globals needed in order to generate the code for their
; creation or some other analysis.
(cons (proc module (car sym-tail))
sym-result))))))))))
-
; Get the current lexical binding (gensym it should refer to in the current
; scope) for a symbol or #f if it is dynamically bound.
(fluid-ref slot)
#f)))
-
; Establish a binding or mark a symbol as dynamically bound for the extent of
; calling proc.
;; it under the terms of the GNU General Public License as published by
;; the Free Software Foundation; either version 3, or (at your option)
;; any later version.
-;;
+;;
;; This program 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 this program; see the file COPYING. If not, write to
;; the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
#:use-module (srfi srfi-1)
#:export (compile-tree-il))
-
; Certain common parameters (like the bindings data structure or compiler
; options) are not always passed around but accessed using fluids to simulate
; dynamic binding (hey, this is about elisp).
; The bindings data structure to keep track of symbol binding related data.
+
(define bindings-data (make-fluid))
; Store for which symbols (or all/none) void checks are disabled.
+
(define disable-void-check (make-fluid))
; Store which symbols (or all/none) should always be bound lexically, even
; with ordinary let and as lambda arguments.
-(define always-lexical (make-fluid))
+(define always-lexical (make-fluid))
; Find the source properties of some parsed expression if there are any
; associated with it.
(and (not (null? props))
props))))
-
; Values to use for Elisp's nil and t.
(define (nil-value loc) (make-const loc (@ (language elisp runtime) nil-value)))
-(define (t-value loc) (make-const loc (@ (language elisp runtime) t-value)))
+(define (t-value loc) (make-const loc (@ (language elisp runtime) t-value)))
; Modules that contain the value and function slot bindings.
(define runtime '(language elisp runtime))
+
(define macro-slot '(language elisp runtime macro-slot))
+
(define value-slot (@ (language elisp runtime) value-slot-module))
-(define function-slot (@ (language elisp runtime) function-slot-module))
+(define function-slot (@ (language elisp runtime) function-slot-module))
; The backquoting works the same as quasiquotes in Scheme, but the forms are
; named differently; to make easy adaptions, we define these predicates checking
(define (unquote-splicing? sym)
(and (symbol? sym) (eq? sym '\,@)))
-
; Build a call to a primitive procedure nicely.
(define (call-primitive loc sym . args)
(make-application loc (make-primitive-ref loc sym) args))
-
; Error reporting routine for syntax/compilation problems or build code for
; a runtime-error output.
(make-application loc (make-primitive-ref loc 'error)
(cons (make-const loc msg) args)))
-
; Generate code to ensure a global symbol is there for further use of a given
; symbol. In general during the compilation, those needed are only tracked with
; the bindings data structure. Afterwards, however, for all those needed
(list (make-const loc module)
(make-const loc sym))))
-
; See if we should do a void-check for a given variable. That means, check
; that this check is not disabled via the compiler options for this symbol.
; Disabling of void check is only done for the value-slot module!
(and (not (eq? disabled 'all))
(not (memq sym disabled))))))
-
; Build a construct that establishes dynamic bindings for certain variables.
; We may want to choose between binding with fluids and with-fluids* and
; using just ordinary module symbols and setting/reverting their values with
(make-lambda loc '()
(make-lambda-case #f '() #f #f #f '() '() body #f))))
-
; Handle access to a variable (reference/setting) correctly depending on
; whether it is currently lexically or dynamically bound.
; lexical access is done only for references to the value-slot module!
(handle-lexical lexical)
(handle-dynamic))))
-
; Generate code to reference a variable.
; For references in the value-slot module, we may want to generate a lexical
; reference instead if the variable has a lexical binding.
(call-primitive loc 'fluid-ref
(make-module-ref loc module sym #t)))))
-
; Reference a variable and error if the value is void.
(define (reference-with-check loc sym module)
(make-lexical-ref loc 'value var))))
(reference-variable loc sym module)))
-
; Generate code to set a variable.
; Just as with reference-variable, in case of a reference to value-slot,
; we want to generate a lexical set when the variable has a lexical binding.
(make-module-ref loc module sym #t)
value))))
-
; Process the bindings part of a let or let* expression; that is, check for
; correctness and bring it to the form ((sym1 . val1) (sym2 . val2) ...).
(cons (car b) (cadr b))))))
bindings))
-
; Split the let bindings into a list to be done lexically and one dynamically.
; A symbol will be bound lexically if and only if:
; We're processing a lexical-let (i.e. module is 'lexical), OR
(iterate (cdr tail) (cons (car tail) lexical) dynamic)
(iterate (cdr tail) lexical (cons (car tail) dynamic))))))
-
; Compile let and let* expressions. The code here is used both for let/let*
; and flet/flet*, just with a different bindings module.
;
; among the bindings, we first do a let for all of them to evaluate all
; values before any bindings take place, and then call let-dynamic for the
; variables to bind dynamically.
+
(define (generate-let loc module bindings body)
(let ((bind (process-let-bindings loc bindings)))
(call-with-values
dynamic-syms)
(make-body)))))))))))))
-
; Let* is compiled to a cascaded set of "small lets" for each binding in turn
; so that each one already sees the preceding bindings.
+
(define (generate-let* loc module bindings body)
(let ((bind (process-let-bindings loc bindings)))
(begin
`(,(caar tail)) module `(,value)
(iterate (cdr tail))))))))))
-
; Split the argument list of a lambda expression into required, optional and
; rest arguments and also check it is actually valid.
; Additionally, we create a list of all "local variables" (that is, required,
(lexical '())
(dynamic '()))
(cond
-
((null? tail)
(let ((final-required (reverse required))
(final-optional (reverse optional))
(final-dynamic (reverse dynamic)))
(values final-required final-optional #f
final-lexical final-dynamic)))
-
((and (eq? mode 'required)
(eq? (car tail) '&optional))
(iterate (cdr tail) 'optional required optional lexical dynamic))
-
((eq? (car tail) '&rest)
(if (or (null? (cdr tail))
(not (null? (cddr tail))))
(cons rest dynamic)))))
(values final-required final-optional rest
final-lexical final-dynamic))))
-
(else
(if (not (symbol? (car tail)))
(report-error loc "expected symbol in argument list, got" (car tail))
(else
(error "invalid mode in split-lambda-arguments" mode)))))))))
-
; Compile a lambda expression. Things get a little complicated because TreeIL
; does not allow optional arguments but only one rest argument, and also the
; rest argument should be nil instead of '() for no values given. Because of
; Build the code to handle setting of optional arguments that are present
; and updating the rest list.
+
(define (process-optionals loc optional rest-name rest-sym)
(let iterate ((tail optional))
(if (null? tail)
(iterate (cdr tail))))))))
; This builds the code to set the rest variable to nil if it is empty.
+
(define (process-rest loc rest rest-name rest-sym)
(let ((rest-empty (call-primitive loc 'null?
(make-lexical-ref loc rest-name rest-sym))))
(runtime-error loc "too many arguments and no rest argument")))
(else (make-void loc)))))
-
; Handle the common part of defconst and defvar, that is, checking for a correct
; doc string and arguments as well as maybe in the future handling the docstring
; somehow.
; TODO: Handle doc string if present.
(else #t)))
-
; Handle macro bindings.
(define (is-macro? sym)
(define (get-macro sym)
(module-ref (resolve-module macro-slot) sym))
-
; See if a (backquoted) expression contains any unquotes.
(define (contains-unquotes? expr)
(contains-unquotes? (cdr expr))))
#f))
-
; Process a backquoted expression by building up the needed cons/append calls.
-; For splicing, it is assumed that the expression spliced in evaluates to a
+; For splicing, it is assumed that the expression spliced in evaluates to a
; list. The emacs manual does not really state either it has to or what to do
; if it does not, but Scheme explicitly forbids it and this seems reasonable
; also for elisp.
(define (unquote-cell? expr)
(and (list? expr) (= (length expr) 2) (unquote? (car expr))))
+
(define (unquote-splicing-cell? expr)
(and (list? expr) (= (length expr) 2) (unquote-splicing? (car expr))))
(report-error loc "non-pair expression contains unquotes" expr))
(make-const loc expr)))
-
; Temporarily update a list of symbols that are handled specially (disabled
; void check or always lexical) for compiling body.
; We need to handle special cases for already all / set to all and the like.
(with-fluids ((fluid new))
(make-body))))))
-
; Compile a symbol expression. This is a variable reference or maybe some
; special value like nil.
((t) (t-value loc))
(else (reference-with-check loc sym value-slot))))
-
; Compile a pair-expression (that is, any structure-like construct).
(define (compile-pair loc expr)
(pmatch expr
-
((progn . ,forms)
(make-sequence loc (map compile-expr forms)))
(make-conditional loc (compile-expr condition)
(compile-expr ifclause)
(nil-value loc)))
+
((if ,condition ,ifclause ,elseclause)
(make-conditional loc (compile-expr condition)
(compile-expr ifclause)
(compile-expr elseclause)))
+
((if ,condition ,ifclause . ,elses)
(make-conditional loc (compile-expr condition)
(compile-expr ifclause)
(make-const loc sym)))))
((defvar ,sym) (make-const loc sym))
+
((defvar ,sym ,value . ,doc)
(if (handle-var-def loc sym doc)
(make-sequence loc
; Build a set form for possibly multiple values. The code is not formulated
; tail recursive because it is clearer this way and large lists of symbol
; expression pairs are very unlikely.
+
((setq . ,args) (guard (not (null? args)))
(make-sequence loc
(let iterate ((tail args))
(not (null? bindings))
(not (null? body))))
(generate-let loc value-slot bindings body))
+
((lexical-let ,bindings . ,body) (guard (and (list? bindings)
(not (null? bindings))
(not (null? body))))
(generate-let loc 'lexical bindings body))
+
((flet ,bindings . ,body) (guard (and (list? bindings)
(not (null? bindings))
(not (null? body))))
(not (null? bindings))
(not (null? body))))
(generate-let* loc value-slot bindings body))
+
((lexical-let* ,bindings . ,body) (guard (and (list? bindings)
(not (null? bindings))
(not (null? body))))
(generate-let* loc 'lexical bindings body))
+
((flet* ,bindings . ,body) (guard (and (list? bindings)
(not (null? bindings))
(not (null? body))))
; elisp as a way to access data within
; the Guile universe. The module and symbol referenced are static values,
; just like (@ module symbol) does!
+
((guile-ref ,module ,sym) (guard (and (list? module) (symbol? sym)))
(make-module-ref loc module sym #t))
; guile-primitive allows to create primitive references, which are still
; a little faster.
+
((guile-primitive ,sym) (guard (symbol? sym))
(make-primitive-ref loc sym))
;
; As letrec is not directly accessible from elisp, while is implemented here
; instead of with a macro.
+
((while ,condition . ,body)
(let* ((itersym (gensym))
(compiled-body (map compile-expr body))
; Either (lambda ...) or (function (lambda ...)) denotes a lambda-expression
; that should be compiled.
+
((lambda ,args . ,body)
(compile-lambda loc args body))
+
((function (lambda ,args . ,body))
(compile-lambda loc args body))
; Build a lambda and also assign it to the function cell of some symbol.
; This is no macro as we might want to honour the docstring at some time;
; just as with defvar/defconst.
+
((defun ,name ,args . ,body)
(if (not (symbol? name))
(report-error loc "expected symbol as function name" name)
; Define a macro (this is done directly at compile-time!).
; FIXME: Recursive macros don't work!
+
((defmacro ,name ,args . ,body)
(if (not (symbol? name))
(report-error loc "expected symbol as macro name" name)
(make-const loc name))))
; XXX: Maybe we could implement backquotes in macros, too.
+
((,backq ,val) (guard (backquote? backq))
(process-backquote loc val))
; XXX: Why do we need 'quote here instead of quote?
+
(('quote ,val)
(make-const loc val))
; Macro calls are simply expanded and recursively compiled.
+
((,macro . ,args) (guard (and (symbol? macro) (is-macro? macro)))
(let ((expander (get-macro macro)))
(compile-expr (apply expander args))))
; take the function value of a symbol if it is one. It seems that functions
; in form of uncompiled lists are not supported in this syntax, so we don't
; have to care for them.
+
((,func . ,args)
(make-application loc
(if (symbol? func)
(else
(report-error loc "unrecognized elisp" expr))))
-
; Compile a single expression to TreeIL.
(define (compile-expr expr)
(compile-pair loc expr))
(else (make-const loc expr)))))
-
; Process the compiler options.
; FIXME: Why is '(()) passed as options by the REPL?
(report-error #f "Invalid value for #:always-lexical" value)))
(else (report-error #f "Invalid compiler option" key)))))))
-
; Entry point for compilation to TreeIL.
; This creates the bindings data structure, and after compiling the main
; expression we need to make sure all globals for symbols used during the
; TODO: #@count comments
-
; Report an error from the lexer (that is, invalid input given).
(define (lexer-error port msg . args)
(apply error msg args))
-
; In a character, set a given bit. This is just some bit-wise or'ing on the
; characters integer code and converting back to character.
(define (set-char-bit chr bit)
(logior chr (ash 1 bit)))
-
; Check if a character equals some other. This is just like char=? except that
; the tested one could be EOF in which case it simply isn't equal.
(and (not (eof-object? tested))
(char=? tested should-be)))
-
; For a character (as integer code), find the real character it represents or
; #\nul if out of range. This is used to work with Scheme character functions
; like char-numeric?.
(integer->char chr)
#\nul))
-
; Return the control modified version of a character. This is not just setting
; a modifier bit, because ASCII conrol characters must be handled as such, and
; in elisp C-? is the delete character for historical reasons.
((#\@) 0)
(else (set-char-bit chr 26))))))
-
; Parse a charcode given in some base, basically octal or hexadecimal are
; needed. A requested number of digits can be given (#f means it does
; not matter and arbitrary many are allowed), and additionally early
(lexer-error port "invalid digit in escape-code" base cur))
(iterate (+ (* result base) value) (1+ procdigs)))))))
-
; Read a character and process escape-sequences when necessary. The special
; in-string argument defines if this character is part of a string literal or
; a single character literal, the difference being that in strings the
(#\S . 25) (#\M . ,(if in-string 7 27))))
(cur (read-char port)))
(if (char=? cur #\\)
-
; Handle an escape-sequence.
(let* ((escaped (read-char port))
(esc-code (assq-ref basic-escape-codes escaped))
(meta (assq-ref meta-bits escaped)))
(cond
-
; Meta-check must be before esc-code check because \s- must be
; recognized as the super-meta modifier if a - follows.
; If not, it will be caught as \s -> space escape code.
(if (not (char=? (read-char port) #\-))
(error "expected - after control sequence"))
(set-char-bit (get-character port in-string) meta))
-
; One of the basic control character escape names?
(esc-code esc-code)
-
; Handle \ddd octal code if it is one.
((and (char>=? escaped #\0) (char<? escaped #\8))
(begin
(unread-char escaped port)
(charcode-escape port 8 3 #t)))
-
; Check for some escape-codes directly or otherwise
; use the escaped character literally.
(else
((#\u) (charcode-escape port 16 4 #f))
((#\U) (charcode-escape port 16 8 #f))
(else (char->integer escaped))))))
-
; No escape-sequence, just the literal character.
; But remember to get the code instead!
(char->integer cur))))
-
; Read a symbol or number from a port until something follows that marks the
; start of a new token (like whitespace or parentheses). The data read is
; returned as a string for further conversion to the correct type, but we also
; if it is possibly an integer or a float.
(define integer-regex (make-regexp "^[+-]?[0-9]+\\.?$"))
+
(define float-regex
(make-regexp "^[+-]?([0-9]+\\.?[0-9]*|[0-9]*\\.?[0-9]+)(e[+-]?[0-9]+)?$"))
; A dot is also allowed literally, only a single dort alone is parsed as the
; 'dot' terminal for dotted lists.
+
(define no-escape-punctuation (string->char-set "-+=*/_~!@$%^&:<>{}?."))
(define (get-symbol-or-number port)
(unread-char c port)
(finish))))))
-
; Parse a circular structure marker without the leading # (which was already
; read and recognized), that is, a number as identifier and then either
; = or #.
((#\#) `(circular-ref . ,id))
((#\=) `(circular-def . ,id))
(else (lexer-error port "invalid circular marker character" type))))))
-
; Main lexer routine, which is given a port and does look for the next token.
; and actually point to the very character to be read.
(c (read-char port)))
(cond
-
; End of input must be specially marked to the parser.
((eof-object? c) '*eoi*)
-
; Whitespace, just skip it.
((char-whitespace? c) (lex port))
-
; The dot is only the one for dotted lists if followed by
; whitespace. Otherwise it is considered part of a number of symbol.
((and (char=? c #\.)
(char-whitespace? (peek-char port)))
(return 'dot #f))
-
; Continue checking for literal character values.
(else
(case c
-
; A line comment, skip until end-of-line is found.
((#\;)
(let iterate ()
(if (or (eof-object? cur) (char=? cur #\newline))
(lex port)
(iterate)))))
-
; A character literal.
((#\?)
(return 'character (get-character port #f)))
-
; A literal string. This is mainly a sequence of characters just
; as in the character literals, the only difference is that escaped
; newline and space are to be completely ignored and that meta-escapes
(iterate (cons (integer->char (get-character port #t))
result-chars))))))
(else (iterate (cons cur result-chars)))))))
-
; Circular markers (either reference or definition).
((#\#)
(let ((mark (get-circular-marker port)))
(return (car mark) (cdr mark))))
-
; Parentheses and other special-meaning single characters.
((#\() (return 'paren-open #f))
((#\)) (return 'paren-close #f))
((#\]) (return 'square-close #f))
((#\') (return 'quote #f))
((#\`) (return 'backquote #f))
-
; Unquote and unquote-splicing.
((#\,)
(if (is-char? (peek-char port) #\@)
(error "expected @ in unquote-splicing")
(return 'unquote-splicing #f))
(return 'unquote #f)))
-
; Remaining are numbers and symbols. Process input until next
; whitespace is found, and see if it looks like a number
; (float/integer) or symbol and return accordingly.
num)))
(else (error "wrong number/symbol type" type)))))))))))
-
; Build a lexer thunk for a port. This is the exported routine which can be
; used to create a lexer for the parser to use.
(lambda ()
(lex port)))
-
; Build a special lexer that will only read enough for one expression and then
; always return end-of-input.
; If we find one of the quotation stuff, one more expression is needed in any
; lexer ((text parse-lalr) seems not to allow access to the original lexer
; token-pair) and is easy enough anyways.
-
; Report a parse error. The first argument is some current lexer token
; where source information is available should it be useful.
(define (parse-error token msg . args)
(apply error msg args))
-
; For parsing circular structures, we keep track of definitions in a
; hash-map that maps the id's to their values.
; When defining a new id, though, we immediatly fill the slot with a promise
; Returned is a closure that, when invoked, will set the final value.
; This means both the variable the promise will return and the hash-table
; slot so we don't generate promises any longer.
+
(define (circular-define! token)
(if (not (eq? (car token) 'circular-def))
(error "invalid token for circular-define!" token))
; this may lead to infinite recursion with a circular structure, and
; additionally this value was already processed when it was defined.
; All deep data structures that can be parsed must be handled here!
+
(define (force-promises! data)
(cond
((pair? data)
; Else nothing needs to be done.
))
-
; We need peek-functionality for the next lexer token, this is done with some
; single token look-ahead storage. This is handled by a closure which allows
; getting or peeking the next token.
result))
(else (error "invalid lexer-buffer action" action))))))))
-
; Get the contents of a list, where the opening parentheses has already been
; found. The same code is used for vectors and lists, where lists allow the
; dotted tail syntax and vectors not; additionally, the closing parenthesis
(tail (get-list lex allow-dot close-square)))
(cons head tail))))))
-
-
; Parse a single expression from a lexer-buffer. This is the main routine in
; our recursive-descent parser.
(else
(parse-error token "expected expression, got" token)))))
-
; Define the reader function based on this; build a lexer, a lexer-buffer,
; and then parse a single expression to return.
; We also define a circular-definitions data structure to use.
#:export (void
nil-value t-value
value-slot-module function-slot-module
-
elisp-bool
-
ensure-fluid! reference-variable reference-variable-with-check
set-variable!
-
runtime-error macro-error)
#:export-syntax (built-in-func built-in-macro prim))
; This module provides runtime support for the Elisp front-end.
-
; The reserved value to mean (when eq?) void.
(define void (list 42))
-
; Values for t and nil. (FIXME remove this abstraction)
(define nil-value #nil)
-(define t-value #t)
+(define t-value #t)
; Modules for the binding slots.
; Note: Naming those value-slot and/or function-slot clashes with the
; submodules of these names!
(define value-slot-module '(language elisp runtime value-slot))
-(define function-slot-module '(language elisp runtime function-slot))
+(define function-slot-module '(language elisp runtime function-slot))
; Report an error during macro compilation, that means some special compilation
; (syntax) error; or report a simple runtime-error from a built-in function.
(define runtime-error macro-error)
-
; Convert a scheme boolean to Elisp.
(define (elisp-bool b)
t-value
nil-value))
-
; Routines for access to elisp dynamically bound symbols.
; This is used for runtime access using functions like symbol-value or set,
; where the symbol accessed might not be known at compile-time.
(fluid-set! (module-ref resolved sym) value)
value))
-
; Define a predefined function or predefined macro for use in the function-slot
; and macro-slot modules, respectively.
((_ name value)
(define-public name value))))
-
; Call a guile-primitive that may be rebound for elisp and thus needs absolute
; addressing.
; This module contains the function-slots of elisp symbols. Elisp built-in
; functions are implemented as predefined function bindings here.
-
; Equivalence and equalness predicates.
(built-in-func eq (lambda (a b)
(built-in-func equal (lambda (a b)
(elisp-bool (equal? a b))))
-
; Number predicates.
(built-in-func floatp (lambda (num)
(built-in-func zerop (lambda (num)
(elisp-bool (prim = num 0))))
-
; Number comparisons.
(built-in-func = (lambda (num1 num2)
(elisp-bool (prim = num1 num2))))
+
(built-in-func /= (lambda (num1 num2)
(elisp-bool (prim not (prim = num1 num2)))))
(built-in-func < (lambda (num1 num2)
(elisp-bool (prim < num1 num2))))
+
(built-in-func <= (lambda (num1 num2)
(elisp-bool (prim <= num1 num2))))
+
(built-in-func > (lambda (num1 num2)
(elisp-bool (prim > num1 num2))))
+
(built-in-func >= (lambda (num1 num2)
(elisp-bool (prim >= num1 num2))))
(built-in-func max (lambda (. nums)
(prim apply (@ (guile) max) nums)))
+
(built-in-func min (lambda (. nums)
(prim apply (@ (guile) min) nums)))
(built-in-func abs (@ (guile) abs))
-
; Number conversion.
(built-in-func float (lambda (num)
; TODO: truncate, floor, ceiling, round.
-
; Arithmetic functions.
(built-in-func 1+ (@ (guile) 1+))
+
(built-in-func 1- (@ (guile) 1-))
+
(built-in-func + (@ (guile) +))
+
(built-in-func - (@ (guile) -))
+
(built-in-func * (@ (guile) *))
+
(built-in-func % (@ (guile) modulo))
; TODO: / with correct integer/real behaviour, mod (for floating-piont values).
-
; Floating-point rounding operations.
(built-in-func ffloor (@ (guile) floor))
+
(built-in-func fceiling (@ (guile) ceiling))
+
(built-in-func ftruncate (@ (guile) truncate))
-(built-in-func fround (@ (guile) round))
+(built-in-func fround (@ (guile) round))
; List predicates.
(built-in-func consp
(lambda (el)
(elisp-bool (pair? el))))
+
(built-in-func atomp
(lambda (el)
(elisp-bool (prim not (pair? el)))))
(built-in-func listp
(lambda (el)
(elisp-bool (or (pair? el) (null? el)))))
+
(built-in-func nlistp
(lambda (el)
(elisp-bool (and (prim not (pair? el))
(lambda (el)
(elisp-bool (null? el))))
-
; Accessing list elements.
(built-in-func car
(if (null? el)
nil-value
(prim car el))))
+
(built-in-func cdr
(lambda (el)
(if (null? el)
(if (pair? el)
(prim car el)
nil-value)))
+
(built-in-func cdr-safe
(lambda (el)
(if (pair? el)
((null? tail) nil-value)
((zero? i) (prim car tail))
(else (iterate (prim 1- i) (prim cdr tail))))))))
+
(built-in-func nthcdr
(lambda (n lst)
(if (negative? n)
(built-in-func length (@ (guile) length))
-
; Building lists.
(built-in-func cons (@ (guile) cons))
+
(built-in-func list (@ (guile) list))
+
(built-in-func make-list
(lambda (len obj)
(prim make-list len obj)))
(built-in-func append (@ (guile) append))
+
(built-in-func reverse (@ (guile) reverse))
+
(built-in-func copy-tree (@ (guile) copy-tree))
(built-in-func number-sequence
(prim cons i result)
(iterate (prim - i sep) (prim cons i result)))))))))))
-
; Changing lists.
(built-in-func setcar
(prim set-cdr! cell val)
val))
-
; Accessing symbol bindings for symbols known only at runtime.
(built-in-func symbol-value
(lambda (sym)
(reference-variable-with-check value-slot-module sym)))
+
(built-in-func symbol-function
(lambda (sym)
(reference-variable-with-check function-slot-module sym)))
(built-in-func set
(lambda (sym value)
(set-variable! value-slot-module sym value)))
+
(built-in-func fset
(lambda (sym value)
(set-variable! function-slot-module sym value)))
(lambda (sym)
(set-variable! value-slot-module sym void)
sym))
+
(built-in-func fmakunbound
(lambda (sym)
(set-variable! function-slot-module sym void)
(lambda (sym)
(elisp-bool (prim not
(eq? void (reference-variable value-slot-module sym))))))
+
(built-in-func fboundp
(lambda (sym)
(elisp-bool (prim not
(eq? void (reference-variable function-slot-module sym))))))
-
; Function calls. These must take care of special cases, like using symbols
; or raw lambda-lists as functions!
(lambda (func . args)
(myapply func args))))
-
; Throw can be implemented as built-in function.
(built-in-func throw
(lambda (tag value)
(prim throw 'elisp-exception tag value)))
-
; Miscellaneous.
(built-in-func not
; course, so not really in runtime. But I think it fits well to the others
; here.
-
; The prog1 and prog2 constructs can easily be defined as macros using progn
; and some lexical-let's to save the intermediate value to return at the end.
(lambda (form1 form2 . rest)
`(progn ,form1 (prog1 ,form2 ,@rest))))
-
; Define the conditionals when and unless as macros.
(built-in-macro when
(lambda (condition . elses)
`(if ,condition nil (progn ,@elses))))
-
; Impement the cond form as nested if's. A special case is a (condition)
; subform, in which case we need to return the condition itself if it is true
; and thus save it in a local variable before testing it.
(progn ,@(cdr cur))
,rest))))))))
-
; The and and or forms can also be easily defined with macros.
(built-in-macro and
,var
,(iterate (car tail) (cdr tail)))))))))))
-
; Define the dotimes and dolist iteration macros.
(built-in-macro dotimes
(list (caddr args))
'())))))))))
-
; Exception handling. unwind-protect and catch are implemented as macros (throw
; is a built-in function).
; for matches using eq (eq?). We handle this by using always #t as key
; for the Guile primitives and check for matches inside the handler; if
; the elisp keys are not eq?, we rethrow the exception.
+
(built-in-macro catch
(lambda (tag . body)
(if (null? body)
((guile-primitive throw) ,dummy-key ,elisp-key
,value))))))))))
-; unwind-protect is just some weaker construct as dynamic-wind, so
+; unwind-protect is just some weaker construct as dynamic-wind, so
; straight-forward to implement.
+
(built-in-macro unwind-protect
(lambda (body . clean-ups)
(if (null? clean-ups)
(lambda () ,body)
(lambda () ,@clean-ups))))
-
; Pop off the first element from a list or push one to it.
(built-in-macro pop
;;;; modify it under the terms of the GNU Lesser General Public
;;;; License as published by the Free Software Foundation; either
;;;; version 3 of the License, or (at your option) any later version.
-;;;;
+;;;;
;;;; This library 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
;;;; Lesser General Public License for more details.
-;;;;
+;;;;
;;;; You should have received a copy of the GNU Lesser General Public
;;;; License along with this library; if not, write to the Free Software
;;;; Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
HCoop / bpt / guile.git / commitdiff