I'm experimenting with writing a tree matching DSL...

# getting-started

[Curtis Ullerich]

I'm experimenting with writing a tree matching DSL in Kotlin. Anybody know if there's something similar out there already?

[Matteo Mirk]

What would this DSL accomplish? I didn’t get it from your message, sorry

[gildor]

Maybe try check in #mathematics (or related channels)
There are quite a few people who have experience with math/science libraries with DSL

[Curtis Ullerich]

Thanks Andrey, I'll check there.

Matteo, this would let me check if an AST matches an expected pattern. This is a proof of concept I wrote.

val ast =
      ExponentNode(AdditionNode(VariableNode("x"), NumberNode(5)), NumberNode(2))
    val matcher =
      exp {
          parens {
            optional()
            plus {
              variable {}
              num {}
            }
          }
          num {}
        }
    assertThat(matcher.matches(ast)).isTrue()

[Matteo Mirk]

Understood, thanks!