Such an unambiguous grammar would only have as many state transitions in its FSM than characters in the grammar, which would limit the language considerably, so you would have to raise the number of characters.

Also ( means something different in a string, so in that sense evert programming language with strings are hard to parse locally.

Also note that ambiguity formally means that more than one parse trees can represent the same string.