more test/srg to examples/test/srg

examples/test/srg/cyclic-direct/cyclic-direct.gf

@@ -0,0 +1,7 @@
+cat S;
+
+fun f : S -> S ;
+fun g : S ;
+
+lin f s = { s = s.s } ;
+lin g = { s = "g" } ;

examples/test/srg/cyclic-empty-prod/cyclic-empty-prod.gf

@@ -0,0 +1,9 @@
+cat S; E; 
+
+fun s : S ;
+fun es : E -> S -> S ;
+fun e : E ;
+
+lin s  = { s = "s" } ;
+lin es e s = { s = e.s ++ s.s } ;
+lin e = { s = [] } ;

examples/test/srg/cyclic-indirect/cyclic-indirect.gf

@@ -0,0 +1,11 @@
+-- a grammar with an indirect cycle
+
+cat S; G;
+
+fun f : S ;
+fun fg : G -> S ;
+fun gf : S -> G ;
+
+lin f  = { s = "f" } ;
+lin fg x = x;
+lin gf x = x;

examples/test/srg/lc_lr-empty-category/lc_lr-empty-category.gf

@@ -0,0 +1,9 @@
+cat S; E; 
+
+fun f : E -> S ;
+fun g : S -> S ;
+fun e : E ;
+
+lin f e = { s = e.s } ;
+lin g s = { s = s.s ++ "x" } ;
+lin e = { s = "e" } ;

examples/test/srg/left-recursive/left-recursive.gf

@@ -0,0 +1,7 @@
+cat S;
+
+fun f : S -> S ; 
+    g : S ;
+
+lin f x = { s = x.s ++ "f" } ;
+    g = { s = "s" } ;

examples/test/srg/variants-ebnf/variants-ebnf.gf

@@ -0,0 +1,4 @@
+cat S;
+fun f : S;
+
+lin f = { s = variants {"a"; "b"} ++ variants {"c"; "d"} ++ variants {"e"; "f"} ++ variants { "g";"h";} } ;