example based also with treebank, with real term parser

src/GF/Source/GrammarToSource.hs

@@ -35,7 +35,9 @@ trGrammar (MGrammar ms) = P.Gr (map trModule ms) -- no includes
 trModule :: (Ident,SourceModInfo) -> P.ModDef
 trModule (i,mo) = case mo of
   ModMod m -> P.MModule compl typ body where
-    compl = P.CMCompl -- always complete module
+    compl = case mstatus m of
+      MSIncomplete -> P.CMIncompl
+      _ -> P.CMCompl
     i' = tri i
     typ = case typeOfModule mo of
       MTResource -> P.MTResource i'
@@ -140,6 +142,7 @@ trt trm = case trm of
     Prod x a b | isWildIdent x -> P.EProd (P.DExp (trt a)) (trt b)
     Prod x a b -> P.EProd (P.DDec [trb x] (trt a)) (trt b)
 
+    Example t s -> P.EExample (trt t) s
     R [] -> P.ETuple [] --- to get correct parsing when read back
     R r -> P.ERecord $ map trAssign r
     RecType r -> P.ERecord $ map trLabelling r

src/GF/Source/SourceToGrammar.hs

@@ -437,6 +437,7 @@ transExp x = case x of
   EExtend exp0 exp  -> liftM2 G.ExtR (transExp exp0) (transExp exp)
   EAbstr binds exp  -> liftM2 M.mkAbs (mapM transBind binds) (transExp exp)
   ETyped exp0 exp   -> liftM2 G.Typed (transExp exp0) (transExp exp)
+  EExample exp str  -> liftM2 G.Example (transExp exp) (return str)
 
   EProd decl exp    -> liftM2 M.mkProdSimple (transDecl decl) (transExp exp)
   ETType exp0 exp   -> liftM2 G.Table (transExp exp0) (transExp exp)