Re: [ANN] Instaparse 1.1.0

That is what I meant, should have been clearer. Those reasons make sense. Thank you! -Zack On Saturday, June 15, 2013 10:41:49 PM UTC-4, puzzler wrote: > > On Sat, Jun 15, 2013 at 7:21 PM, Zack Maril > > wrote: > >> Why does instaparse not throw errors? Curious about the reasoning behind >> thi

Re: [ANN] Instaparse 1.1.0

On 12 June 2013 00:09, Mark Engelberg wrote: > Honestly I hadn't yet given it any thought. Thanks for the interest in > having it on Clojurescript. Here are a few issues that come to mind: Given how *awesome* it would be for Instaparse to become cross-platform, I'm sure I'm not the only Clojure

Re: [ANN] Instaparse 1.1.0

On 12 June 2013 00:33, Andy Fingerhut wrote: > I haven't done anything but think about it during commute time yet, but I > had been wondering in how many situations it might be useful to have a > string type that was something like Relaxed Radix Binary trees, in that they > can be concatenated and

Re: [ANN] Instaparse 1.1.0

On 12 June 2013 15:46, JeremyS wrote: > [...] I don't know how much work it would need to have the incremental > vector working in cljs since hashing isn't > 'embedded' in JavaScript (cljs uses the google closure libraries for that). ClojureScript uses the Closure library for string hashing and f

Re: [ANN] Instaparse 1.1.0

On Sat, Jun 15, 2013 at 7:21 PM, Zack Maril wrote: > Why does instaparse not throw errors? Curious about the reasoning behind > this design. > -Zack > I'm not sure what you mean. It does throw errors for certain kinds of invalid grammars and other fatal problems. Perhaps what you're asking is

Re: [ANN] Instaparse 1.1.0

Why does instaparse not throw errors? Curious about the reasoning behind this design. -Zack On Wednesday, June 12, 2013 9:46:06 AM UTC-4, JeremyS wrote: > > Hi puzzler, > > I have a project that > I have been meaning to be useable from Clojure

Re: [ANN] Instaparse 1.1.0

Hi puzzler, I have a project that I have been meaning to be useable from Clojure and ClojureScript. To do so I am using lein-dalap . I totally agree with you about the issues you have foreseen

Re: [ANN] Instaparse 1.1.0

On Tue, Jun 11, 2013 at 3:33 PM, Andy Fingerhut wrote: > > I haven't done anything but think about it during commute time yet, but I > had been wondering in how many situations it might be useful to have a > string type that was something like Relaxed Radix Binary trees, in that > they can be conc

Re: [ANN] Instaparse 1.1.0

Here's another link: http://java-performance.info/changes-to-string-java-1-7-0_06/ -- -- 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 - pleas

Re: [ANN] Instaparse 1.1.0

And to answer my own question about a reference for this change in behavior, which appears to have been made in Java 7: http://stackoverflow.com/questions/16123446/java-7-string-substring-complexity Andy On Tue, Jun 11, 2013 at 3:33 PM, Andy Fingerhut wrote: > Mark, > > I had not heard about

Re: [ANN] Instaparse 1.1.0

Mark, I had not heard about Java changing the substring operation from O(1) to O(n). Do you have a link to any further info about this change? I'm guessing that the implementation is changing from the O(1) "create a new String object that is a reference to a portion of the original String object

Re: [ANN] Instaparse 1.1.0

Honestly I hadn't yet given it any thought. Thanks for the interest in having it on Clojurescript. Here are a few issues that come to mind: 1. To achieve performance, I've spent time coding custom data structures that implement various Clojure and Java interfaces. I haven't done much with Cloj

Re: [ANN] Instaparse 1.1.0

Hi Puzzler, I was wondering if you planned to port Instaparse to ClojureScript. I know it's asking a lot, but I am one of those who would love to be able to run it in a browser or in node.js... Cheers, Jeremys. On Tuesday, May 14, 2013 10:13:52 AM UTC+2, puzzler wrote: > > Instaparse is an eas

Re: [ANN] Instaparse 1.1.0

I am just curious, not requesting this feature :-) How to represent negation in BNF? http://stackoverflow.com/questions/10922352/how-to-represent-negation-in-bnf http://pythonhosted.org/modgrammar/libref.html modgrammar.EXCEPT(grammar, exc_grammar, **kwargs) Match grammar, but only if it does

Re: [ANN] Instaparse 1.1.0

On Mon, Jun 10, 2013 at 2:57 AM, Frantisek Sodomka wrote: > Googling the exception operator: > http://avisynth.org/mediawiki/User:Gzarkadas/EBNF > Exception The effect is the logical negation of the rule > following. For example -"a" becomes ? all characters not equal to a ?. > Yeah, th

Re: [ANN] Instaparse 1.1.0

Large bounded repetition is a theoretical question. My use case requires to ensure repetition of only small number of digits - one digit, two digits and similar. I would use bounded repetition to ensure the needed number of digits. Yes, different workarounds will work for me, so it is not a pre

Re: [ANN] Instaparse 1.1.0

On Mon, Jun 10, 2013 at 2:13 AM, Frantisek Sodomka wrote: > EBNF syntax for bounded repetition could be just simply A 3*5 and these > are equal: > A? is A*1 > A+ is A1* > A* is A0* > Right now, in the EBNF syntax, numbers are valid non-terminal identifiers. So for example, rather than "S = A B+",

Re: [ANN] Instaparse 1.1.0

EBNF syntax for bounded repetition could be just simply A 3*5 and these are equal: A? is A*1 A+ is A1* A* is A0* Frantisek On Monday, June 10, 2013 11:04:52 AM UTC+2, Frantisek Sodomka wrote: > > Hello Mark, > I have few suggestions: > > 1. I was going through the tutorial and comparing EBNF an

Re: [ANN] Instaparse 1.1.0

Hello Mark, I have few suggestions: 1. I was going through the tutorial and comparing EBNF and ABNF grammars. ABNF adds Bounded Repetition 3*5 A. Is there any chance of adding it also to EBNF? I don't know, how the syntax would be, but it can be useful at times. Repetition of characters can be

Re: [ANN] Instaparse 1.1.0

On Tue, May 14, 2013 at 6:17 AM, Laurent PETIT wrote: > Mark, the combined qualities of the code, the documentation, the > communication, is inspiring ! > Aw shucks. I'm blushing. Thanks guys. --Mark -- -- You received this message because you are subscribed to the Google Groups "Clojure" gr

Re: [ANN] Instaparse 1.1.0

2013/5/14 JeremyS : > Hi Puzzler, > > Instaparse seems to be a wonderful piece of software congrats ! I haven't > had the time to test it yet but > it's on the top of my to do list. > > Cheers > Jeremy. > > PS This is kind of a fan boy message but congratulations really seem to be > in order noneth

Re: [ANN] Instaparse 1.1.0

Hi Puzzler, Instaparse seems to be a wonderful piece of software congrats ! I haven't had the time to test it yet but it's on the top of my to do list. Cheers Jeremy. PS This is kind of a fan boy message but congratulations really seem to be in order nonetheless :) On Tuesday, May 14, 2013 1

[ANN] Instaparse 1.1.0

Instaparse is an easy-to-use, feature-rich parser generator for Clojure. The big idea behind instaparse is to make it simple to convert grammars to parsers without needing to know the idiosyncrasies of LL1, LALR, and other esoteric grammar restrictions imposed by most parser generators. When I ann