added romance in next-resource ; some French determiners and definite articles in other languages to revisit

lib/next-resource/romance/NounRomance.gf

@@ -0,0 +1,196 @@
+incomplete concrete NounRomance of Noun =
+   CatRomance ** open CommonRomance, ResRomance, Prelude in {
+
+  flags optimize=all_subs ;
+
+  lin
+    DetCN det cn = 
+      let 
+        g = cn.g ;
+        n = det.n
+      in {
+        s = \\c => let cs = npform2case c in 
+              det.s ! g ! cs ++ cn.s ! n ++ det.s2 ;
+        a = agrP3 g n ;
+        hasClit = False
+        } ;
+
+    UsePN = pn2np ;
+
+    UsePron p = p ;
+
+    PredetNP pred np = {
+      s = \\c => pred.s ! aagr (np.a.g) (np.a.n) ! npform2case c ++  --- subtype
+                 np.s ! case2npform pred.c ;
+      a = np.a ;
+      hasClit = False
+      } ;
+
+    PPartNP np v2 = {
+      s = \\c => np.s ! c ++ v2.s ! VPart np.a.g np.a.n ;
+      a = np.a ;
+      hasClit = False
+      } ;
+
+    RelNP np rs = {
+      s = \\c => np.s ! c ++ rs.s ! Indic ! np.a ;
+      a = np.a ;
+      hasClit = False
+      } ;
+
+    AdvNP np adv = {
+      s = \\c => np.s ! c ++ adv.s ;
+      a = np.a ;
+      hasClit = False
+      } ;
+
+    DetQuantOrd quant num ord = {
+      s,sp = \\g,c => quant.s ! num.isNum ! num.n ! g ! c ++ num.s ! g ++ 
+                   ord.s ! aagr g num.n ;
+      s2 = quant.s2 ;
+      n = num.n
+      } ;
+
+    DetQuant quant num = {
+      s  = \\g,c => quant.s ! num.isNum ! num.n ! g ! c ++ num.s ! g ; 
+      sp = \\g,c => case num.isNum of {
+        True  => quant.s ! True ! num.n ! g ! c ++ num.s ! g ; 
+        False => quant.sp ! num.n ! g ! c ++ num.s ! g
+        } ; 
+      s2 = quant.s2 ;
+      n  = num.n
+      } ;
+
+    DetNP det = 
+      let 
+        g = Masc ;  ---- Fem in Extra
+        n = det.n
+      in {
+        s = \\c => let cs = npform2case c in 
+              det.sp ! g ! cs ;
+        a = agrP3 g n ;
+        hasClit = False
+        } ;
+
+    PossPron p = {
+      s = \\_,n,g,c => possCase g n c ++ p.s ! Poss (aagr g n) ; ---- il mio!
+      sp = \\ n,g,c => possCase g n c ++ p.s ! Poss (aagr g n) ; ---- not for Fre
+      s2 = []
+      } ;
+
+    NumSg = {s = \\_ => [] ; isNum = False ; n = Sg} ;
+    NumPl = {s = \\_ => [] ; isNum = False ; n = Pl} ;
+
+    NumCard n = n ** {isNum = True} ;
+
+    NumDigits nu = {s = \\g => nu.s ! NCard g ; n = nu.n} ;
+    OrdDigits nu = {s = \\a => nu.s ! NOrd a.g a.n} ;
+
+    NumNumeral nu = {s = \\g => nu.s ! NCard g ; n = nu.n} ;
+    OrdNumeral nu = {s = \\a => nu.s ! NOrd a.g a.n} ;
+
+    AdNum adn num = {s = \\a => adn.s ++ num.s ! a ; isNum = num.isNum ; n = num.n} ;
+
+    OrdSuperl adj = {s = \\a => adj.s ! Superl ! AF a.g a.n} ;
+
+{-
+    DetArtSg det cn = 
+      let 
+        g = cn.g ;
+        n = Sg
+      in {
+        s = \\c => let cs = npform2case c in 
+              det.s ! False ! n ! g ! cs ++ cn.s ! n ;
+        a = agrP3 g n ;
+        hasClit = False
+        } ;
+
+    DetArtPl det cn = 
+      let 
+        g = cn.g ;
+        n = Pl
+      in {
+        s = \\c => let cs = npform2case c in 
+              det.s ! False ! n ! g ! cs ++ cn.s ! n ;
+        a = agrP3 g n ;
+        hasClit = False
+        } ;
+-}
+
+    DefArt = {
+      s = \\_,n,g,c => artDef g n c ;  
+      sp = \\n,g,c => artDef g n c ; ---- not for Fre 
+      s2 = []
+      } ;
+
+    IndefArt = {
+      s = \\b,n,g,c => if_then_Str b [] (artIndef g n c) ;
+      sp = \\n,g,c => artIndef g n c ; ---- not for Fre
+      s2 = []
+      } ;
+
+    MassNP cn = let 
+        g = cn.g ;
+        n = Sg
+      in {
+        s = \\c => partitive g (npform2case c) ++ cn.s ! n ;
+        a = agrP3 g n ;
+        hasClit = False
+        } ;
+
+{---b
+    MassDet = {
+      s = \\b,n,g,c => case <b,n> of {
+        <False,Sg> => partitive g c ;
+        _ => prepCase genitive ----
+        }
+      } ;
+-}
+
+-- This is based on record subtyping.
+
+    UseN, UseN2 = \noun -> noun ;
+---b    UseN3 = \noun -> noun ;
+
+    Use2N3 f = f ;
+
+    Use3N3 f = f ** {c2 = f.c3} ;
+
+    ComplN2 f x = {
+      s = \\n => f.s ! n ++ appCompl f.c2 x.s ;
+      g = f.g ;
+      } ;
+
+    ComplN3 f x = {
+      s = \\n => f.s ! n ++ appCompl f.c2 x.s ;
+      g = f.g ;
+      c2 = f.c3
+      } ;
+
+    AdjCN ap cn = 
+      let 
+        g = cn.g 
+      in {
+        s = \\n => preOrPost ap.isPre (ap.s ! (AF g n)) (cn.s ! n) ;
+        g = g ;
+        } ;
+
+    RelCN cn rs = let g = cn.g in {
+      s = \\n => cn.s ! n ++ rs.s ! Indic ! agrP3 g n ; --- mood
+      g = g
+      } ;
+    SentCN  cn sc = let g = cn.g in {
+      s = \\n => cn.s ! n ++ sc.s ;
+      g = g
+      } ;
+    AdvCN  cn sc = let g = cn.g in {
+      s = \\n => cn.s ! n ++ sc.s ;
+      g = g
+      } ;
+
+    ApposCN  cn np = let g = cn.g in {
+      s = \\n => cn.s ! n ++ np.s ! Ton Nom ;
+      g = g
+      } ;
+
+}