We independently reinvented an adaptation of this algorithm for Monte's "simple" quasiliteral, which does simple string interpolation and matching. The code at

We independently reinvented an adaptation of this algorithm for Monte's "simple" quasiliteral, which does simple string interpolation and matching. The code at https://github.com/monte-language/typhon/blob/master/mast/prelude/simple.mt#L68-L121 https://github.com/monte-language/typhon/blob/master/mast/pr... is somewhat similar in appearance and structure to the examples in the post. def name := "Hackernews" # greeting == "Hi Hackernews!" def greeting := `Hi $name!` # language == "Lojban" def `@language is awesome` := "Lojban is awesome" A quirk of our presentation is that adjacent zero-or-more patterns degenerate, with each subsequent pattern matching the empty string. This mirrors the observation in the post that some systems can coalesce adjacent stars without changing the semantics: # one == "", two == "cool" def `adjacent @one@two patterns` := "adjacent cool patterns"