On 31/8/14 21:47, Thierry Goubier wrote:
Something like that, yes.
Or instead of an heuristic to get an ast, have an editor which has the logic of editing the ast (instead of typing text which will be rightly or wrongly matched to a tentative ast).
I do not think it will work because this is really constrained and typing code is not that constrained. What would be nice is to have a set of rules that help terminating a tree to the closest one. ie | -> | | x isNil ifTrue: => x isNil ifTrue: [] ... and to format only what has been typing but in presence of the complete tree.
I'm looking into doing some stuff about asts and editing for SmaCC-generated asts. Some stuff about having core building blocks for non-smalltalk IDE written in Pharo.
Thierry
Le 31/08/2014 21:14, stepharo a écrit :
You know I would like to have
format as you type.
if someone wants to work on that it would be great. The point is to have some heuristics to get as fast as possible a "complete" ast. And pretty print it for example each time a space is added.
stef