I don't know if it's the case with this language, but in general it is possible to limit the expressiveness of a language to achieve decidability. The language cannot be Turing complete of course, but for example, we can have a language with the same computation power as finite automata, which is Turing decidable, and sometimes enough for the use case.