Add pure C balanced paren test.

r2/libmarpa/test/dev/Makefile.am

@@ -18,8 +18,10 @@
 AM_CFLAGS = $(WARNING_CFLAGS)
 ACLOCAL_AMFLAGS = -I m4
 EXTRA_DIST = README
-noinst_PROGRAMS = testleak
+noinst_PROGRAMS = testleak balanced
 testleak_LDADD = $(LIBOBJS) $(GLIB_LIBS) ../../build/libmarpa.la
 testleak_CFLAGS = $(GLIB_CFLAGS) $(WARNING_CFLAGS) -I../../dist
+balanced_LDADD = $(LIBOBJS) $(GLIB_LIBS) ../../build/libmarpa.la
+balanced_CFLAGS = $(GLIB_CFLAGS) $(WARNING_CFLAGS) -I../../dist
 
 

r2/libmarpa/test/dev/balanced.c

@@ -0,0 +1,171 @@
+/*
+ * Copyright 2011 Jeffrey Kegler
+ * This file is part of Marpa::R2.  Marpa::R2 is free software: you can
+ * redistribute it and/or modify it under the terms of the GNU Lesser
+ * General Public License as published by the Free Software Foundation,
+ * either version 3 of the License, or (at your option) any later version.
+ *
+ * Marpa::R2 is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * Lesser General Public License for more details.
+ *
+ * You should have received a copy of the GNU Lesser
+ * General Public License along with Marpa::R2.  If not, see
+ * http://www.gnu.org/licenses/.
+ */
+
+#include <stdlib.h>
+#include <unistd.h>
+#include <stdio.h>
+#include <glib.h>
+#include "marpa.h"
+
+int main(int argc, char **argv)
+{
+  int pass;
+  int string_length = 1000;
+    GArray *terminals_expected = g_array_new (FALSE, FALSE, sizeof (gint));
+  /* This was to move gslice area out of the
+     tree of Marpa calls during memory debugging */
+  /* void* dummy = g_slice_alloc(42); */
+  /* g_slice_free1(42, dummy); */
+  if (argc >= 2)
+    {
+      string_length = atoi (argv[1]);
+    }
+  for (pass = 0; pass < 1; pass++)
+    {
+      int i;
+      Marpa_Symbol_ID s_top, s_prefix, s_first_balanced, s_endmark;
+      Marpa_Symbol_ID s_prefix_char, s_balanced;
+      Marpa_Symbol_ID s_lparen, s_rparen;
+      Marpa_Symbol_ID s_balanced_sequence;
+      struct marpa_g *g;
+      struct marpa_r *r;
+      void *result;
+      /* Longest rule is 4 symbols */
+      Marpa_Symbol_ID rhs[4];
+      g = marpa_g_new ();
+      s_top = marpa_symbol_new (g);
+      s_prefix = marpa_symbol_new (g);
+      s_first_balanced = marpa_symbol_new (g);
+      s_endmark = marpa_symbol_new (g);
+      s_prefix_char = marpa_symbol_new (g);
+      s_balanced = marpa_symbol_new (g);
+      s_lparen = marpa_symbol_new (g);
+      s_rparen = marpa_symbol_new (g);
+      s_balanced_sequence = marpa_symbol_new (g);
+      rhs[0] = s_prefix;
+      rhs[1] = s_first_balanced;
+      rhs[2] = s_endmark;
+      marpa_rule_new (g, s_top, rhs, 3);
+      marpa_rule_new (g, s_top, rhs, 2);
+      marpa_sequence_new (g, s_prefix, s_prefix_char, -1, 0, 0);
+      rhs[0] = s_balanced;
+      marpa_rule_new (g, s_first_balanced, rhs, 1);
+      rhs[0] = s_lparen;
+      rhs[1] = s_rparen;
+      marpa_rule_new (g, s_balanced, rhs, 2);
+      rhs[0] = s_lparen;
+      rhs[1] = s_balanced_sequence;
+      rhs[2] = s_rparen;
+      marpa_rule_new (g, s_balanced, rhs, 3);
+      marpa_sequence_new (g, s_balanced_sequence, s_balanced, -1, 1, 0);
+      marpa_symbol_is_terminal_set (g, s_prefix_char, 1);
+      marpa_symbol_is_terminal_set (g, s_lparen, 1);
+      marpa_symbol_is_terminal_set (g, s_rparen, 1);
+      marpa_symbol_is_terminal_set (g, s_endmark, 1);
+      marpa_start_symbol_set (g, s_top);
+      result = marpa_precompute (g);
+      if (!result)
+	{
+	  puts (marpa_g_error (g));
+	  exit (1);
+	}
+      r = marpa_r_new (g);
+      if (!r)
+	{
+	  puts (marpa_r_error (r));
+	  exit (1);
+	}
+      if (!marpa_start_input (r))
+	{
+	  puts (marpa_r_error (r));
+	  exit (1);
+	}
+      for (i = 0; i < 4; i++)
+	{
+	  int status = marpa_alternative (r, a, GINT_TO_POINTER (42), 1);
+	  if (status < 0)
+	    {
+	      printf ("marpa_alternative returned %d: %s", status,
+		      marpa_r_error (r));
+	      exit (1);
+	    }
+	  status = marpa_earleme_complete (r);
+	  if (status < 0)
+	    {
+	      printf ("marpa_earleme_complete returned %d: %s", status,
+		      marpa_r_error (r));
+	      exit (1);
+	    }
+	}
+      for (i = 0; i <= 4; i++)
+	{
+	  int tree_ordinal = 0;
+	  int status = marpa_bocage_new (r, -1, i);
+	  if (status < 0)
+	    {
+	      printf ("marpa_bocage_new returned %d: %s", status,
+		      marpa_r_error (r));
+	      exit (1);
+	    }
+	  while (++tree_ordinal)
+	    {
+	      int val_status;
+	      int tree_status = marpa_tree_new (r);
+	      if (tree_status < -1)
+		{
+		  printf ("marpa_tree_new returned %d: %s", status,
+			  marpa_r_error (r));
+		  exit (1);
+		}
+	      if (tree_status == -1)
+		break;
+	      fprintf (stdout, "Tree #%d for length %d\n", tree_ordinal, i);
+	      val_status = marpa_val_new (r);
+	      if (val_status < 0)
+		{
+		  printf ("marpa_val_new returned %d: %s", status,
+			  marpa_r_error (r));
+		  exit (1);
+		}
+	      while (1)
+		{
+		  Marpa_Event event;
+		  int event_status = marpa_val_event (r, &event);
+		  if (event_status < -1)
+		    {
+		      printf ("marpa_val_event returned %d: %s", status,
+			      marpa_r_error (r));
+		      exit (1);
+		    }
+		  if (event_status == -1)
+		    break;
+		  fprintf (stdout, "Event: %d %d %d %d %d\n",
+			   event.marpa_token_id,
+			   GPOINTER_TO_INT (event.marpa_value),
+			   event.marpa_rule_id,
+			   event.marpa_arg_0, event.marpa_arg_n);
+		}
+	    }
+	  marpa_bocage_free (r);
+	}
+      marpa_r_free (r);
+      marpa_g_free (g);
+      g = NULL;
+    }
+  /* while(1) { putc('.', stderr); sleep(10); } */
+}
+