mirror of
https://github.com/GrammaticalFramework/gf-core.git
synced 2026-04-22 11:19:32 -06:00
217 lines
7.5 KiB
Plaintext
217 lines
7.5 KiB
Plaintext
--# -path=.:../abstract:../common:../prelude
|
|
|
|
resource ParadigmsLav = open
|
|
(Predef=Predef),
|
|
Prelude,
|
|
ParadigmsNounsLav,
|
|
ParadigmsAdjectivesLav,
|
|
ParadigmsVerbsLav,
|
|
ParadigmsPronounsLav,
|
|
ResLav,
|
|
CatLav
|
|
in {
|
|
|
|
flags
|
|
coding = utf8 ;
|
|
|
|
oper
|
|
singular : Number = Sg ;
|
|
plural : Number = Pl ;
|
|
|
|
masculine : Gender = Masc ;
|
|
feminine : Gender = Fem ;
|
|
|
|
second_conjugation : VerbConj = C2 ;
|
|
third_conjugation : VerbConj = C3 ;
|
|
|
|
nominative : Case = Nom ;
|
|
genitive : Case = Gen ;
|
|
dative : Case = Dat ;
|
|
accusative : Case = Acc ;
|
|
locative : Case = Loc ;
|
|
|
|
active_voice : PartType = IsUsi ;
|
|
passive_voice : PartType = TsTa ;
|
|
|
|
mkN = overload {
|
|
mkN : (lemma : Str) -> N = \l -> lin N (mkNoun l) ;
|
|
|
|
mkN : (lemma : Str) -> Bool -> N = \l,p -> lin N (mkNounByPal l p) ;
|
|
mkN : (lemma : Str) -> Gender -> N = \l,g -> lin N (mkNounByGend l g) ;
|
|
mkN : (lemma : Str) -> NounDecl -> N = \l,d -> lin N (mkNounByDecl l d) ;
|
|
|
|
mkN : (lemma : Str) -> Gender -> Bool -> N = \l,g,p -> lin N (mkNounByGendPal l g p) ;
|
|
mkN : (lemma : Str) -> NounDecl -> Bool -> N = \l,d,p -> lin N (mkNounByDeclPal l d p) ;
|
|
mkN : (lemma : Str) -> Gender -> NounDecl -> N = \l,g,d -> lin N (mkNounByGendDecl l g d) ;
|
|
|
|
mkN : (lemma : Str) -> Gender -> NounDecl -> Bool -> N = \l,g,d,p ->
|
|
lin N (mkNounByGendDeclPal l g d p) ;
|
|
} ;
|
|
|
|
mkPN = overload {
|
|
mkN : (lemma : Str) -> PN = \l -> lin PN (mkProperNoun l Sg) ;
|
|
mkN : (lemma : Str) -> Number -> PN = \l,n -> lin PN (mkProperNoun l n) ;
|
|
} ;
|
|
|
|
mkN2 = overload {
|
|
mkN2 : N -> ResLav.Prep -> N2 = \n,p -> lin N2 n ** { p = p ; isPre = True } ;
|
|
mkN2 : N -> ResLav.Prep -> Bool -> N2 = \n,p,isPre -> lin N2 n ** { p = p ; isPre = isPre } ;
|
|
} ;
|
|
|
|
mkN3 : N -> ResLav.Prep -> ResLav.Prep -> N3 = \n,p1,p2 ->
|
|
lin N3 n ** { p1 = p1 ; p2 = p2 ; isPre1 = False ; isPre2 = False } ;
|
|
|
|
mkA = overload {
|
|
mkA : (lemma : Str) -> A = \s -> lin A (mkAdjective s) ;
|
|
mkA : (lemma : Str) -> AdjType -> A = \s,t -> lin A (mkAdjectiveByType s t) ;
|
|
-- TODO: nav forši, ka jānorāda PartType, bet kā lai aptiet?
|
|
-- TODO: drīzāk jānorāda Str (divdabja forma) + PartType - pārējais iekšēji (auto)
|
|
-- Turklāt Adj f-cijā iespējams būtu ok, ja pa tiešo izsauktu mkAdjective?!
|
|
-- Tomēr diez vai: IsUsi...
|
|
-- mkA2 gadījumā: vai PartType var noteikt pēc obj_Prep? Diez vai...
|
|
mkA : (v : Verb) -> PartType -> A = \v,p -> lin A (mkAdjective_Participle v p) ;
|
|
} ;
|
|
|
|
mkA2 : A -> ResLav.Prep -> A2 = \a,p -> lin A2 (a ** { p = p }) ; -- precējies ar ...
|
|
mkAS : A -> AS =\a -> lin A a ;
|
|
mkA2S : A -> ResLav.Prep -> A2S =\a,p -> lin A2 (a ** { p = p }) ;
|
|
mkAV : A -> AV = \a -> lin A a ;
|
|
mkA2V : A -> ResLav.Prep -> A2V = \a,p -> lin A2 (a ** { p = p }) ;
|
|
|
|
AS, AV : Type = { s : AForm => Str } ;
|
|
A2S, A2V : Type = { s : AForm => Str ; p : ResLav.Prep };
|
|
|
|
mkV = overload {
|
|
mkV : (lemma : Str) -> V = \l -> lin V (mkVerb_Irreg l) ;
|
|
mkV : (lemma : Str) -> VerbConj -> V = \l,c -> lin V (mkVerb l c) ;
|
|
mkV : (lemma : Str) -> Str -> Str -> V = \l1,l2,l3 -> lin V (mkVerbC1 l1 l2 l3) ;
|
|
} ;
|
|
|
|
mkV2 = overload {
|
|
mkV2 : V -> ResLav.Prep -> V2 = \v,p -> lin V2 v ** { p = p ; topic = Nom } ;
|
|
mkV2 : V -> ResLav.Prep -> Case -> V2 = \v,p,c -> lin V2 v ** { p = p ; topic = c } ;
|
|
} ;
|
|
|
|
mkVS = overload {
|
|
mkVS : V -> Subj -> VS = \v,s -> lin VS v ** { subj = s ; topic = Nom } ;
|
|
mkVS : V -> Subj -> Case -> VS = \v,s,c -> lin VS v ** { subj = s ; topic = c } ;
|
|
} ;
|
|
|
|
mkVQ = overload {
|
|
mkVQ : V -> VQ = \v -> lin VQ v ** { topic = Nom } ;
|
|
mkVQ : V -> Case -> VQ = \v,c -> lin VQ v ** { topic = c } ;
|
|
} ;
|
|
|
|
mkVV = overload {
|
|
mkVV : V -> VV = \v -> lin VV v ** { topic = Nom } ;
|
|
mkVV : V -> Case -> VV = \v,c -> lin VV v ** { topic = c } ;
|
|
} ;
|
|
|
|
mkV3 = overload {
|
|
mkV3 : V -> ResLav.Prep -> ResLav.Prep -> V3 = \v,p1,p2 ->
|
|
lin V3 v ** { p1 = p1 ; p2 = p2 ; topic = Nom } ;
|
|
mkV3 : V -> ResLav.Prep -> ResLav.Prep -> Case -> V3 = \v,p1,p2,c ->
|
|
lin V3 v ** { p1 = p1 ; p2 = p2 ; topic = c } ;
|
|
} ;
|
|
|
|
mkVA : V -> VA = \v -> lin VA v ;
|
|
|
|
mkV2S : V -> ResLav.Prep -> Subj -> V2S = \v,p,s -> lin V2S v ** { p = p ; subj = s } ;
|
|
mkV2A : V -> ResLav.Prep -> V2A = \v,p -> lin V2A v ** { p = p } ;
|
|
mkV2Q : V -> ResLav.Prep -> V2Q = \v,p -> lin V2Q v ** { p = p } ;
|
|
mkV2V : V -> ResLav.Prep -> V2V = \v,p -> lin V2V v ** { p = p } ;
|
|
|
|
mkCAdv : Str -> Str -> Degree -> CAdv = \s,p,d -> { s = s ; p = p ; d = d ; lock_CAdv = <> } ;
|
|
|
|
mkPrep = overload {
|
|
mkPrep : Str -> Case -> Case -> ResLav.Prep = \prep,sg,pl ->
|
|
lin Prep { s = prep ; c = table { Sg => sg ; Pl => pl } } ;
|
|
mkPrep : Case -> ResLav.Prep = \c -> lin Prep { s = [] ; c = table { _ => c } } ;
|
|
} ;
|
|
|
|
-- empty fake prepositions for valences
|
|
-- rections that are expressed by simple cases without any prepositions
|
|
nom_Prep = mkPrep Nom ;
|
|
gen_Prep = mkPrep Gen ;
|
|
dat_Prep = mkPrep Dat ;
|
|
acc_Prep = mkPrep Acc ;
|
|
loc_Prep = mkPrep Loc ;
|
|
|
|
mkAdv : Str -> Adv = \x -> lin Adv (ss x) ;
|
|
mkAdV : Str -> AdV = \x -> lin AdV (ss x) ;
|
|
mkAdA : Str -> AdA = \x -> lin AdA (ss x) ;
|
|
mkAdN : Str -> AdN = \x -> lin AdN (ss x) ;
|
|
|
|
mkConj = overload {
|
|
mkConj : Str -> Conj = \y -> mk2Conj [] y Pl ;
|
|
mkConj : Str -> Number -> Conj = \y,n -> mk2Conj [] y n ;
|
|
mkConj : Str -> Str -> Conj = \x,y -> mk2Conj x y Pl ;
|
|
mkConj : Str -> Str -> Number -> Conj = mk2Conj ;
|
|
} ;
|
|
|
|
mk2Conj : Str -> Str -> Number -> Conj = \x,y,n -> lin Conj (sd2 x y ** { n = n }) ;
|
|
|
|
viens = mkNumSpec "viens" "pirmais" "vien" "" Sg ;
|
|
|
|
mkNumReg : Str -> Str -> Number -> { s : DForm => CardOrd => Gender => Case => Str } =
|
|
\pieci,piektais,n -> mkNumSpec pieci piektais (cutStem pieci) (cutStem pieci) n ;
|
|
|
|
mkNumSpec : Str -> Str -> Str -> Str -> Number -> { s : DForm => CardOrd => Gender => Case => Str } =
|
|
\pieci,piektais,stem_teen,stem_ten,n ->
|
|
let
|
|
masc = mkNoun_D1 pieci ;
|
|
fem = mkNoun_D4 pieci Fem ;
|
|
ord = mkAdjective_Pos piektais Def ;
|
|
padsmit = mkAdjective_Pos (stem_teen+"padsmitais") Def ;
|
|
desmit = mkAdjective_Pos (stem_ten+"desmitais") Def ;
|
|
in {
|
|
s = table {
|
|
unit => table {
|
|
NCard => table {
|
|
Masc => table { c => masc.s ! n ! c } ;
|
|
Fem => table { c => fem.s ! n ! c }
|
|
} ;
|
|
NOrd => table {
|
|
-- FIXME: pazaudējam kārtas skaitļu daudzskaitli - 'mēs palikām piektie'
|
|
g => table { c => ord ! g ! Sg ! c }
|
|
}
|
|
} ;
|
|
teen => table {
|
|
NCard => table { g => table { c => stem_teen + "padsmit" } } ;
|
|
NOrd => table { g => table { c => padsmit ! g ! Sg ! c } }
|
|
} ;
|
|
ten => table {
|
|
NCard => table { g => table { c => stem_ten + "desmit" } } ;
|
|
NOrd => table { g => table { c => desmit ! g ! Sg ! c } }
|
|
}
|
|
}
|
|
} ;
|
|
|
|
simts : CardOrd => Gender => Number => Case => Str =
|
|
let
|
|
card = mkNoun_D1 "simts" ;
|
|
ord = mkAdjective_Pos "simtais" Def ;
|
|
in table {
|
|
NCard => table {
|
|
_ => table { n => table { c => card.s ! n ! c } }
|
|
} ;
|
|
NOrd => table {
|
|
g => table { n => table { c => ord ! g ! n ! c } }
|
|
}
|
|
} ;
|
|
|
|
tuukstotis : CardOrd => Gender => Number => Case => Str =
|
|
let
|
|
card = mkNoun_D2 "tūkstotis" True ;
|
|
ord = mkAdjective_Pos "tūkstošais" Def ;
|
|
in table {
|
|
NCard => table {
|
|
_ => table { n => table { c => card.s ! n ! c } }
|
|
} ;
|
|
NOrd => table {
|
|
g => table { n => table { c => ord ! g ! n ! c } }
|
|
}
|
|
} ;
|
|
|
|
}
|