rankByNonMatchPoss object | parser.t[5934]

Rank by unmatched possessive-qualified phrases. If we have two unknown phrases, one with a possessive qualifier and one without, and other things being equal, prefer the one with the possessive qualifier.

We prefer the qualified version because it lets us report a smaller phrase that we can't match. For example, in X BOB'S WALLET, if we can't match WALLET all by itself, it's more useful to report that "you see no wallet" than to report that you see no "bob's wallet", because the latter incorrectly implies that there might still be a wallet in scope as long as it's not Bob's we're looking for.

`rankByNonMatchPoss : CommandRankingCriterion`

Superclass Tree (in declaration order)

`rankByNonMatchPoss`
`CommandRankingCriterion`
`object`

Summary of Properties

``

``

(none)

Summary of Methods

`comparePass1 comparePass2`

``

Properties

(none)

Methods

`comparePass1 (a, b)`OVERRIDDEN | `parser.t[5940]`

ignore on pass 1 - this only counts if other factors are equal, so we want to consider all of the other factors on pass 1 before taking this criterion into account

`comparePass2 (a, b)`OVERRIDDEN | `parser.t[5943]`

pass 2 - more possessives are better

TADS 3 Library Manual
Generated on 8/21/2012 from TADS version 3.1.2