ZDATR HyprLex Scratchpad

Dafydd Gibbon, U Bielefeld, 22 March 1997

THEORY	% Co-resident sample DATR theories (25 Jan 1996) % (1) hw.dtr - ILEX-based compositional treatment of English compounds % (2) fsa.dtr - Finite State Automaton for Lreg = abc % (3) fsi.dtr FSA interpreter with type checks for Lreg = abc %------------------------------ % (1) hw.dtr - ILEX-based compositional treatment of English compounds Housewife: <> == Wife <mod> == "House:<>". Wife: <> == Word <base> == w i f e <plural base> == w i v e s. House: <> == Word <base> == h o u s e <plural base> == h o u s e s. Word: <> == <surf> == "<mod base>" "<rel>" "<base>" <plural surf> == "<mod base>" "<rel>" "<plural base>". %------------------------------ % (2) fsa.dtr - Finite State Automaton for Lreg = abc A: <> == reject <q0 #> == accept <q0 a> == <q1> <q1 b> == <q1> <q1 c> == <q2> <q2 #> == accept. %------------------------------ % (3) fsi.dtr FSA interpreter with type checks for Lreg = abc % This example would be more instructive if variables were used. % Initialisation Start: <> == Transition:<Initial:<>>. % State transition function with type checks Transition: <> == Final <true> == <> <q0 a> == <AND:<State:<q0> Vocabulary:<a>> q1> <q1 b> == <AND:<State:<q0> Vocabulary:<b>> q1> <q1 c> == <AND:<State:<q0> Vocabulary:<c>> q2>. % Termination function with type checks Final: <> == false <q2> == AND:<State NOT:<Vocabulary:<>>> <q0> == AND:<State NOT:<Vocabulary:<>>>. % State set State: <> == false <q0> == true <q1> == true <q2> == true. % Vocabulary set Vocabulary: <> == false <a> == true <b> == true <c> == true. % Initial state definition Initial: <> == q0. % Boolean functions for type checks AND: <> == true <false> == false <true> == <>. OR: <> == false <true> == true <false> == <>. NOT: <> == false <false> == true.
QUERY	Housewife:<surf> Housewife:<plural surf> A:<q0 #> A:<q0 a b c #> A:<q0 a b b b c #> A:<q0 a b b c c #> A:<q0 c b a #> Start:<> Start:<a b c> Start:<a b b b c> Start:<a b b c c> Start:<b a c>

D. Gibbon, 24 Jan 96