The motivation that is provided is very arguable. The traditional expression languages, whatever you mean by that, do not have ambiguities. If you claim they do then please provide solid examples.

Such languages typically have unambiguous set of presedence rules that always allow for a single interpretation. The parentheses are used in order to facilitate grouping and allow for more complex expressions.

Last but not least, the syntax tree may still be ambiguous. It solely depends on the semantics behind. For example for a function call "F(a = a - 1, a = a + 1)" where "F(x,y) = x/y" the abstract syntax tree will be fixed, but the result of the expression will depend on the order in which the arguments of the call are going to be executed!

So please consider re-working or even removing this argumentation.

Existing Wording:

In addition, this approach avoids potential ambiguity that must be resolved with operator precedence and/or the use of parentheses in traditional expression languages.