;;; compiler-codege.lisp --- Naive Javascript unparser
-;; copyright (C) 2013 David Vazquez
+;; Copyright (C) 2013, 2014 David Vazquez
;; JSCL is free software: you can redistribute it and/or
;; modify it under the terms of the GNU General Public License as
;; You should have received a copy of the GNU General Public License
;; along with JSCL. If not, see <http://www.gnu.org/licenses/>.
+
;;; This code generator takes as input a S-expression representation
;;; of the Javascript AST and generates Javascript code without
;;; redundant syntax constructions like extra parenthesis.
(/debug "loading compiler-codegen.lisp!")
+
(defvar *js-macros* nil)
(defmacro define-js-macro (name lambda-list &body body)
(let ((form (gensym)))
(defun js-format (fmt &rest args)
(apply #'format *js-output* fmt args))
+;;; Check if STRING-DESIGNATOR is valid as a Javascript identifier. It
+;;; returns a couple of values. The identifier itself as a string and
+;;; a boolean value with the result of this check.
(defun valid-js-identifier (string-designator)
(let ((string (typecase string-designator
(symbol (symbol-name string-designator))
(if (plusp (length string))
(not (digit-char-p (char string 0)))
t))
- (values (format nil "~a" string) t)
+ (values string t)
(values nil nil)))))
+
+;;; Expression generators
+;;;
+;;; `js-expr' and the following auxiliary functions are the
+;;; responsible for generating Javascript expression.
+
(defun js-identifier (string-designator)
(multiple-value-bind (string valid)
(valid-js-identifier string-designator)
(js-macroexpand form)))
form))
+;;; It is the more complicated function of the generator. It takes a
+;;; operator expression and generate Javascript for it. It will
+;;; consider associativity and precedence in order not to generate
+;;; unnecessary parenthesis.
(defun js-operator-expression (op args precedence associativity operand-order)
(let ((op1 (car args))
(op2 (cadr args)))
(t
(js-operator-expression (car form) (cdr form) precedence associativity operand-order)))))
+
+
+;;; Statements generators
+;;;
+;;; `js-stmt' generates code for Javascript statements. A form is
+;;; provided to label statements. Remember that in particular,
+;;; expressions can be used as statements (semicolon suffixed).
+;;;
+
(defun js-expand-stmt (form)
(cond
((and (consp form) (eq (car form) 'progn))
(js-expr form)
(js-end-stmt))))))))
+
+;;; It is intended to be the entry point to the code generator.
(defun js (&rest stmts)
(mapc #'js-stmt stmts)
nil)
--- /dev/null
+;;; hash-table.lisp ---
+
+;; JSCL 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 3 of the
+;; License, or (at your option) any later version.
+;;
+;; JSCL 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 JSCL. If not, see <http://www.gnu.org/licenses/>.
+
+;;; Plain Javascript objects are the natural way to implement Common
+;;; Lisp hash tables. However, there is a big differences betweent
+;;; them which we need to work around. Javascript objects require the
+;;; keys to be strings. To solve that, we map Lisp objects to strings
+;;; such that "equivalent" values map to the same string, regarding
+;;; the equality predicate used (one of `eq', `eql', `equal' and
+;;; `equalp').
+;;;
+
+
+;;; If a hash table has `eq' as test, we need to generate unique
+;;; strings for each Lisp object. To do this, we tag the objects with
+;;; a `$$jscl_id' property. As a special case, numbers do not need to
+;;; be tagged, as they can be used to index Javascript objects.
+(defvar *eq-hash-counter* 0)
+(defun eq-hash (x)
+ (cond
+ ((numberp x)
+ x)
+ (t
+ (unless (in "$$jscl_id" x)
+ (oset (format nil "$~d" *eq-hash-counter*) x "$$jscl_id")
+ (incf *eq-hash-counter*))
+ (oget x "$$jscl_id"))))
+
+;;; We do not have bignums, so eql is equivalent to eq.
+(defun eql-hash (x)
+ (eq-hash x))
+
+
+;;; In the case of equal-based hash tables, we do not store the hash
+;;; in the objects, but compute a hash from the elements it contains.
+(defun equal-hash (x)
+ (typecase x
+ (cons
+ (concat "(" (equal-hash (car x)) (equal-hash (cdr x)) ")"))
+ (string
+ (concat "s" (integer-to-string (length x)) ":" (lisp-to-js x)))
+ (t
+ (eql-hash x))))
+
+(defun equalp-hash (x)
+ ;; equalp is not implemented as predicate. So I am skipping this one
+ ;; by now.
+ )
+
+
+(defun make-hash-table (&key (test #'eql))
+ (let* ((test-fn (fdefinition test))
+ (hash-fn
+ (cond
+ ((eq test-fn #'eq) #'eq-hash)
+ ((eq test-fn #'eql) #'eql-hash)
+ ((eq test-fn #'equal) #'equal-hash)
+ ((eq test-fn #'equalp) #'equalp-hash))))
+ ;; TODO: Replace list with a storage-vector and tag
+ ;; conveniently to implemnet `hash-table-p'.
+ `(hash-table ,hash-fn ,(new))))
+
+(defun gethash (key hash-table &optional default)
+ (let ((obj (caddr hash-table))
+ (hash (funcall (cadr hash-table) key)))
+ (values (oget obj hash)
+ (in hash obj))))
+
+(defun sethash (new-value key hash-table)
+ (let ((obj (caddr hash-table))
+ (hash (funcall (cadr hash-table) key)))
+ (oset new-value obj hash)
+ new-value))
+
+
+;;; TODO: Please, implement (DEFUN (SETF foo) ...) syntax!
+(define-setf-expander gethash (key hash-table &optional defaults)
+ (let ((g!key (gensym))
+ (g!hash-table (gensym))
+ (g!defaults (gensym))
+ (g!new-value (gensym)))
+ (values (list g!key g!hash-table g!defaults) ; temporary variables
+ (list key hash-table defaults) ; value forms
+ (list g!new-value) ; store variables
+ `(progn
+ (sethash ,g!new-value ,g!key ,g!hash-table) ; storing form
+ ,g!new-value)
+ `(gethash ,g!new-value ,g!key ,g!hash-table) ; accessing form
+ )))
+
+
+(defun remhash (key hash-table)
+ (let ((obj (caddr hash-table))
+ (hash (funcall (cadr hash-table) key)))
+ (prog1 (in hash obj)
+ (delete-property hash obj))))
--- /dev/null
+
+(let ((ht (make-hash-table))
+ (key "foo"))
+ (setf (gethash key ht) 10)
+ (test (null (gethash "foo" ht)))
+ (test (equal (gethash key ht) 10))
+ (setf (gethash 'foo ht) "lisp")
+ (test (string= (gethash 'foo ht) "lisp")))
+
+
+(let ((ht (make-hash-table :test #'equal)))
+ (setf (gethash "foo" ht) 10)
+ (test (equal (gethash "foo" ht) 10)))
+
+
+(let ((ht (make-hash-table :test #'equal)))
+ (setf (gethash "foo" ht) 10)
+ (test (eq (remhash "foo" ht) t))
+ (test (eq (remhash "foo" ht) nil))
+ (test (null (gethash "foo" ht))))
+
+