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

added invarA

Browse Source
This commit is contained in:
Krasimir Angelov
2025-08-26 16:30:13 +02:00
parent 3aeb0707f5
commit 512412b4bb
1 changed files with 12 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
src/french/ParadigmsFre.gf
View File

@@ -200,7 +200,7 @@ oper
mkA : (banal,banale,banaux,banalement : Str) -> A ; -- almost worst-case adjective mkA : (banal,banale,banaux,banalement : Str) -> A ; -- almost worst-case adjective
-- This is the worst-case paradigm for the positive forms, used for "vieux/vieil". -- This is the worst-case paradigm for the positive forms, used for "vieux/vieil".
mkA : (vieux,vieil,vieille,vieuxs,vieuxment : Str) -> A ; -- worst-case adjetive mkA : (vieux,vieil,vieille,vieux,vieillement : Str) -> A ; -- worst-case adjetive
-- If comparison forms are irregular (i.e. not formed by "plus", e.g. -- If comparison forms are irregular (i.e. not formed by "plus", e.g.
-- "bon-meilleur"), the positive and comparative can be given as separate -- "bon-meilleur"), the positive and comparative can be given as separate
@@ -468,6 +468,17 @@ oper
prefixA = prefA ; prefixA = prefA ;
invarA : (sud : Str) -> A = \sud -> compADeg {
s = table {
AF _ _ => sud;
AAttrMasc => sud;
AA => case sud of {
_ + "ée" => init sud + "ment" ;
_ => sud + "ment"
}
} ;
} ;
mkAdv x = ss x ** {lock_Adv = <>} ; mkAdv x = ss x ** {lock_Adv = <>} ;
mkAdV x = ss x ** {lock_AdV = <>} ; mkAdV x = ss x ** {lock_AdV = <>} ;
mkAdA x = ss x ** {lock_AdA = <>} ; mkAdA x = ss x ** {lock_AdA = <>} ;