IndefiniteNounProd class | parser.t[2427]

Noun phrase with an indefinite article

`class IndefiniteNounProd : NounPhraseProd`

Superclass Tree (in declaration order)

`IndefiniteNounProd`
`NounPhraseProd`
`BasicProd`
`object`

Subclass Tree

`IndefiniteNounProd`
`ArbitraryNounProd`
`qualifiedSingularNounPhrase(anyPlural)`
`qualifiedSingularNounPhrase(arbitrary)`
`qualifiedSingularNounPhrase(indefinite)`

Global Objects

(none)

Summary of Properties

``

Inherited from `NounPhraseProd` :
`filterForCollectives`

Inherited from `BasicProd` :
`firstTokenIndex isSpecialResponseMatch lastTokenIndex`

Summary of Methods

`areAllEquiv resolveMainPhrase resolveNouns selectFromList`

Inherited from `NounPhraseProd` :
`filterTruncations getVerifyKeepers`

Inherited from `BasicProd` :
`canResolveTo getOrigText getOrigTokenList setOrigTokenList`

Properties

(none)

Methods

`areAllEquiv (lst)` | `parser.t[2499]`

are all of the items in the resolve list equivalents?

`resolveMainPhrase (resolver, results)` | `parser.t[2432]`

resolve the main phrase - this is separately overridable to allow subclassing

`resolveNouns (resolver, results)` | `parser.t[2438]`

by default, resolve the main noun phrase

`selectFromList (resolver, results, lst)` | `parser.t[2525]`

Select an item from the list of potential matches, given the list sorted from most likely to least likely (according to the resolver's ambiguous match filter). We'll ask the resolver to make the selection, because indefinite noun phrases can mean different things in different contexts.

TADS 3 Library Manual
Generated on 5/16/2013 from TADS version 3.1.3