No, dynamic languages are not "ambiguous" in any possible way. Programming languages are unambiguous by definition, as any formal languages. What they are, ind

No, dynamic languages are not "ambiguous" in any possible way. Programming languages are unambiguous by definition, as any formal languages. What they are, indeed, is dynamic. The lookups you are talking about are done in runtime, so the result of these lookups can vary depending on the state in memory at a given time. That doesn't mean they're ambiguous. Everything is perfectly unambiguous and deterministic. They're just dynamic. And that's fine. FYI: People also write tests in static languages.