4 ms·
Thanks for the kind comment. Nowadays, my products are my source of funding, so no chance to open source anything. In the future, I'm sure some things will make
by jng 18y ago
Thanks for the kind comment. Nowadays, my products are my source of funding, so no chance to open source anything. In the future, I'm sure some things will make their way into more open forms (not totally sure about what form).
Every computation can be seen as an exercise of parsing. The cases you mention, and many other ones.
I'm working in a new computation model, a new programming language and a new type of VM. But I don't want to talk much about it until work is more advanced.
- owinebarger 18y agoI found myself thinking I could see the answer as you were describing the problem. That's good writing! My guess would be that you'd need to have a new data structure for the text (or pointing into the straight text) that tracked the order of editing, then a corresponding set of new lexemes and reductions "sitting on top" of the existing parse tree, until the new edits + intervening test/parse tree reduces into something acceptable for the node of the parse tree in which the new text lives. Fun stuff.
- jng 18y agoThanks for the compliment! Actually, I'd think it's probably due to writing the article "after the fact", rather than to good writing. The proper approach to a problem seems so obvious once you know it...