- parenscript-devel - mailman3.common-lisp.net

[parenscript-devel] Reserved keywords as object keys in (create)
by Alexey Lebedeff 25 Jul '09

25 Jul '09

(ps (create :default "test")) evaluates to: { default : 'test' }; It works in Firefox, but Chrome complains about syntax error as the 'default' is reserved javascript keyword. So object keys given as CL keywords must be always converted to string (or at least reserved ones).

2 1

[parenscript-devel] Javascript-side testing of Parenscript code
by Red Daly 25 Jul '09

25 Jul '09

Hi list, Does anybody recommend a framework for unit testing Javascript generated by Parenscript? Is there any particular framework that interacts well with Parenscript to give useful results. I have quite a few libraries, and none of them have unit testing right now. Fireunit[1] looks good. Best regards, Red [1] http://ejohn.org/blog/fireunit/

1 0

[parenscript-devel] Patch: destructuring-bind now supports dotted lists and nested lists
by Daniel Gackle 25 Jul '09

25 Jul '09

A couple of examples, followed by patch: (ps (destructuring-bind (a . rest) list (blah a rest))) => "var a = list[0]; var rest = list.length > 1 ? list.slice(1) : null; blah(a, rest);" (ps (destructuring-bind ((a (b c)) (d e)) list)) => "var _js42 = list[0]; var a = _js42[0]; var _js43 = _js42[1]; var b = _js43[0]; var c = _js43[1]; var _js44 = list[1]; var d = _js44[0]; var e = _js44[1];" >From 74d29fe528d40795071e61df4fb1e4b56b28f049 Mon Sep 17 00:00:00 2001 From: Daniel Gackle <danielgackle(a)gmail.com> Date: Fri, 10 Jul 2009 16:31:55 -0600 Subject: [PATCH 1/2] DESTRUCTURING-BIND can now handle dotted and nested binding lists. --- src/lib/ps-macro-lib.lisp | 31 +++++++++++++++++++++---------- 1 files changed, 21 insertions(+), 10 deletions(-) diff --git a/src/lib/ps-macro-lib.lisp b/src/lib/ps-macro-lib.lisp index 1013939..d70561c 100644 --- a/src/lib/ps-macro-lib.lisp +++ b/src/lib/ps-macro-lib.lisp @@ -144,14 +144,25 @@ (first args)))) `((@ ,fn :apply) this ,arglist))) -(defpsmacro destructuring-bind (vars expr &body body) - ;; a simple implementation that for now only supports flat lists, - ;; but does allow NIL bindings to indicate ignore (a la LOOP) +(defun destructuring-wrap (arr n bindings body) + (cond ((null bindings) + body) + ((atom bindings) + ;; dotted destructuring list + `(let ((,bindings (when (> (length ,arr) ,n) + ((@ ,arr :slice) ,n)))) + ,body)) + (t (let ((var (car bindings)) + (inner-body (destructuring-wrap arr (1+ n) (cdr bindings) body))) + (cond ((null var) inner-body) + ((atom var) `(let ((,var (aref ,arr ,n))) + ,inner-body)) + (t `(destructuring-bind ,var (aref ,arr ,n) + ,inner-body))))))) + +(defpsmacro destructuring-bind (bindings expr &body body) (let* ((arr (if (complex-js-expr? expr) (ps-gensym) expr)) - (n -1) - (bindings - (append (unless (equal arr expr) `((,arr ,expr))) - (mapcan (lambda (var) - (incf n) - (when var `((,var (aref ,arr ,n))))) vars)))) - `(let* ,bindings ,@body))) + (bound (destructuring-wrap arr 0 bindings (cons 'progn body)))) + (if (eq arr expr) + bound + `(let ((,arr ,expr)) ,bound)))) -- 1.6.1

2 1

[parenscript-devel] Patch: ps loop now supports :ON type of iteration over lists
by Daniel Gackle 25 Jul '09

25 Jul '09

