4 ms·

> I didn't get it before, but when you said "texts are code" - now I see that you were feeding kanbun text into a VM that interpreted it as code..!? I don't re

> I didn't get it before, but when you said "texts are code" - now I see that you were feeding kanbun text into a VM that interpreted it as code..!? I don't remember the exact details of my thoughts at the time, by I still have the code. I put it online here for you: https://dotnetfiddle.net/Q0kiXU https://dotnetfiddle.net/Q0kiXU As you can see, it works well on small samples but fails for the most complex examples present in the paper. This is because the way I handle ㆑ which is not enough to deal with its real complexity. Edit: reading that https://ipsj.ixsq.nii.ac.jp/ej/?action=repository_uri&item_id=137405&file_id=1&file_no=1 https://ipsj.ixsq.nii.ac.jp/ej/?action=repository_uri&item_i... I thing I was very close. The paper mention three stacks. I'm using 5 in my code, but maybe not in the good way. I don't have too much time to spend on the matter, but I might read a few papers and maybe contact/go meet the author because it's fascinating and nothing is published in an European language.

lioeters 7y ago
Cool, a Kanbun parser and interpreter! That's a really interesting approach. I'm not so familiar with C# but I get the general picture, as I've worked with mathematical expression parser/evaluator before in a couple other programming languages. Indeed, after reading the linked paper, I see how the handling of "㆑" has complex rules. The complete algorithm is beyond my understanding, and I imagine getting it to a practical level would be years of work.. Sounds like it would be fun for you to contact the author, I'm sure he'd appreciate that someone had the courage to dive into the depths of his obsession/expertise in this topic. :)