Hi Jan,
Le 21/08/2016 à 12:13, Jan Kurš a écrit :
I added some details to the webpage for those, who are interested: http://scg.unibe.ch/research/petitcompiler
Thanks.
@Thierry: Thanks! I am not changing any complexity characteristics. The speedup is gained by analyzing a grammar and optimizing some parts. E.g. replacing combinators with a while loop, or using the first-set to choose the correct branch without backtracking (if possible).
This one (avoiding backtracking) does change the complexity in a good way (reduces it). A nice optimisation.
Thierry
On Sat, Aug 20, 2016 at 5:12 PM Johan Fabry <jfabry@dcc.uchile.cl mailto:jfabry@dcc.uchile.cl> wrote:
Thanks for the numbers, Jan. And they are excellent numbers as well! :-) Congrats on the compiler, it is simply great ! -- 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 ChileOn Aug 20, 2016, at 10:36, Jan Kurš <kurs.jan@gmail.com <mailto:kurs.jan@gmail.com>> wrote: On the Smalltalk grammar, SmaCC is two times faster than PetitParser and Compiled PetitParser is four times faster. RBParser is like four point one times faster. The SmaCC parsers are table driven, unless you rewrite SmaCC to produce top-down parsers, it will not reach the performance of RBParser or the parser compiled by PetitParser Compiler. Cheers Jan_______________________________________________ Moose-dev mailing list Moose-dev@list.inf.unibe.ch <mailto:Moose-dev@list.inf.unibe.ch> https://www.list.inf.unibe.ch/listinfo/moose-dev
Moose-dev mailing list Moose-dev@list.inf.unibe.ch https://www.list.inf.unibe.ch/listinfo/moose-dev