Two examples followed by patch. Note that I haven't added any functions for #'cdr, #'cddr etc. (it's arguable whether those belong in PS proper, since the mapping of Lisp lists to JS arrays is only partly satisfactory), so if you want to write stuff like "(ps (loop for (a b) on list by #'cddr))", you can, but you have to define your own #'cddr. Dan (ps (loop for (a b) on y do (blah a b))) => "for (var _js46 = y; !(_js46 == null || _js46.length == 0); _js46 = _js46.slice(1)) { var a = _js46[0]; var b = _js46[1]; blah(a, b); };" (ps (loop for (a b . c) on list by somefn do (blah a b c))) => "for (var _js48 = list; !(_js48 == null || _js48.length == 0); _js48 = somefn(_js48)) { var a = _js48[0]; var b = _js48[1]; var c = _js48.length > 2 ? slice(_js48, 2) : null; blah(a, b, c); };" >From 4122fd1552b35f9bc46d723cf1651fdc8cf20748 Mon Sep 17 00:00:00 2001 From: Daniel Gackle <danielgackle(a)gmail.com> Date: Fri, 10 Jul 2009 19:17:39 -0600 Subject: [PATCH 2/2] PS LOOP now supports ON. --- src/lib/ps-loop.lisp | 22 +++++++++++++++++++--- 1 files changed, 19 insertions(+), 3 deletions(-) diff --git a/src/lib/ps-loop.lisp b/src/lib/ps-loop.lisp index 0e20c9c..c7334fa 100644 --- a/src/lib/ps-loop.lisp +++ b/src/lib/ps-loop.lisp @@ -2,12 +2,13 @@ (defun complex-js-expr? (expr) (if (symbolp expr) - (find #\. (symbol-name expr)) + (or (find #\. (symbol-name expr)) + (not (eq (ps-macroexpand expr) expr))) (consp expr))) (defvar *loop-keywords* '(:for :do :when :unless :initially :finally :first-time :last-time :while :until - :from :to :below :downto :above :by :in :across :index := :then :sum :collect + :from :to :below :downto :above :by :in :across :on :index := :then :sum :collect :count :minimize :maximize :into)) (defun normalize-loop-keywords (args) @@ -18,6 +19,11 @@ x)) args)) +(defun reduce-function-symbol (sym) + (if (and (consp sym) (eq 'function (first sym))) + (second sym) + sym)) + (defun parse-ps-loop (terms) (let (prologue init-step-forms end-test-forms @@ -115,6 +121,15 @@ (setf terms (append equiv terms)) (clause) (clause)))) + (for-on (var) + (with-local-var (arr (consume)) + (push `(or (null ,var) (= (length ,var) 0)) end-test-forms) + (let* ((by (aif (consume-if :by) + `(,(reduce-function-symbol it) ,var) + `((@ ,var :slice) 1))) + (equiv `(:for ,var := ,arr :then ,by))) + (setf terms (append equiv terms)) + (clause)))) (for-clause () (let* ((place (consume)) (var (when (atom place) place)) @@ -122,13 +137,14 @@ (term (consume-atom))) (when varlist (when (eq term :from) - (err "an atom after FROM" varlist)) + (err "an atom after FOR" varlist)) (setf var (ps-gensym)) (push (list varlist var) destructurings)) (case term (:from (for-from var)) (:= (for-= var)) ((:in :across) (for-in var)) + (:on (for-on var)) (otherwise (error "FOR ~s ~s is not valid in PS-LOOP." var term))))) (clause () (let ((term (consume-atom))) -- 1.6.1

2 1

Re: [parenscript-devel] long compile time
by Vladimir Sedach 06 Jul '09

06 Jul '09

