Sanakirja
Tekoälykääntäjä
Synonyymit
| Käännös | |
|---|---|
| Adjektiivit | |
| 1. | σαφής {m} (saphés / safís) |
| 2. | ευκρινής {m} (efkrinís) |
| 3. | αναμφίσημος (anamfísimos) |
| 4. | αναμφίβολος (anamfívolos) |
| 5. | αναμφίλεκτος (anamfílektos) |
| 6. | αναντίρρητος (anantírritos) |
Esimerkit
- An LR grammar is clearly unambiguous, since the definition implies 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 is either an LR grammar, or (dually) is a right-to-left translatable grammar, or is some grammar which is translated using "both ends to- ward the middle." Thus, the LR condition may be regarded as the most powerful general test for nonambiguity that is now available.
Taivutusmuodot
| Komparatiivi | more unambiguous |
| Superlatiivi | most unambiguous |