more experiments

gf/MathEng.gf

---# -path=.:../abstract:../common:../api
+--# -path=.:../abstract:../common:../api:../english
 
 concrete MathEng of Math = 
   GrammarEng,

gf/MathLexEng.gf

@@ -13,6 +13,7 @@ lin
   prime_A = regA "prime" ;
   integer_N = regN "integer" ;
   call_V2 = dirV2 (regV "call") ;
+--  lin call_V2 = mkV2 (mkV "call" "calls" "called" "called" "calling");
   iff_Subj = mkSubj "iff";
   three_PN = mkPN (mkN nonhuman (mkN "three")) ;
   -- for the Math Grammar

gf/note.tex

@@ -162,7 +162,8 @@ or something logically equivalent.
 We have started a grammar \lstinline|Math.gf|/\lstinline|MathEng.gf| which can partially
 do that. They add \lstinline|MathLex.gf| and \lstinline|MathLexEng.gf| in
 Figure~\ref{fig:mathlex} to the grammars \lstinline|Lang.gf|/\lstinline|LangEng.gf| from
-the GF distribution.
+the GF distribution. \lstinline|test.gfs| contains a list of test phrases that can already
+be parsed. 
 
 \begin{figure}[ht]\centering\small
 \begin{tabular}{|p{5cm}|p{9.5cm}|}\hline

gf/test.gfs

 i MathEng.gf
-p -cat=NP "a positive integer"
-p -cat=NP "We call a positive integer a prime integer"
+p -cat=NP "a positive integer $n$"
+p -cat=NP "We call a positive integer a prime number"