Thanks for posting your results! This is really curious: (time (eval '(defun somefunction () (ps (form))))) 672.596 seconds of real time I'm not sure what's going on here. The two versions of 'ps' essentially do the same macroexpansion. As a matter of fact, the new one conses slightly more. My little test (form was a function call with 5000 dummy arguments) did not exhibit such a long eval time for the defun. I think what may be happening is that 'concatenate' in SBCL now (sometime between 1.0.22, which I'm running, and 1.0.29) has a compiler macro that attempts to do constant string concatenation at compile-time. That's just a guess though. ; ps with write-to-string (time (eval '(defun somefunction () (ps (form))))) Evaluation took: 32.524 seconds of real time That's a lot of time. How many tokens does your code have? What I need to do is figure out the best way available across most implementations to spit out strings (which just might be 'write-to-string') and to push that down to the Parenscript printer, instead of having it return a list of strings. That should close the gap between 'ps' and 'ps*' and provide a big improvement in speed, and if streams are involved, let you direct the output of Parenscript directly into one. Vladimir On Mon, Jul 6, 2009 at 8:50 PM, <Kelly.P.McDonald(a)gmail.com> wrote: > Vladimir, > > sorry about the truncated post earlier. > > I'm using sbcl 1.0.29 > > here are my results: > > (time (eval > '(defun somefunction () > (ps* '(form))))) > > Evaluation took: > 0.007 seconds of real time > 0.004000 seconds of total run time (0.004000 user, 0.000000 system) > 57.14% CPU > 9 forms interpreted > 3 lambdas converted > 7,264,237 processor cycles > 625,872 bytes consed > > > (time (somefunction)) > > Evaluation took: > 0.555 seconds of real time > 0.456028 seconds of total run time (0.412025 user, 0.044003 system) > [ Run times consist of 0.300 seconds GC time, and 0.157 seconds non-GC time. > ] > 82.16% CPU > 85 lambdas converted > 555,544,368 processor cycles > 6,404,784 bytes consed > > > ; ps with concatenate > (time (eval > '(defun somefunction () > (ps (form))))) > > Evaluation took: > 672.596 seconds of real time > 517.380334 seconds of total run time (501.967371 user, 15.412963 system) > [ Run times consist of 7.004 seconds GC time, and 510.377 seconds non-GC > time. ] > 76.92% CPU > 9 forms interpreted > 3 lambdas converted > 3,125,982,714,733 processor cycles > 5 page faults > 560,010,640 bytes consed > > (time (somefunction)) > > Evaluation took: > 0.651 seconds of real time > 0.548034 seconds of total run time (0.544034 user, 0.004000 system) > 84.18% CPU > 657,341,464 processor cycles > 826,672 bytes consed > > > ; ps with write-to-string > (time (eval > '(defun somefunction () > (ps (form))))) > > > Evaluation took: > 32.524 seconds of real time > 29.861866 seconds of total run time (29.461841 user, 0.400025 system) > [ Run times consist of 1.129 seconds GC time, and 28.733 seconds non-GC > time. ] > 91.82% CPU > 9 forms interpreted > 91 lambdas converted > 65,799,376,447 processor cycles > 135,977,120 bytes consed > > > (time (somefunction)) > Evaluation took: > 0.004 seconds of real time > 0.004000 seconds of total run time (0.004000 user, 0.000000 system) > 100.00% CPU > 3,869,482 processor cycles > 200,144 bytes consed > > > A huge improvement, and I understand what is going on much better. I had > been using compile-script previously. > > > Thanks, > Kelly

1 0

[parenscript-devel] ps-loop now allows accumulating "into"
by Daniel Gackle 06 Jul '09

06 Jul '09

