On Thu, Apr 11, 2013 at 7:41 PM, Dmitry Kakurin wrote:
> But your parser rules are somewhat new to me.
> Both variations are accepted:
>
> add = add-sub <'+'> add-sub
> add = mul-div <'+'> add-sub
>
> And in both cases some generated parsers are correct (arithmetically
> speaking :-) ),
Hi folks, after having trouble figuring out how Shoreleave works and what
exactly you can do with it, I wrote a very simple tutorial/example app for
using it:
https://github.com/ddellacosta/barebones-shoreleave
I try to answer the question "what do I need in my app to get Shoreleave up
and runnin
Hello all!
First i would like to mention that I'm very new to Clojure, and still
learning the language/functional programming. Mostly I'm doing web stuff,
with the usual suspects (php,ruby,python) and im usually using a framework
for RAD development.
Frameworks as they are usually implemented
There is no complecting involved since you can easily use catch alone,
finally alone, or both. Exactly as you note, they are orthogonal. Of
course, there is nothing wrong with your convenience macros, if they help
your specific case. They are obviously special-case macros derived from the
gener
When reading such concise code you must always remember that it is very
compressed and says a lot in a few words. So it is really the information
density that is disturbing the newcomer, not the legibility.
If the same code was expanded to 50 lines of Java code, then yes, each
individual line o
On Wednesday, April 10, 2013 7:54:37 PM UTC+2, Luc wrote:
>
> I can safely assume that the input state is also a set.
>
This emphasizes the toughest aspect of comprehending Clojure code: it is
not at all about conciseness or FP, but about dynamism. We just don't know
what value has what type s
+1
Everyone will experiment this if they try to mantain their coding ability as
they age.
The average career length of a programmer is 8 years in the US (2003 survey)
and
the main reason invoked by those that left is their perceived lack of
productivity.
They could not get in that euphoric st
I remember looking at the obfuscated C code submissions a decade ago at
least and it had nothing to do with the coded posted by the OP.
I remember a submission where the code was of circle created with underscores
in a main body. This was done with a few macros.
The thing would compile and spit
Thank you very much, I'll give it a try!
On Thursday, 11 April 2013 18:12:34 UTC+1, puzzler wrote:
>
> On Thu, Apr 11, 2013 at 7:08 AM, Stathis Sideris
>
> > wrote:
>
>> Thanks, this looks fantastic! Is there any way to include comments in the
>> syntax at all?
>
>
> Last night I started a v1.1
Nice talk :)
http://skillsmatter.com/podcast/scala/clojure-at-nokia-entertainment/wd-23
Jim
--
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@googlegroups.com
Note that posts from new members are moderat
Thanks - I'll give that a try.
On Thursday, April 11, 2013 11:18:06 AM UTC-7, Alan Malloy wrote:
>
> 0.6.2 is six months old. I don't think anything about this has changed
> since then, but you should at least try [org.flatland/protobuf "0.7.2"] and
> see if that does what you expect.
>
> On T
Dave,
Wanted to say I enjoyed your cemerick/friend tutorial and am looking forward to
reading this one.
Thanks for your efforts.
Julio
ju...@e-string.com
On Apr 12, 2013, at 12:53 AM, David Della Costa wrote:
> Hi folks, after having trouble figuring out how Shoreleave works and what
> exa
Thanks Julio! I'm very happy to hear that. Let me know if you find any
typos or whatnot, or have any other comments on how it could be improved.
Cheers,
Dave
2013/4/13 Julio Barros
> Dave,
>
> Wanted to say I enjoyed your cemerick/friend tutorial and am looking
> forward to reading this one.
Dave's megaref suggestion was the kind of thing I had in mind initially but
using Agents might be make more sense.
I'm going to have a play around then report back on my progress. Thanks
for your thoughts, it's very much appreciated.
James
On Friday, 12 April 2013 07:52:22 UTC+1, Cedric
I requested some of the features added in this release. Thanks a lot for
the work.
--
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@googlegroups.com
Note that posts from new members are moderated - plea
Hi,
I just wanted to share something with you I found on the net.
Tomek Lipski posted this great short manual. Worked great for me and I
am thrilled by the first steps in the debugger.
http://blog.tomeklipski.com/2013/04/running-and-debugging-clojure-code-with.html
regards
Benjamin.
--
--
http://mx-clojure.blogspot.com/2013/04/mx-algorithmic-composition-on-clojure.html
Mx - Algorithmic Composition on Clojure, core.logic & JMusic by Oscar
Riveros
http://youtu.be/ihT-HpRE2E8
The possibilities are endless ... Take it as a template ...
algorithmicamente try modifying or creating
Hi all, I came up across the project idea for a Program analysis suite
based on Codeq [1] a week ago and have been working on it since.
The idea appealed to me instantly, since I had just started to look into
program analysis possibilities, and analysing a (or many) repository's
version history
Thanks Mark,
Here is my understanding and few more questions (please correct me if I'm
missing something).
plus = plus <'+'> num | num
is unambiguous left-associative. It is valid and is guaranteed not to cause
infinite recursion.
plus = num <'+'> plus | num
is unambiguous right-associa
Navgeet-
I'm delighted to read of your interest. Please see my responses, below.
-r
On Apr 12, 2013, at 09:49, Navgeet Agrawal wrote:
> Hi all, I came up across the project idea for a Program analysis suite based
> on Codeq [1] a week ago and have been working on it since. The idea appealed
>
I'm trying to use the :or destructuring syntax as seen here applied to a map
(def point {:y 7})
(let [{:keys [x y] :or {x 0 y 0}} point]
(println "x:" x "y:" y))
x: 0 y: 7
but I can't get this to work with vectors:
(def point [7])
(let [[x y :or [0 0]] point]
(println "x:" x "y:" y))
what'
You can use a map destructuring form on a vector like so:
(let [{x 0 y 1 :or {x 0 y 0}} [7]] [x y])
returns [7 0]
On Fri, Apr 12, 2013 at 5:00 PM, henry clifford wrote:
> I'm trying to use the :or destructuring syntax as seen here applied to a map
>
> (def point {:y 7})
> (let [{:keys [x y] :or
Hi Navgeet,
I'm glad you found codeq-playground helpful. It looks like you've found Rich
Morin's wiki. Did you also see his codeq-cookbook project?
When you said analysis I had something else in mind: check outÂ
https://github.com/clojure/jvm.tools.analyzer
I wonder about how that could be u
Super cool! Nice work.
Your readme says "I had difficulty getting his Parsing with Derivatives
technique to work in a performant way". I was wondering if you could
please elaborate.
What kind of performance did you achieve?
How does that compare to the GLL parser you implemented?
Did you imple
On Fri, Apr 12, 2013 at 1:55 PM, Dmitry Kakurin wrote:
> Here is where my question is coming from:
> If I were to use such parser in production I'd like it to be unambiguous.
> And I'd like to detect ambiguity early, before my software ships/deployed.
> Preferably during build/packaging/deployment
Is there not a way to have your parallel parsing cake and eat a
deterministic ordering too? Namely, generate the (undeterministic) list of
possible parses and then parallel mergesort it in some way that imposes a
deterministic total order on distinct parses. Lexicographic would suffice,
I'd expect.
On Fri, Apr 12, 2013 at 5:55 PM, Brandon Bloom wrote:
> Your readme says "I had difficulty getting his Parsing with Derivatives
> technique to work in a performant way". I was wondering if you could
> please elaborate.
>
> What kind of performance did you achieve?
> How does that compare to the G
Clojure documentation only talks about
:or followed by a map (from http://clojure.org/special_forms ):
> Also optionally, an *:or* key in the binding form followed by another
> map may be used to supply default values for some or all of the keys if
> they are not found in the init-expr:
>
> (l
Hi, there. I have a question about the memoization in clojure.
I compare two functions to test the performance improvement of memoization:
(defn fib [n]
(if (or (zero? n) (= n 1))
1
(+ (fib (dec n) ) (fib (- n 2)
(time (fib 30))
get the result:
"Elapsed time: 316.65 msec
To get the benefit of memoization, you need to store the memoized function
and use it again. (memoize fib-nocur) returns a function that contains an
internal memory of past results. If you call (memoize fib-nocur) again you
get a second function with an (empty!) internal memory. If you don't use
th
or you can also store it in a var:
(defn fib [n]
(if (or (zero? n) (= n 1))
1
(+ (fib (dec n) ) (fib (- n 2)
(time (fib 30)) ;; "Elapsed time: 265.472 msecs"
(def fib-memo (memoize fib))
(time (fib-memo 30)) ;; "Elapsed time: 222.122 msecs"
(time (fib-memo 30)) ;; "Elap
31 matches
Mail list logo
