In other words, a language where every possible string is valid syntax?EDIT: This is a theoretical question.I have no interest in using such a language; I'm just asking whether it's possible.Further editI went ahead a designed such a language.  See ErrorFree
Is it possible to design a language that doesn't have syntax errors?
language design;syntax
Yes, if you look at this in a very analitic way creating a Deterministic Turing Machine that always stops in a good final state for every single string of a certain language, then you'll have demostrated that is possible. The demostration is pretty straight forward, you must a regular TM with a transition function with only one transition, that looks like this:TF(w,q) -> (w,Qa) Considerations:    L = { w | w is any possible string }    w e L    q e Q    F is a set with all good final states {Qa,Qr}    Qa e FIts been demostrated that a TM has the same computing power that any single real life computer, so this is absolutely possible