I've extended PS-LOOP to allow CL-style explicit accumulation variables to be introduced by INTO. Two examples, followed by a patch, are below. (Side note: Lisp still surprises me from time to time. That this feature could be added with a net increase of only 3 lines of code is an indication of something.) Daniel (ps (loop for x from 1 to 10 sum x into total finally (alert total))) => "var total = 0; for (var x = 1; x <= 10; x += 1) { total += x; }; alert(total);" (ps (loop for x from 1 to 10 for y = (foo x) collect y into z collect x into z sum x into w sum y into w)) => "var z = []; var w = 0; for (var x = 1, y = foo(x); x <= 10; x += 1, y = foo(x)) { z.push(y); z.push(x); w += x; w += y; };" >From 293fc20445cd44731c82a845401a8c897c851f6d Mon Sep 17 00:00:00 2001 From: Daniel Gackle <danielgackle(a)gmail.com> Date: Tue, 30 Jun 2009 19:29:44 -0600 Subject: [PATCH] Extended PS-LOOP to allow explicit accumulation variables (declared by INTO as in "sum x into y"). --- src/lib/ps-loop.lisp | 37 ++++++++++++++++++++----------------- 1 files changed, 20 insertions(+), 17 deletions(-) diff --git a/src/lib/ps-loop.lisp b/src/lib/ps-loop.lisp index 87d2d84..1003b5d 100644 --- a/src/lib/ps-loop.lisp +++ b/src/lib/ps-loop.lisp @@ -7,7 +7,7 @@ (defvar *loop-keywords* '(:for :do :when :unless :initially :finally :first-time :last-time :while :until - :from :to :below :downto :above :by :in :across :index := :then :sum :collect)) + :from :to :below :downto :above :by :in :across :index := :then :sum :collect :into)) (defun normalize-loop-keywords (args) (mapcar @@ -22,7 +22,7 @@ init-step-forms end-test-forms initially finally first-time last-time - accum-var accum-kind + default-accum-var default-accum-kind destructurings body) (macrolet ((with-local-var ((name expr) &body body) (once-only (expr) @@ -55,22 +55,25 @@ (when (next? term) (consume) (consume))) - (establish-accum-var (kind initial-val) - (if accum-var - (error "PS-LOOP encountered illegal ~a: a ~a was previously declared, and there can only be one accumulation per loop." kind accum-kind) - (progn - (setf accum-var (ps-gensym kind) - accum-kind kind) - (push `(var ,accum-var ,initial-val) prologue)))) + (accumulate (kind term var) + (when (null var) + (when (and default-accum-kind (not (eq kind default-accum-kind))) + (error "PS-LOOP encountered illegal ~a: ~a was already declared, and there can only be one kind of default accumulation per loop." kind default-accum-kind)) + (unless default-accum-var + (setf default-accum-var (ps-gensym kind) + default-accum-kind kind)) + (setf var default-accum-var)) + (let ((initial (case kind (:sum 0) (:collect '(array))))) + (pushnew `(var ,var ,initial) prologue :key #'second)) + (case kind + (:sum `(incf ,var ,term)) + (:collect `((@ ,var :push) ,term)))) (body-clause (term) (case term ((:when :unless) (list (intern (symbol-name term)) (consume) (body-clause (consume-atom)))) - (:sum (establish-accum-var :sum 0) - `(incf ,accum-var ,(consume))) - (:collect (establish-accum-var :collect '(array)) - `((@ ,accum-var :push) ,(consume))) + ((:sum :collect) (accumulate term (consume) (consume-if :into))) (:do (consume-progn)) (otherwise (err "a PS-LOOP keyword" term)))) (for-from (var) @@ -149,7 +152,7 @@ (nreverse finally) (nreverse first-time) (nreverse last-time) - accum-var + default-accum-var (add-destructurings-to-body)))))) (defpsmacro loop (&rest args) @@ -157,12 +160,12 @@ init-step-forms end-test initially finally first-time last-time - accum-var + default-accum-var body) (parse-ps-loop (normalize-loop-keywords args)) (let ((first-guard (and first-time (ps-gensym))) (last-guard (and last-time (ps-gensym)))) - `(,@(if accum-var '(with-lambda ()) '(progn)) + `(,@(if default-accum-var '(with-lambda ()) '(progn)) ,@(when first-time `((var ,first-guard t))) ,@(when last-time `((var ,last-guard nil))) ,@prologue @@ -178,4 +181,4 @@ `((setf ,last-guard t)))) ,@(when last-time `((when ,last-guard ,@last-time))) ,@finally - ,@(when accum-var `((return ,accum-var))))))) + ,@(when default-accum-var `((return ,default-accum-var))))))) -- 1.6.1

2 1

[parenscript-devel] Added count, minimize, and maximize to ps-loop
by Daniel Gackle 06 Jul '09

06 Jul '09

I've added count, minimize, and maximize to ps-loop. Examples and patch follow. Daniel (ps (loop for x from 1 to 10 count x into c)) => "var c = 0; for (var x = 1; x <= 10; x += 1) { ++c; };" (ps (loop for x from 1 to 10 minimize x into y maximize x into z)) => "var y = null; var z = null; for (var x = 1; x <= 10; x += 1) { y = y == null ? x : Math.min(y, x); z = z == null ? x : Math.max(z, x); };" >From ee44a1647b9289c50c5fe1f2bc62c569aa0c990e Mon Sep 17 00:00:00 2001 From: Daniel Gackle <danielgackle(a)gmail.com> Date: Tue, 30 Jun 2009 19:52:12 -0600 Subject: [PATCH] Added support for COUNT, MINIMIZE and MAXIMIZE to PS-LOOP. --- src/lib/ps-loop.lisp | 18 ++++++++++++++---- 1 files changed, 14 insertions(+), 4 deletions(-) diff --git a/src/lib/ps-loop.lisp b/src/lib/ps-loop.lisp index 1003b5d..0e20c9c 100644 --- a/src/lib/ps-loop.lisp +++ b/src/lib/ps-loop.lisp @@ -7,7 +7,8 @@ (defvar *loop-keywords* '(:for :do :when :unless :initially :finally :first-time :last-time :while :until - :from :to :below :downto :above :by :in :across :index := :then :sum :collect :into)) + :from :to :below :downto :above :by :in :across :index := :then :sum :collect + :count :minimize :maximize :into)) (defun normalize-loop-keywords (args) (mapcar @@ -60,20 +61,29 @@ (when (and default-accum-kind (not (eq kind default-accum-kind))) (error "PS-LOOP encountered illegal ~a: ~a was already declared, and there can only be one kind of default accumulation per loop." kind default-accum-kind)) (unless default-accum-var - (setf default-accum-var (ps-gensym kind) + (setf default-accum-var (ps-gensym (case kind + (:minimize 'min) + (:maximize 'max) + (t kind))) default-accum-kind kind)) (setf var default-accum-var)) - (let ((initial (case kind (:sum 0) (:collect '(array))))) + (let ((initial (case kind + ((:sum :count) 0) + ((:maximize :minimize) nil) + (:collect '(array))))) (pushnew `(var ,var ,initial) prologue :key #'second)) (case kind (:sum `(incf ,var ,term)) + (:count `(incf ,var)) + (:minimize `(setf ,var (if (null ,var) ,term (min ,var ,term)))) + (:maximize `(setf ,var (if (null ,var) ,term (max ,var ,term)))) (:collect `((@ ,var :push) ,term)))) (body-clause (term) (case term ((:when :unless) (list (intern (symbol-name term)) (consume) (body-clause (consume-atom)))) - ((:sum :collect) (accumulate term (consume) (consume-if :into))) + ((:sum :collect :count :minimize :maximize) (accumulate term (consume) (consume-if :into))) (:do (consume-progn)) (otherwise (err "a PS-LOOP keyword" term)))) (for-from (var) -- 1.6.1

2 1

[parenscript-devel] long compile time
by Kelly McDonald 06 Jul '09

06 Jul '09

Hello, I'm sure I'm doing something dumb, I just need someone to set me straight. I recently updated to the latest parenscript (as well as sbcl) and got all of the errors for where I had this.dropdownlist.length type notation and changed it to (@ this dropdownlist length) notation. I had something that used to compile rather quickly it was as simple as this: (defun somefunction () (ps (very long parenscript code))) if I evaluate just the (ps (very long parenscript code)) everything is really snappy & I get what I expect. if I evaluate the whole function, it takes forever (ok, like 10 minutes) again, once things evaluate, I get what I expect Furthermore, if I start small and add stuff in, it seems to take exponential time to the amount of code (or more likely my patience gets exponentially shorter) the same thing happens if I merely do a (setf somevar (ps (very long parenscript code))) I'm suspecting that I'm hitting some kind of compiler optimization and I need some kind of pragma. Thanks for your thoughts/suggestions, Kelly McDonald

2 3

[parenscript-devel] Javascript parser for Common Lisp
by Red Daly 01 Jul '09

01 Jul '09

Dear CL-JSON and Parenscript developers, I have cloned a functional Javascript parser (from JWACS) and turned it into its own project, which is fully functional but comes with a few annoyances. However, I would appreciate some help coding to make js-parser into a clean package. There are two main issues that need addressing: 1. There are a bunch of warnings about reduce/reduce conflicts in the parser. I couldn't immediately get them out, but I'm sure somebody with more parsing experience should be able to fix the grammar. 2. The project does not use the official, supported version of cl-yacc available here http://www.pps.jussieu.fr/~jch/software/cl-yacc/ Instead it packages its own version, which causes problems if you need the official version of cl-yacc (e.g. closure xml). Theoretically this is a simple change but I don't know for sure. Hopefully this project catches your fancy. I have found a need for a JavaScript parser a bunch of times, from a javascript-to-parenscript converter to screen scraping. Let me know if you would like to contribute. The code is available here: http://github.com/gonzojive/js-parser/tree/master git clone git://github.com/gonzojive/js-parser.git Very truly yours, Red Daly

1 0

[parenscript-devel] Lexical scoping question
by Daniel Gackle 08 Jun '09

08 Jun '09

I've played with the recent PS with lexical scoping, and it's grown on me. My concerns about the readability of gensym'd suffixes are not turning out to be as bad as I worried, and I'm noticing several benefits to the idea. I'm hoping the recent batch of bugs we've reported can be fixed so we can upgrade to the latest. In the meantime, I'm trying to understand the intent behind this bit of language redesign. Consider the following: (ps (let ((a 123)) (blah a)) (alert a)) If this were really lexically scoped, the a in the alert form would be undefined. But ps generates: "var a = 123; blah(a); alert(a);" Does this reflect what is intended? If so, is there a clear explanation of just what "lexical scoping" is now offered by PS, i.e. what the rules are, what we should expect, and what we should not expect? Daniel

3 3