unambiguous

selkeä

vastaansanomaton clear, and having no uncertainty or ambiguity
{{quote-journal

An LR(k) grammar is clearly unambiguous, since the definitionimplies every derivation tree must have the same handle, and by induc-tion there is only one possible tree. It is interesting to point out further-more that nearly every grammar which is known to be unambiguous iseither an LR(k) grammar, or (dually) is a right-to-left translatablegrammar, or is some grammar which is translated using "both ends to-ward the middle." Thus, the LR(k) condition may be regarded as the mostpowerful general test for nonambiguity that is now available.