Re: Pry v0.3.1 is out!

2017-01-20 Thread Dmitry Olshansky via Digitalmars-d-announce
On 1/17/17 11:52 PM, Bastiaan Veelo wrote: On Sunday, 15 January 2017 at 01:26:07 UTC, Dmitry Olshansky wrote: Two key areas of focus are (compared to say Pegged): - performance, on par with hand-written code or die I didn't profile, but apart from the time-complexity that is inherent to

Re: Pry v0.3.1 is out!

2017-01-17 Thread Bastiaan Veelo via Digitalmars-d-announce
On Sunday, 15 January 2017 at 01:26:07 UTC, Dmitry Olshansky wrote: Two key areas of focus are (compared to say Pegged): - performance, on par with hand-written code or die I didn't profile, but apart from the time-complexity that is inherent to straight forward recursive descent parsers like

Re: Pry v0.3.1 is out!

2017-01-17 Thread Bastiaan Veelo via Digitalmars-d-announce
On Tuesday, 17 January 2017 at 21:10:17 UTC, Dmitry Olshansky wrote: On 1/17/17 1:16 PM, Bastiaan Veelo wrote: On Monday, 16 January 2017 at 22:29:01 UTC, Dmitry Olshansky wrote: I think left-recursion is better handled at the grammar level. What I currently have is parser combinators level

Re: Pry v0.3.1 is out!

2017-01-17 Thread Dmitry Olshansky via Digitalmars-d-announce
On 1/17/17 1:16 PM, Bastiaan Veelo wrote: On Monday, 16 January 2017 at 22:29:01 UTC, Dmitry Olshansky wrote: I think left-recursion is better handled at the grammar level. What I currently have is parser combinators level where adding this transformation is awkward and too much magic IMO.

Re: Pry v0.3.1 is out!

2017-01-17 Thread Bastiaan Veelo via Digitalmars-d-announce
On Monday, 16 January 2017 at 22:29:01 UTC, Dmitry Olshansky wrote: I think left-recursion is better handled at the grammar level. What I currently have is parser combinators level where adding this transformation is awkward and too much magic IMO. Handling left-recursion by grammar

Re: Pry v0.3.1 is out!

2017-01-16 Thread Dmitry Olshansky via Digitalmars-d-announce
On 1/16/17 1:29 AM, Bastiaan Veelo wrote: On Sunday, 15 January 2017 at 01:26:07 UTC, Dmitry Olshansky wrote: Pry is a new pragmatic parser combinators library. https://github.com/DmitryOlshansky/pry Interesting. How about left-recursion? (I added support for left-recursive grammars to

Re: Pry v0.3.1 is out!

2017-01-15 Thread Bastiaan Veelo via Digitalmars-d-announce
On Sunday, 15 January 2017 at 01:26:07 UTC, Dmitry Olshansky wrote: Pry is a new pragmatic parser combinators library. https://github.com/DmitryOlshansky/pry Interesting. How about left-recursion? (I added support for left-recursive grammars to Pegged.)

Re: Pry v0.3.1 is out!

2017-01-15 Thread Dicebot via Digitalmars-d-announce
On Sunday, 15 January 2017 at 13:14:45 UTC, Dmitry Olshansky wrote: I could have wasted time by creating nodes and assigning values in the map functions but if you just want the result of calculation it's all moot. Thanks for explanation! This is indeed very promising and much in spirit of D

Re: Pry v0.3.1 is out!

2017-01-15 Thread Dmitry Olshansky via Digitalmars-d-announce
On 1/15/17 2:26 AM, Dmitry Olshansky wrote: Pry is a new pragmatic parser combinators library. [snip] Two key areas of focus are (compared to say Pegged): - performance, on par with hand-written code or die Actually testing the latest version with LDC I found out that handwritten code is a

Re: Pry v0.3.1 is out!

2017-01-15 Thread Dicebot via Digitalmars-d-announce
Sounds intriguing! On 01/15/2017 01:26 AM, Dmitry Olshansky wrote: > - versatility, generating some goofy parse tree is not a goal, the goal > is extraction of data the way the user specifies Can you show an example of what you have in mind for this? signature.asc Description: OpenPGP

Pry v0.3.1 is out!

2017-01-14 Thread Dmitry Olshansky via Digitalmars-d-announce
Pry is a new pragmatic parser combinators library. https://github.com/DmitryOlshansky/pry (also available on Dub) It's still in the early stages but I think it might be a good time to gauge some interest. Two key areas of focus are (compared to say Pegged): - performance, on par with