Little victory lap down to the chocolate shop because the thing I've spent the week working on now works.

I'm working on a pattern-matching syntax and algorithm for mathematical expressions. Like an analogue of regular expressions, but for trees. I worked out the last few missing pieces while talking with someone at #eams2018 last week.

Ich win ein Berliner

@christianp I occasionally have re-surface a parsing requirement that I feel should have been solved by someone, somewhere, and feels like it would be phenomenally useful, but I can never find a solution.

I should write up the requirement sometime so people can tell me why it will never work.

@christianp Sounds like that could potentially be applied to build a nice macro system for a lisp-like language. Or—I'm thinking out-loud as I'm writing—a nice foundation for a computer algebra package.

I'd love to hear more about it anyway.

@j the latter is what I intend to use it for

@christianp What does “tree” mean here?

@Colinvparker an abstract syntax tree. For example, a × (b+c) can be interpreted as a tree with × at the root

@christianp ok, so there’s a search syntax that would let me search for simple things like “b+c” or “a product involving a sum” or such?

@christianp and vs regular expressions I don’t have to spend a long time telling it to ignore parentheses if they’re redundant or other silliness?

JordiGH@JordiGH@mathstodon.xyz@christianp Nice! And what's that?