  DATR is a declarative representation language for lexical information and as
such, in principle, neutral with respect to particular processing strategies.
Previous DATR compiler/interpreter systems support only one access strategy
that closely resembles the set of inference rules of the procedural semantics
of DATR (Evans & Gazdar 1989a). In this paper we present an alternative access
strategy (reverse query strategy) for a non-trivial subset of DATR.
