mirror of
https://github.com/GrammaticalFramework/gf-core.git
synced 2026-04-13 06:49:31 -06:00
112 lines
3.5 KiB
Plaintext
112 lines
3.5 KiB
Plaintext
--# -path=.:../abstract:../common:../../prelude
|
|
|
|
concrete ConjunctionRus of Conjunction =
|
|
CatRus ** open ResRus, Coordination, Prelude in {
|
|
|
|
flags optimize=all_subs ; coding=utf8 ;
|
|
|
|
lin
|
|
|
|
ConjS = conjunctSS ;
|
|
DConjS = conjunctDistrSS ;
|
|
|
|
ConjAdv = conjunctSS ;
|
|
DConjAdv = conjunctDistrSS ;
|
|
|
|
ConjNP c xs =
|
|
conjunctTable PronForm c xs ** {n = conjNumber c.n xs.n ;
|
|
anim = xs.anim ;
|
|
p = xs.p; g = xs.g ; pron = xs.pron} ;
|
|
|
|
|
|
DConjNP c xs =
|
|
conjunctDistrTable PronForm c xs ** {n = conjNumber c.n xs.n ;
|
|
p = xs.p ; pron = xs.pron ; anim = xs.anim ;
|
|
g = xs.g } ;
|
|
|
|
|
|
ConjAP c xs = conjunctTable AdjForm c xs ** {p = xs.p} ;
|
|
|
|
|
|
DConjAP c xs = conjunctDistrTable AdjForm c xs ** {p = xs.p} ;
|
|
|
|
-- These fun's are generated from the list cat's.
|
|
|
|
BaseS = twoSS ;
|
|
ConsS = consrSS comma ;
|
|
BaseAdv = twoSS ;
|
|
ConsAdv = consrSS comma ;
|
|
|
|
|
|
ConsNP x xs =
|
|
consTable PronForm comma xs x **
|
|
{n = conjNumber xs.n x.n ; g = conjPGender x.g xs.g ;
|
|
anim = conjAnim x.anim xs.anim ;
|
|
p = conjPerson xs.p x.p; pron = conjPron xs.pron x.pron} ;
|
|
|
|
ConsAP x xs = consTable AdjForm comma xs x ** {p = andB xs.p x.p} ;
|
|
|
|
|
|
BaseAP x y = twoTable AdjForm x y ** {p = andB x.p y.p} ;
|
|
|
|
BaseNP x y = twoTable PronForm x y ** {n = conjNumber x.n y.n ;
|
|
g = conjPGender x.g y.g ; p = conjPerson x.p y.p ;
|
|
pron = conjPron x.pron y.pron ; anim = conjAnim x.anim y.anim } ;
|
|
|
|
|
|
|
|
|
|
lincat
|
|
[S] = {s1,s2 : Str} ;
|
|
[Adv] = {s1,s2 : Str} ;
|
|
-- The structure is the same as for sentences. The result is either always plural
|
|
-- or plural if any of the components is, depending on the conjunction.
|
|
[NP] = { s1,s2 : PronForm => Str ; g: PronGen ;
|
|
anim : Animacy ; n : Number ; p : Person ; pron : Bool } ;
|
|
-- The structure is the same as for sentences. The result is a prefix adjective
|
|
-- if and only if all elements are prefix.
|
|
[AP] = {s1,s2 : AdjForm => Str ; p : Bool} ;
|
|
|
|
|
|
|
|
oper
|
|
|
|
-- We have to define a calculus of numbers of persons. For numbers,
|
|
-- it is like the conjunction with $Pl$ corresponding to $False$.
|
|
--
|
|
-- The following are given in $ParamX$.
|
|
--
|
|
-- conjNumber : Number -> Number -> Number = \m,n -> case <m,n> of {
|
|
-- <Sg,Sg> => Sg ;
|
|
-- _ => Pl
|
|
-- } ;
|
|
|
|
-- For persons, we let the latter argument win ("либо ты, либо я пойду"
|
|
-- but "либо я, либо ты пойдешь"). This is not quite clear.
|
|
|
|
-- conjPerson : Person -> Person -> Person = \_,p ->
|
|
-- p ;
|
|
|
|
-- For pron, we let the latter argument win - "Маша или моя мама" (Nominative case)
|
|
-- but - "моей или Машина мама" (Genetive case) both corresponds to
|
|
-- "Masha's or my mother"), which is actually not exactly correct, since
|
|
-- different cases should be used - "Машина или моя мама".
|
|
|
|
conjPron : Bool -> Bool -> Bool = \_,p ->
|
|
p ;
|
|
|
|
-- For gender in a similar manner as for person:
|
|
-- Needed for adjective predicates like:
|
|
-- "Маша или Оля - красивая", "Антон или Олег - красивый",
|
|
-- "Маша или Олег - красивый".
|
|
-- The later is not totally correct, but there is no correct way to say that.
|
|
|
|
conjGender : Gender -> Gender -> Gender = \_,m -> m ;
|
|
conjPGender : PronGen -> PronGen -> PronGen = \_,m -> m ;
|
|
|
|
conjAnim : Animacy -> Animacy -> Animacy = \_,m -> m ;
|
|
|
|
|
|
}
|
|
|