Hi,
I am happy to announce the availability of PetitParser2, a wonderful redesign of the original PetitParser developed by Jan Kurš. Highlights: - it introduces the compiler facility that speeds up parsers by a factor of ~2-5x - it introduces the possibility of parsing streams without having them in memory - it comes with a new structure internally that makes it more flexible - it introduces asPParser (not a typo) to be able to have the new version working in parallel with the classic asParser The version is already present in the latest Moose 6.1 in parallel with PetitParser. Also, several of the parsers that are shipping with PetitParser were already copied to PetitParser2 as well. You can find more details here: Some more documentation will follow. I think Jan did a wonderful job and the result is quite exciting. Please take a look and let us know what you think. Cheers, Doru _______________________________________________ Moose-dev mailing list [hidden email] https://www.list.inf.unibe.ch/listinfo/moose-dev |
Did anyone take a look at this?
Cheers, Doru > On Nov 8, 2016, at 5:14 PM, Tudor Girba <[hidden email]> wrote: > > Hi, > > I am happy to announce the availability of PetitParser2, a wonderful redesign of the original PetitParser developed by Jan Kurš. > https://github.com/kursjan/petitparser2 > > Highlights: > - it introduces the compiler facility that speeds up parsers by a factor of ~2-5x > - it introduces the possibility of parsing streams without having them in memory > - it comes with a new structure internally that makes it more flexible > - it introduces asPParser (not a typo) to be able to have the new version working in parallel with the classic asParser > > The version is already present in the latest Moose 6.1 in parallel with PetitParser. Also, several of the parsers that are shipping with PetitParser were already copied to PetitParser2 as well. > > You can find more details here: > http://www.humane-assessment.com/blog/introducing-petitparser2/ > > Some more documentation will follow. > > I think Jan did a wonderful job and the result is quite exciting. Please take a look and let us know what you think. > > Cheers, > Doru > > -- > www.tudorgirba.com > www.feenk.com > > "What we can governs what we wish." > > > > -- www.tudorgirba.com www.feenk.com "If you can't say why something is relevant, it probably isn't." _______________________________________________ Moose-dev mailing list [hidden email] https://www.list.inf.unibe.ch/listinfo/moose-dev |
Hi Doru, i didn't had the time to look at it but we are really interested about this at synectique. Thanks for your work and the cool explanations post! 2016-11-11 7:34 GMT+01:00 Tudor Girba <[hidden email]>: Did anyone take a look at this? Guillaume Larcheveque
_______________________________________________ Moose-dev mailing list [hidden email] https://www.list.inf.unibe.ch/listinfo/moose-dev |
In reply to this post by Tudor Girba-2
Verstuurd vanaf mijn iPhone > Op 11 nov. 2016 om 07:34 heeft Tudor Girba <[hidden email]> het volgende geschreven: > > Did anyone take a look at this? Not yet, because I couldn't run a fresh Moose ;) Stephan _______________________________________________ Moose-dev mailing list [hidden email] https://www.list.inf.unibe.ch/listinfo/moose-dev |
Because of Iceberg? If yes, I disabled it until we can safely run it on Windows.
Doru > On Nov 11, 2016, at 10:17 AM, Stephan Eggermont <[hidden email]> wrote: > > > > Verstuurd vanaf mijn iPhone > >> Op 11 nov. 2016 om 07:34 heeft Tudor Girba <[hidden email]> het volgende geschreven: >> >> Did anyone take a look at this? > > Not yet, because I couldn't run a fresh Moose ;) > > Stephan > _______________________________________________ > Moose-dev mailing list > [hidden email] > https://www.list.inf.unibe.ch/listinfo/moose-dev -- www.tudorgirba.com www.feenk.com "From an abstract enough point of view, any two things are similar." _______________________________________________ Moose-dev mailing list [hidden email] https://www.list.inf.unibe.ch/listinfo/moose-dev |
Hi Guillaume, Please feel free to contact me if you have any questions. I would be really please if syntectique finds it useful. There is a potential for further optimizations and we can work on it. Cheers Jan On Fri, Nov 11, 2016, 10:18 Tudor Girba <[hidden email]> wrote: Because of Iceberg? If yes, I disabled it until we can safely run it on Windows. _______________________________________________ Moose-dev mailing list [hidden email] https://www.list.inf.unibe.ch/listinfo/moose-dev |
In reply to this post by Tudor Girba-2
I would like to integrate it in LRP, but I’m a bit swamped at the moment so I have not looked at it at all, sorry. Hopefully before the end of the year. :-/ -- Does this mail seem too brief? Sorry for that, I don’t mean to be rude! Please see http://emailcharter.org . Johan Fabry - http://pleiad.cl/~jfabry PLEIAD and RyCh labs - Computer Science Department (DCC) - University of Chile > On 11 Nov 2016, at 03:34, Tudor Girba <[hidden email]> wrote: > > Did anyone take a look at this? > > Cheers, > Doru > > >> On Nov 8, 2016, at 5:14 PM, Tudor Girba <[hidden email]> wrote: >> >> Hi, >> >> I am happy to announce the availability of PetitParser2, a wonderful redesign of the original PetitParser developed by Jan Kurš. >> https://github.com/kursjan/petitparser2 >> >> Highlights: >> - it introduces the compiler facility that speeds up parsers by a factor of ~2-5x >> - it introduces the possibility of parsing streams without having them in memory >> - it comes with a new structure internally that makes it more flexible >> - it introduces asPParser (not a typo) to be able to have the new version working in parallel with the classic asParser >> >> The version is already present in the latest Moose 6.1 in parallel with PetitParser. Also, several of the parsers that are shipping with PetitParser were already copied to PetitParser2 as well. >> >> You can find more details here: >> http://www.humane-assessment.com/blog/introducing-petitparser2/ >> >> Some more documentation will follow. >> >> I think Jan did a wonderful job and the result is quite exciting. Please take a look and let us know what you think. >> >> Cheers, >> Doru >> >> -- >> www.tudorgirba.com >> www.feenk.com >> >> "What we can governs what we wish." >> >> >> >> > > -- > www.tudorgirba.com > www.feenk.com > > "If you can't say why something is relevant, > it probably isn't." > > _______________________________________________ > Moose-dev mailing list > [hidden email] > https://www.list.inf.unibe.ch/listinfo/moose-dev _______________________________________________ Moose-dev mailing list [hidden email] https://www.list.inf.unibe.ch/listinfo/moose-dev |
In reply to this post by Tudor Girba-2
Are there any specific benchmarks for this ? or is it a general estimate ? _______________________________________________ Moose-dev mailing list [hidden email] https://www.list.inf.unibe.ch/listinfo/moose-dev |
The benchmarks are delivered with PP2, so far there are pre-prepared benchmarks for: - simple arithmetic expression grammar - smalltalk grammar/smalltalk parser - java parser (if you download PetitJava) You can run it on your own, e.g.: PP2Benchmark exampleSmalltalk Currently I am working on optimization of context sensitive grammars as well. As I said before, there is a space for optimizations. If you can identify a bottleneck, there is a very high probability the PP2 can be extended to fix that.
_______________________________________________ Moose-dev mailing list [hidden email] https://www.list.inf.unibe.ch/listinfo/moose-dev |
thank you jan for the info On Sun, Nov 13, 2016 at 11:35 AM Jan Kurš <[hidden email]> wrote:
_______________________________________________ Moose-dev mailing list [hidden email] https://www.list.inf.unibe.ch/listinfo/moose-dev |
In reply to this post by Jan Kurš
Guillaume is going on vacation this week or next and we have
clients visiting us. Le 11/11/16 à 18:09, Jan Kurš a écrit :
_______________________________________________ Moose-dev mailing list [hidden email] https://www.list.inf.unibe.ch/listinfo/moose-dev |
Free forum by Nabble | Edit this page |