Pharo-users

By thread

pharo-users@lists.pharo.org

6 participants
50352 messages

Re: [Pharo-users] How not to serve an AngularJs application from Pharo

by Stephan Eggermont

Kilon wrote: >would it not be better to have the html / css and js code outside the image ? so instead to load files instead of return strings ? Only for the things that are really static. All other parts should be in the image, and be generated, just like the seaside canvas does for html. Working with files just kills my productivity, especially if I have to switch out of Pharo. For deployment, you can generate files, but then you don't serve them with Pharo. Of course, if you start out with files like in this example, it takes some time to refactor towards a sensible model. Stephan

Oct. 29, 2014

Re: [Pharo-users] AST tokens question

by Mark Rizun

P.S. Moreover, it's not only that I have to pass oldNodes each time from old node to new one. Each time I replace node I reparse tree and I lose oldNodes from each node of ast:) So, I have to pass oldNodes from each node of ast to each coresponding node of new ast. And it's a real problem. 2014-10-29 12:16 GMT+02:00 Mark Rizun <mrizun(a)gmail.com>: > I misunderstood you, of course I can find the node in old ast which was > replaced, using operator =. > Sure it works, but the problem is I have to pass oldNodes each time from > old node to new one. >

Oct. 29, 2014

Re: [Pharo-users] AST tokens question

by Mark Rizun

I misunderstood you, of course I can find the node in old ast which was replaced, using operator =. Sure it works, but the problem is I have to pass oldNodes each time from old node to new one.

Oct. 29, 2014

Re: [Pharo-users] AST tokens question

by stepharo

Thanks thierry and mark for this interesting discussion! Stef On 27/10/14 13:36, Mark Rizun wrote: > Hi all, > > Trying to understand here how tokens are used in AST. > So far I can not see any order in usage of tokens. > For instance, why RBValueNode doesn't have token? Is it haow it's > supposed to be? > > Cheers, > Mark

Oct. 29, 2014

Re: [Pharo-users] AST tokens question

by Mark Rizun

> > This is well how I understood it. > > Are you implementing something around the use of refactoring? > I'm implementing tool for creating rewrite rules. Here is a blog about it: http://myfuncoding.blogspot.com/ Also I write chapter for PharoForEnterprise: https://github.com/SquareBracketAssociates/PharoForTheEnterprise-english/tr… > Keep us updated on your solution. It is significant because the equality > between ast nodes is part of the SmaCC parser generator toolkit, so any > solution on that may also be used when manipulating non-smalltalk code (C, > Java, C#, Python, R, Ada, etc...). > Sure, I will.

Oct. 29, 2014

Re: [Pharo-users] AST tokens question

by Thierry Goubier

2014-10-29 10:44 GMT+01:00 Mark Rizun <mrizun(a)gmail.com>: > > > 2014-10-29 11:40 GMT+02:00 Thierry Goubier <thierry.goubier(a)gmail.com>: > >> >> >> 2014-10-29 10:22 GMT+01:00 Mark Rizun <mrizun(a)gmail.com>: >> >>> Second one, I do replace node all the time. >>> >> >> You insert new code inside the text view? >> > > Yes > > >> >> For me, if you replace nodes and display that, then you are "slowly" >> replacing nodes. Anything which has some display to a user in the loop is >> "slow". >> > I'm not doing this in loop. I have AST and text view of it. Than I do one > replace and update text view. > When I wrote "all the time", I ment replacing nodes is very important in > my tool, as it does main functionality. > This is well how I understood it. Are you implementing something around the use of refactoring? > > >> >> >>> Thinking a bit about it, I'd try reparse, get node from selection index, >>>> find equal old node in old (modified) ast, or replace old (modified) ast >>>> with new one. >>>> >>> Can you explain this, sorry I didn't get the point >>> >> >> Use either =, equalTo:withMapping:, match:inContext: to find the relevant >> new node equal to your old node in the new ast. >> > Good, thanks for advice. Firstly, I will check your suggestion with > equality. If it fails for me, I'll try my suggestion with calculating > inside tool. > Keep us updated on your solution. It is significant because the equality between ast nodes is part of the SmaCC parser generator toolkit, so any solution on that may also be used when manipulating non-smalltalk code (C, Java, C#, Python, R, Ada, etc...). Thierry > > Thanks again, > Mark > >

Oct. 29, 2014

Re: [Pharo-users] AST tokens question

by Mark Rizun

2014-10-29 11:40 GMT+02:00 Thierry Goubier <thierry.goubier(a)gmail.com>: > > > 2014-10-29 10:22 GMT+01:00 Mark Rizun <mrizun(a)gmail.com>: > >> Second one, I do replace node all the time. >> > > You insert new code inside the text view? > Yes > > For me, if you replace nodes and display that, then you are "slowly" > replacing nodes. Anything which has some display to a user in the loop is > "slow". > I'm not doing this in loop. I have AST and text view of it. Than I do one replace and update text view. When I wrote "all the time", I ment replacing nodes is very important in my tool, as it does main functionality. > > >> Thinking a bit about it, I'd try reparse, get node from selection index, >>> find equal old node in old (modified) ast, or replace old (modified) ast >>> with new one. >>> >> Can you explain this, sorry I didn't get the point >> > > Use either =, equalTo:withMapping:, match:inContext: to find the relevant > new node equal to your old node in the new ast. > Good, thanks for advice. Firstly, I will check your suggestion with equality. If it fails for me, I'll try my suggestion with calculating inside tool. Thanks again, Mark

Oct. 29, 2014

Re: [Pharo-users] AST tokens question

by Thierry Goubier

2014-10-29 10:22 GMT+01:00 Mark Rizun <mrizun(a)gmail.com>: > Second one, I do replace node all the time. > You insert new code inside the text view? For me, if you replace nodes and display that, then you are "slowly" replacing nodes. Anything which has some display to a user in the loop is "slow". > Thinking a bit about it, I'd try reparse, get node from selection index, >> find equal old node in old (modified) ast, or replace old (modified) ast >> with new one. >> > Can you explain this, sorry I didn't get the point > Use either =, equalTo:withMapping:, match:inContext: to find the relevant new node equal to your old node in the new ast. Thierry

Oct. 29, 2014

Re: [Pharo-users] AST tokens question

by Thierry Goubier

2014-10-29 10:09 GMT+01:00 Mark Rizun <mrizun(a)gmail.com>: > P.S. I have a solution, but don't know if it's appropriate: I remove > updating of source interval from replaceWith: method, but my tool will do > all the calculations of interval on it's own. > This is a possibility: have a transform; when you get selection intervals, look if they are inside "replaced areas" or outside of it; increase or decrease the indexes to compensate for added code / removed code. But this is more complex than it looks. But I would try the equality over an AST first. A lot more robust for me. Thierry > > 2014-10-29 10:59 GMT+02:00 Mark Rizun <mrizun(a)gmail.com>: > >> That is way I'd like to have automatically updated source interval. >>>> >>> >>> I'm still not entirely sure why. Source intervals are only there to help >>> relating the ast to the source, not much else, really. >>> >> >> I use source intervals to detect which node is selected and than in the >> right-click menu user can see only options that are relevanto to selected >> node, as it is also made in SmartSuggestions. >> > >

Oct. 29, 2014

Re: [Pharo-users] AST tokens question

by Mark Rizun

Second one, I do replace node all the time. Thinking a bit about it, I'd try reparse, get node from selection index, > find equal old node in old (modified) ast, or replace old (modified) ast > with new one. > Can you explain this, sorry I didn't get the point

Oct. 29, 2014

Jump to page: