nondependent versions of Pred grammars, implemented by a functor over the dependent version so that no new concrete syntax code is needed. This is at the moment the grammar of choice for translation: NDTransEng is several times faster than TransEng and even faster than the old TranslateEng. The next step is to make sure that all coverage is preserved; some new coverage is already there.

lib/src/experimental/NDTrans.gf

@@ -0,0 +1,38 @@
+--# -path=.:../translator
+
+abstract NDTrans =
+   RGLBase - [Pol,Tense]
+  ,NDPred
+  ,Dictionary - [Pol,Tense]
+
+              ** {
+flags
+  startcat=Phr;
+  heuristic_search_factor=0.60;
+  meta_prob=1.0e-5;
+  meta_token_prob=1.1965149246222233e-9;
+
+fun
+  LiftV  : V  -> PrV_none ;
+  LiftV2 : V2 -> PrV_np ;
+  LiftVS : VS -> PrV_s ;
+  LiftVQ : VQ -> PrV_q ;
+  LiftVV : VV -> PrV_v ;
+  LiftVA : VA -> PrV_a ;
+  LiftVN : VA -> PrV_n ; ----
+
+  LiftV3  : V3  -> PrV_np_np ;
+  LiftV2S : V2S -> PrV_np_s ;
+  LiftV2Q : V2Q -> PrV_np_q ;
+  LiftV2V : V2V -> PrV_np_v ;
+  LiftV2A : V2A -> PrV_np_a ;
+  LiftV2N : V2A -> PrV_np_n ; ----
+
+  LiftAP  : AP  -> PrAP_none ;
+  LiftCN  : CN  -> PrCN_none ;
+
+  LiftAdv  : Adv  -> PrAdv_none ;
+  LiftAdV  : Adv  -> PrAdv_none ;
+  LiftPrep : Prep -> PrAdv_np ;
+
+}