Le 4 juil. 2015 10:58 PM, "stepharo" <steph...@free.fr> a écrit : > > >>> Hi thierry >>> >>> mark will arriv at Lille saturday for a month. He is working with >>> Camille on a new tree pattern matching algorithm >> >> >> A generic algorithm or one tied to the RB AST? > > A generic algo. > We will talk with Camille monday
One more on my list of things to follow. >> >>> because we lost energy on RB matcher. >> >> >> What was your analysis? > > > JC did his Phd on code transformation and with anne they try to really document > how the unification works in RB and ... after tears and pain they gave up. Did they asked John Brant? He told me he was using the RB parser for everything Smalltalk and SmaCC for other languages. Oh, for JC: SmaCC does both string and ast node replacement... With a small bug in SmaCCString I need to correct (but with a design suitable for doing that over very long files). > So we really want to see if we cannot do something better. Or something you master ;) Thierry > >> >> Thanks, >> >> Thierry >> >>> >>> Stef >>> >>> Le 1/7/15 21:29, Thierry Goubier a écrit : >>>> >>>> Le 01/07/2015 21:16, jtuc...@objektfabrik.de a écrit : >>>>> >>>>> You mean RewriteRules? I was planning to do that, for this exact reason. >>>>> But you know how things go when there is a long list of priorities. >>>>> I know it saves a lot of time and makes porting so much more safe, but >>>>> it needs an up-front investment in time... >>>> >>>> >>>> Yes, rewrite rules. Mark Rizun GUI attempts are a very interesting >>>> direction to handle that... >>>> >>>> Oh, by the way, Mark, if you're listening... I did what you were >>>> trying to do by changing AST nodes positions in Pharo, but on a SmaCC >>>> based AST for another language. I have to admit that you were right to >>>> try to do it that way, but that the Pharo/RB AST infrastructure wasn't >>>> suitable whereas SmaCC infrastructure is. >>>> >>>> Thierry >>>> >>>> >>> >>> >>> >> >> >> > >
