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

make Romanian compilable for present, and Bronzeage for most languages

Browse Source
This commit is contained in:
aarne
2009-09-15 15:27:42 +00:00
parent 199bb93f35
commit 370bdc57fe
4 changed files with 26 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/Make.hs
View File

@@ -54,13 +54,13 @@ langsCoding = [
langs = map fst langsCoding
-- languagues for which to compile Lang
langsLang = langs `except` ["Ara","Pol","Ron","Tur"]
langsLang = langs `except` ["Pol","Tur"]
-- languages for which to compile Try
langsAPI = langsLang `except` ["Bul","Hin","Ina","Lat","Rus","Tha"]
langsAPI = langsLang `except` ["Ara","Bul","Hin","Ina","Lat","Rus","Tha"]
-- languages for which to compile minimal Syntax
langsMinimal = langs `only` ["Eng","Bul","Ger","Ita"]
langsMinimal = langs `only` ["Ara","Eng","Bul","Rus"]
-- languages for which to run treebank test
langsTest = langsLang `except` ["Ara","Bul","Cat","Hin","Rus","Spa","Tha"]

5
src/api/SymbolicRon.gf Normal file
View File

@@ -0,0 +1,5 @@
--# -path=.:present:mathematical:prelude
resource SymbolicRon = {} -- Symbolic with
-- (Symbol = SymbolRon),
-- (Grammar = GrammarRon) ;

14
src/api/TryRon.gf
View File

@@ -1,22 +1,22 @@
--# -path=.:alltenses:prelude
resource TryRon = SyntaxRon-[mkAdN], LexiconRon, ParadigmsRon - [mkAdv,mkAdN,mkOrd] **
resource TryRon = SyntaxRon-[mkAdN], LexiconRon, ParadigmsRon - [mkAdv,mkAdN,mkOrd,mkDet,mkNP] **
open (P = ParadigmsRon) in {
oper
mkAdv = overload SyntaxEng {
mkAdv = overload SyntaxRon {
mkAdv : Str -> Adv = P.mkAdv ;
} ;
mkAdN = overload {
mkAdN : CAdv -> AdN = SyntaxEng.mkAdN ;
mkAdN : Str -> AdN = P.mkAdN ;
mkAdN : CAdv -> AdN = SyntaxRon.mkAdN ;
-- mkAdN : Str -> AdN = P.mkAdN ;
} ;
mkOrd = overload SyntaxEng {
mkOrd : Str -> Ord = P.mkOrd ;
} ;
-- mkOrd = overload SyntaxRon {
-- mkOrd : Str -> Ord = P.mkOrd ;
-- } ;
}

21
src/romanian/ResRon.gf
View File

@@ -189,13 +189,14 @@ oper
in {
s = table {
VPFinite tm Simul => case tm of
{VPres Indic => vf "" (\a -> verb ! Indi Presn a.n a.p) ;
VPres Conjunct => vf "sã" (\a -> verb ! Subjo SPres a.n a.p) ;
VImperff => vf "" (\a -> verb ! Indi Imparf a.n a.p) ;
VPasse Indic => vf "" (\a -> pComp ! a.n ! a.p ++ verb ! PPasse Masc Sg Indef ANomAcc) ;
VPasse Conjunct => vf "sã" (\a -> copula.s! Inf ++ verb ! PPasse Masc Sg Indef ANomAcc) ;
VFut => vf "" (\a -> pFut ! a.n ! a.p ++ verb ! Inf) ;
VCondit => vf "" (\a -> pCond ! a.n ! a.p ++ verb ! Inf)
{
VPres Indic => vf "" (\a -> verb ! Indi Presn a.n a.p) ;
VPres Conjunct => vf "sã" (\a -> verb ! Subjo SPres a.n a.p) ;
VImperff => vf "" (\a -> verb ! Indi Imparf a.n a.p) ;
VPasse Indic => vf "" (\a -> pComp ! a.n ! a.p ++ verb ! PPasse Masc Sg Indef ANomAcc) ;
VPasse Conjunct => vf "sã" (\a -> copula.s! Inf ++ verb ! PPasse Masc Sg Indef ANomAcc) ;
VFut => vf "" (\a -> pFut ! a.n ! a.p ++ verb ! Inf) ;
VCondit => vf "" (\a -> pCond ! a.n ! a.p ++ verb ! Inf)
} ;
VPFinite tm Anter => case tm of
{VPres Indic => vf "" (\a -> pComp ! a.n ! a.p ++ verb ! PPasse Masc Sg Indef ANomAcc) ;
@@ -483,9 +484,9 @@ oper
RCond => VCondit ;
RPres => VPres m
} ;
cmp = case <t,a,m> of
{<RPast,Simul,Indic> | <RPres, Anter,Indic> => True ;
<RCond, _, _> => True;
cmp = case <<t,a,m> : RTense * Anteriority * Mood> of {
<RPast,Simul,Indic> | <RPres, Anter,Indic> => True ; --# notpresent
<RCond, _, _> => True; --# notpresent
_ => False
} ;
vp = useVP vpr ;