The files for GrammarGer and AllGer (but not Construction, Documentation, Markup)

are edited to allow for glued Prep+DefArt, using new categories NP',Det',Quant',
Predet',DAP'.

The previous NP.s : Case => Str*Str allows parsing

   "in dem Meer" = in_Prep ++ (np.s ! Case).p1
   "im Meer"     = in_Prep ++ (np.s ! Case).p2,

but since only one of the strings of (np.s!Case) is used, the tree
contains a metavariable like ?2 (the grammar is "erasing"). (Similarly, if we used
NP.s : Case => Str and NP.s2 : Case => Str.)

To get rid of the metavariables, we have to choose BY A PARAMETER, say

    NP.s : droppedDefArt? => Case => Str

Using np.a = Ag g n p, the preposition can select between preposition
alone or preposition with definite article (glued or not), via

    Prep = {s : GenNum => Str ; s2 :Str ; c : Case ; isPrep : PrepType }

The combination is done in appPrepNP' and appPrep'. This is
independent of the number of glued Prep+DefArt. But LangGer compiles
now in 200s using 30% memory (without SlashV2VNP). Can AppPrepNP' (and
insertObjNP') be simplified?

src/german/AdjectiveGer.gf

@@ -11,7 +11,7 @@ concrete AdjectiveGer of Adjective' = CatGer ** open ResGer, Prelude in {
       ext = []
       } ;
     ComparA a np =
-      let nps = (np.s ! Nom).p1 ++ (np.s ! Nom).p2 ++ bigNP' np 
+      let nps = np.s ! False ! Nom ++ bigNP' np
       in {
       s = \\af => a.s ! Compar ! af ++ conjThan ++ nps ;
       isPre = True ;
@@ -19,7 +19,7 @@ concrete AdjectiveGer of Adjective' = CatGer ** open ResGer, Prelude in {
       ext = []
       } ;
     CAdvAP ad ap np =
-      let nps = (np.s ! Nom).p1 ++ (np.s ! Nom).p2 ++ bigNP' np in 
+      let nps = np.s ! False ! Nom ++ bigNP' np in
       ap ** {
       s = \\af => ad.s ++ ap.s ! af ++ ad.p ++ nps ;
       isPre = False