msyds/gf-core
1
0
Fork 0
forked from GitHub/gf-core
Code Pull Requests Activity

more lindef and linref definitions in CatEng.gf

Browse Source
This commit is contained in:
kr.angelov
2013-10-30 15:23:09 +00:00
parent fefee01588
commit e50e0de6a1
1 changed files with 22 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
lib/src/english/CatEng.gf
View File

@@ -106,7 +106,11 @@ concrete CatEng of Cat = CommonX - [Pol] ** open ResEng, Prelude in {
PN = {s : Case => Str ; g : Gender} ; PN = {s : Case => Str ; g : Gender} ;
lindef lindef
SSlash = \s -> {s = s; c2 = ""} ;
ClSlash = \s -> {s = \\t,a,p,o => s; c2 = ""} ;
VP = \s -> predV {s = \\_ => s; p = ""; isRefl = True} ; VP = \s -> predV {s = \\_ => s; p = ""; isRefl = True} ;
VPSlash = \s -> predV {s = \\_ => s; p = ""; isRefl = True} ** {c2 = ""; gapInMiddle = False} ;
V, VS, VQ, VA = \s -> {s = \\_ => s; p = ""; isRefl = True} ; V, VS, VQ, VA = \s -> {s = \\_ => s; p = ""; isRefl = True} ;
V2, V2A, V2Q, V2S = \s -> {s = \\_ => s; p = ""; isRefl = True; c2=""} ; V2, V2A, V2Q, V2S = \s -> {s = \\_ => s; p = ""; isRefl = True; c2=""} ;
@@ -122,6 +126,23 @@ concrete CatEng of Cat = CommonX - [Pol] ** open ResEng, Prelude in {
N3 = \s -> {s = \\_,_ => s; c2,c3 = ""; g = Neutr} ; N3 = \s -> {s = \\_,_ => s; c2,c3 = ""; g = Neutr} ;
linref linref
VP = \vp -> infVP VVAux vp Simul CPos (agrP3 Sg) ; SSlash = \ss -> ss.s ++ ss.c2 ;
ClSlash = \cls -> cls.s ! Pres ! Anter ! CPos ! ODir ++ cls.c2 ;
VP = \vp -> infVP VVAux vp Simul CPos (agrP3 Sg) ;
VPSlash = \vps -> infVP VVAux vps Simul CPos (agrP3 Sg) ++ vps.c2;
V, VS, VQ, VA = \v -> infVP VVAux (predV v) Simul CPos (agrP3 Sg);
V2, V2A, V2Q, V2S = \v -> infVP VVAux (predV v) Simul CPos (agrP3 Sg) ++ v.c2;
V3 = \v -> infVP VVAux (predV v) Simul CPos (agrP3 Sg) ++ v.c2 ++ v.c3;
VV = \v -> infVP VVAux (predVV v) Simul CPos (agrP3 Sg) ;
V2V = \v -> infVP VVAux (predVc v) Simul CPos (agrP3 Sg) ;
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 ;
} }