Sorry for spaming this forum, but I don't know any other way to comprehend the complexity of MPS.
I reused the BinaryOperation expression of baselanguage in my own language and there are also references which look like DotExpressions. Perhaps I could reuse DotExpression as well, but I think I haven't understand what necessary therefore and I guess it's quite a bit overhead.
Unfortunately my DotExpression does not behave like the build in. If I type
a.b > c a tree like in 1) is constructed but it should look like 2) (x is the parent).
\ / \
b a c
I don't know how give my reference expression a priority so that the editors actions behave similar to a baselanguage DotExpression. Perhaps it's the easiest way to implement the DotExpression, but then I need a hint where to begin.