Files
gf-core/lib/src/scandinavian/CatScand.gf

145 lines
4.6 KiB
Plaintext

incomplete concrete CatScand of Cat =
CommonX -[Tense,Temp] ** open (RS = ResScand), Prelude, CommonScand, (R = ParamX) in {
flags optimize=all_subs ;
coding=utf8 ;
lincat
-- Tensed/Untensed
S = {s : Order => Str} ;
QS = {s : QForm => Str} ;
RS = {s : Agr => RCase => Str ; c : NPForm} ;
SSlash = {s : Order => Str ; n3 : Agr => Str ; c2 : Complement} ;
-- Sentence
Cl = {s : STense => Anteriority => Polarity => Order => Str} ;
ClSlash = {
s : STense => Anteriority => Polarity => Order => Str ;
n3 : Agr => Str ;
c2 : Complement
} ;
Imp = {s : Polarity => Number => Str} ;
-- Question
QCl = {s : STense => Anteriority => Polarity => QForm => Str} ;
IP = {s : NPForm => Str ; g : Gender ; n : Number} ;
IComp = {s : AFormPos => Str} ;
IDet = {s : NGender => Str ; n : Number ; det : DetSpecies} ;
IQuant = {s : Number => NGender => Str ; det : DetSpecies} ;
-- Relative; the case $c$ is for "det" clefts.
RCl = {s : STense => Anteriority => Polarity => Agr => RCase => Str ; c : NPForm} ;
RP = {s : Gender => Number => RCase => Str ; a : RAgr} ;
-- Verb
VP = {
s : Voice => VPForm => {
fin : Str ; -- V1 har ---s1
inf : Str ; -- V2 sagt ---s4
a1 : Polarity => Agr => Str * Str ; -- A1 inte ---s3 själv/själva/självt
-- p1: with infinite "jag har inte älskat dig",
-- p2: without infinite "jag älskar dig inte"
} ;
sp : PartForm => Str ;
n1 : Agr => Str ; -- N2 dig ---s5
n2 : Agr => Str ; -- N2 den där mannen ---s5
a2 : Str ; -- A2 idag ---s6
ext : Str ; -- S-Ext att hon går ---s7
en2,ea2,eext : Bool -- indicate if the field exists
} ;
VPSlash = CommonScand.VP ** {
n3 : Agr => Str ; -- object-control complement
c2 : Complement
} ;
Comp = {s : Agr => Str} ;
-- Adjective
AP = {s : AFormPos => Str ; isPre : Bool} ;
-- Noun
-- The fields $isMod$ and $isDet$, and the boolean parameter of
-- determiners, are a hack (the simples possible we found) that
-- permits treating definite articles "huset - de fem husen - det gamla huset"
-- as $Quant$.
CN = {s : Number => DetSpecies => Case => Str ; g : NGender ; isMod : Bool} ;
NP = {s : NPForm => Str ; a : Agr ; isPron : Bool} ;
Pron = {s : NPForm => Str ; a : Agr} ;
Det = {s,sp : Bool => NGender => Str ; n : Number ; det : DetSpecies} ;
Quant = {s,sp : Number => Bool => Bool => NGender => Str ; det : DetSpecies} ;
Predet = {s : Gender => Number => Str ; p : Str ; a : PredetAgr} ;
Num = {s : NGender => Str ; isDet : Bool ; n : Number} ;
Card = {s : NGender => Str ; n : Number} ;
Ord = {s : Str} ;
DAP = {s : Bool => NGender => Str ; n : Number ; det : DetSpecies} ;
-- Numeral
Numeral = {s : CardOrd => Str ; n : Number} ;
Digits = {s : CardOrd => Str ; n : Number} ;
-- Structural
Conj = {s1,s2 : Str ; n : Number ; isDiscont : Bool} ; -- isDiscont: there is an adverb: antingen vinner jag eller du vinner
Subj = {s : Str} ;
Prep = {s : Str} ;
-- Open lexical classes, e.g. Lexicon
V, VS, VQ, VA = Verb ;
V2, VV, V2Q, V2S, V2A = Verb ** {c2 : Complement} ;
V3, V2V = Verb ** {c2,c3 : Complement} ;
A = Adjective ** {isComp : Bool} ;
-- {s : AForm => Str} ;
A2 = Adjective ** {isComp : Bool ; c2 : Complement} ;
N = Noun ;
-- {s : Number => Species => Case => Str ; g : Gender} ;
N2 = Noun ** {c2 : Complement} ;
N3 = Noun ** {c2,c3 : Complement} ;
PN = {s : Case => Str ; g : Gender} ;
lincat
Temp = {s : Str ; t : STense ; a : Anteriority} ;
Tense = {s : Str ; t : STense} ;
oper
agrUSgP3 : Agr = {g = Utr ; n = Sg ; p = P3} ;
linref
SSlash = \ss -> ss.s ! Main ++ ss.c2.s ++ ss.n3 ! agrUSgP3 ;
ClSlash = \cls -> cls.s ! SPres ! Simul ! Pos ! Main ++ cls.c2.s ++ cls.n3 ! agrUSgP3 ;
VP = \vp -> infVP vp agrUSgP3 ;
VPSlash = \vps -> infVP vps agrUSgP3 ++ vps.c2.s ++ vps.n3 ! agrUSgP3 ;
V, VS, VQ, VA = \v -> infVP (predV v) agrUSgP3 ;
V2, V2A, V2Q, V2S = \v -> infVP (predV v) agrUSgP3 ++ v.c2.s ;
V3 = \v -> infVP (predV v) agrUSgP3 ++ v.c2.s ++ v.c3.s ;
VV = \v -> infVP (predV v) agrUSgP3 ;
V2V = \v -> infVP (predV v) agrUSgP3 ++ v.c2.s ;
Conj = \c -> c.s1 ++ c.s2 ;
{-
A = \a -> a.s ! AAdj Posit Nom ;
A2 = \a -> a.s ! AAdj Posit Nom ++ a.c2 ;
N = \n -> n.s ! Sg ! Nom ;
N2 = \n -> n.s ! Sg ! Nom ++ n.c2 ;
N3 = \n -> n.s ! Sg ! Nom ++ n.c2 ++ n.c3 ;
-}
}