I was reading the classic Cinderella Book and I saw they refer to what essentially is the abstract matchertext of section 3.1. as a Dyck language. See also the Wikipedia page for Dyck languages (specifically what they call a typed Dyck language).
The only difference between abstract matchertext and a Dyck language is that the Dyck language does not allow for non-matcher characters, making abstract matchertext a strict generalization. I feel like this could be mentioned in the paper.
I USE GITHUB UNDER PROTEST
I was reading the classic Cinderella Book and I saw they refer to what essentially is the abstract matchertext of section 3.1. as a Dyck language. See also the Wikipedia page for Dyck languages (specifically what they call a typed Dyck language).
The only difference between abstract matchertext and a Dyck language is that the Dyck language does not allow for non-matcher characters, making abstract matchertext a strict generalization. I feel like this could be mentioned in the paper.
I USE GITHUB UNDER PROTEST