forked from GitHub/gf-core
128 lines
3.4 KiB
Plaintext
128 lines
3.4 KiB
Plaintext
--1 Romance auxiliary operations.
|
|
--
|
|
|
|
interface ResRomance = DiffRomance ** open CommonRomance, Prelude in {
|
|
|
|
|
|
--2 Constants uniformly defined in terms of language-dependent constants
|
|
|
|
param
|
|
|
|
NPForm = Ton Case | Aton Case | Poss {g : Gender ; n : Number} ; --- AAgr
|
|
|
|
RelForm = RSimple Case | RComplex Gender Number Case ;
|
|
|
|
|
|
oper
|
|
|
|
nominative : Case = Nom ;
|
|
accusative : Case = Acc ;
|
|
|
|
Pronoun = {s : NPForm => Str ; a : Agr ; c : ClitType} ;
|
|
|
|
Compl : Type = {s : Str ; c : Case ; isDir : Bool} ;
|
|
|
|
complAcc : Compl = {s = [] ; c = accusative ; isDir = True} ;
|
|
complGen : Compl = {s = [] ; c = genitive ; isDir = False} ;
|
|
complDat : Compl = {s = [] ; c = dative ; isDir = True} ;
|
|
|
|
npform2case : NPForm -> Case = \p -> case p of {
|
|
Ton x => x ;
|
|
Aton x => x ;
|
|
Poss _ => genitive
|
|
} ;
|
|
|
|
case2npform : Case -> NPForm = \c -> case c of {
|
|
Nom => Aton Nom ;
|
|
Acc => Aton Acc ;
|
|
_ => Ton c
|
|
} ;
|
|
|
|
npRelForm : NPForm -> RelForm = \np -> case np of {
|
|
Ton c => RSimple c ;
|
|
Aton c => RSimple c ;
|
|
Poss _ => RSimple genitive
|
|
} ;
|
|
|
|
appCompl : Compl -> (NPForm => Str) -> Str = \comp,np ->
|
|
comp.s ++ np ! Ton comp.c ;
|
|
|
|
predV : Verb -> VP = \verb ->
|
|
let
|
|
vfin : TMood -> Agr -> Str = \tm,a -> verb.s ! VFin tm a.n a.p ;
|
|
vpart : AAgr -> Str = \a -> verb.s ! VPart a.g a.n ;
|
|
vinf = verb.s ! VInfin ;
|
|
|
|
aux = auxVerb verb.vtyp ;
|
|
|
|
habet : TMood -> Agr -> Str = \tm,a -> aux ! VFin tm a.n a.p ;
|
|
habere : Str = aux ! VInfin ;
|
|
|
|
vf : (Agr -> Str) -> (AAgr -> Str) -> {
|
|
fin : Agr => Str ;
|
|
inf : AAgr => Str
|
|
} =
|
|
\fin,inf -> {
|
|
fin = \\a => fin a ;
|
|
inf = \\a => inf a
|
|
} ;
|
|
|
|
in {
|
|
s = table {
|
|
VPFinite t Simul => vf (vfin t) (\_ -> []) ;
|
|
VPFinite t Anter => vf (habet t) vpart ;
|
|
VPImperat => vf (\_ -> verb.s ! VImper SgP2) (\_ -> []) ; ----
|
|
VPInfinit Simul => vf (\_ -> []) (\_ -> vinf) ;
|
|
VPInfinit Anter => vf (\_ -> []) (\a -> habere ++ vpart a)
|
|
} ;
|
|
agr = partAgr verb.vtyp ;
|
|
neg = negation ;
|
|
clit1 = \\a => [] ; ----
|
|
clit2 = [] ;
|
|
comp = \\a => [] ;
|
|
adv = [] ;
|
|
ext = [] ;
|
|
} ;
|
|
|
|
insertObject : Compl -> Pronoun -> VP -> VP = \c,np,vp ->
|
|
let
|
|
cc : Str * Str * VPAgr = case <c.isDir, np.c> of {
|
|
<False,_> | <_,Clit0> => <[], c.s ++ np.s ! Ton c.c, vp.agr> ;
|
|
_ => <np.s ! Aton c.c, [], VPAgrClit np.a>
|
|
}
|
|
in {
|
|
s = vp.s ;
|
|
agr = cc.p3 ;
|
|
clit1 = vp.clit1 ; ---- works for one clit now
|
|
clit2 = cc.p1 ;
|
|
neg = vp.neg ;
|
|
comp = \\a => vp.comp ! a ++ cc.p2 ;
|
|
adv = vp.adv ;
|
|
ext = vp.ext ;
|
|
} ;
|
|
|
|
mkClause : Str -> Agr -> VP ->
|
|
{s : Tense => Anteriority => Polarity => Mood => Str} =
|
|
\subj,agr,vp -> {
|
|
s = \\t,a,b,m =>
|
|
let
|
|
tm = case t of {
|
|
Pres => VPres m ;
|
|
Past => VImperf m ;
|
|
Fut => VFut ;
|
|
Cond => VCondit
|
|
} ;
|
|
vps = vp.s ! VPFinite tm a ;
|
|
verb = vps.fin ! agr ;
|
|
inf = vps.inf ! (appVPAgr vp.agr (aagr agr.g agr.n)) ; --- subtype bug
|
|
neg = vp.neg ! b ;
|
|
clit = vp.clit1 ! agr ++ vp.clit2 ;
|
|
compl = vp.comp ! agr ++ vp.adv ++ vp.ext
|
|
in
|
|
subj ++ neg.p1 ++ clit ++ verb ++ neg.p2 ++ inf ++ compl
|
|
} ;
|
|
|
|
|
|
}
|
|
|