GitHub/gf-core
1
0
Fork 1
mirror of https://github.com/GrammaticalFramework/gf-core.git synced 2026-05-04 08:42:50 -06:00
Code Issues Packages Projects Releases Wiki Activity

Latvian RG: approaching RGL API

Browse Source
This commit is contained in:
normundsg
2011-12-19 06:03:21 +00:00
parent 342ba2e070
commit d00b425206
39 changed files with 1324 additions and 90521 deletions
Download Patch File Download Diff File Expand all files Collapse all files

93
lib/src/latvian/AdjectiveLav.gf
View File

@@ -1,80 +1,39 @@
concrete AdjectiveLav of Adjective = CatLav ** open ResLav, StructuralLav, Prelude in {
flags
--# -path=.:../abstract:../common:../prelude
concrete AdjectiveLav of Adjective = CatLav ** open
ResLav,
StructuralLav,
Prelude
in {
flags
coding = utf8 ;
lin
PositA a = { s = \\d,g,n,c => a.s ! (AAdj Posit d g n c) } ;
ComparA a np = { s = \\d,g,n,c => a.s ! (AAdj Compar d g n c) ++ "par" ++ np.s ! Acc ; } |
{ s = \\d,g,n,c => a.s ! (AAdj Compar d g n c) ++ "nekā" ++ np.s ! Nom ; };
UseComparA a = { s = \\d,g,n,c => a.s ! (AAdj Compar d g n c) } ;
lin
PositA a = { s = \\d,g,n,c => a.s ! (AAdj Posit d g n c) } ;
ComplA2 a np = {
s = \\d,g,n,c => a.s ! (AAdj Posit d g n c) ++ a.p.s ++ np.s ! (a.p.c ! (fromAgr np.a).n) ;
} ;
ReflA2 a = {
s = \\d,g,n,c => a.s ! (AAdj Posit d g n c) ++ a.p.s ++ reflPron ! (a.p.c ! n) ;
} ;
ComparA a np = { s = \\d,g,n,c => a.s ! (AAdj Compar d g n c) ++ "par" ++ np.s ! Acc } |
{ s = \\d,g,n,c => a.s ! (AAdj Compar d g n c) ++ "nekā" ++ np.s ! Nom } ;
AdAP ada ap = { s = \\d,g,n,c => ada.s ++ ap.s ! d ! g ! n ! c ; } ;
SentAP ap sc = { --FIXME - te vajag apstākļa vārdu nevis īpašības vārdu! Kuru nevar normāli no AP dabūt
s = \\d,g,n,c => ap.s ! d ! g ! n ! c ++ "," ++ sc.s ;
} ;
UseComparA a = { s = \\d,g,n,c => a.s ! (AAdj Compar d g n c) } ;
AdjOrd ord = {
s = \\d,g,n,c => ord.s ! g ! c ; --FIXME - skaitļa agreement? noteiktība?
} ;
ComplA2 a np = {
s = \\d,g,n,c => a.s ! (AAdj Posit d g n c) ++ a.p.s ++ np.s ! (a.p.c ! (fromAgr np.a).n)
} ;
CAdvAP cadv ap np = {
s = \\d,g,n,c => cadv.s ++ ap.s ! d ! g ! n ! c ++ cadv.p ++ np.s ! Nom ; --TODO nominatīvs var ne vienmēr būt, pie tā CAdv jāliek parametrs par locījumu
} ;
ReflA2 a = { s = \\d,g,n,c => a.s ! (AAdj Posit d g n c) ++ a.p.s ++ reflPron ! (a.p.c ! n) } ;
UseA2 a = {
s = \\d,g,n,c => a.s ! (AAdj Posit d g n c) ;
} ;
{-
PositA a = {
s = \\_ => a.s ! AAdj Posit Nom ;
isPre = True
} ;
ComparA a np = {
s = \\_ => a.s ! AAdj Compar Nom ++ "than" ++ np.s ! Nom ;
isPre = False
} ;
UseComparA a = {
s = \\_ => a.s ! AAdj Compar Nom ;
isPre = True
} ;
AdAP ada ap = { s = \\d,g,n,c => ada.s ++ ap.s ! d ! g ! n ! c } ;
AdjOrd ord = {
s = \\_ => ord.s ! Nom ;
isPre = True
} ;
-- FIXME: te vajag apstākļa vārdu nevis īpašības vārdu! bet apst.v. nevar normāli no AP dabūt
SentAP ap sc = { s = \\d,g,n,c => ap.s ! d ! g ! n ! c ++ "," ++ sc.s } ;
CAdvAP ad ap np = {
s = \\a => ad.s ++ ap.s ! a ++ ad.p ++ np.s ! Nom ;
isPre = False
} ;
-- FIXME: skaitļa agreement? noteiktība?
AdjOrd ord = { s = \\d,g,n,c => ord.s ! g ! c } ;
ComplA2 a np = {
s = \\_ => a.s ! AAdj Posit Nom ++ a.c2 ++ np.s ! Acc ;
isPre = False
} ;
--TODO: nominatīvs var ne vienmēr būt, pie CAdv jāliek parametrs par locījumu
CAdvAP cadv ap np = { s = \\d,g,n,c => cadv.s ++ ap.s ! d ! g ! n ! c ++ cadv.p ++ np.s ! Nom } ;
ReflA2 a = {
s = \\ag => a.s ! AAdj Posit Nom ++ a.c2 ++ reflPron ! ag ;
isPre = False
} ;
UseA2 a = { s = \\d,g,n,c => a.s ! (AAdj Posit d g n c) } ;
AdAP ada ap = {
s = \\a => ada.s ++ ap.s ! a ;
isPre = ap.isPre
} ;
UseA2 a = {
s = \\_ => a.s ! AAdj Posit Nom ;
isPre = True
} ;
-}
}