-/* Validating XML processor for graphxml.dtd.
- * Generated 2006/03/21 13:43:39.
+/* Validating XML processor for xbt/graphxml.dtd.
+ * Generated 2006/07/18 21:02:16.
*
* This program was generated with the FleXML XML processor generator.
- * FleXML is Copyright © 1999-2005 Kristoffer Rose. All rights reserved.
- * (Id: flexml.pl,v 1.47 2006/03/21 11:12:57 legranda Exp).
+ * FleXML is Copyright (C) 1999-2005 Kristoffer Rose. All rights reserved.
+ * FleXML is Copyright (C) 2003-2006 Martin Quinson. All rights reserved.
+ * (Id: flexml.pl,v 1.53 2006/07/18 12:12:06 mquinson Exp).
*
* There are two, intertwined parts to this program, part A and part B.
*
* ------
*
* Some parts, here collectively called "Part A", are found in the
- * FleXML package. They are Copyright © 1999-2005 Kristoffer Rose.
- * All rights reserved.
+ * FleXML package. They are Copyright (C) 1999-2005 Kristoffer Rose
+ * and Copyright (C) 2003-2006 Martin Quinson. All rights reserved.
*
* You can redistribute, use, perform, display and/or modify "Part A"
* provided the following two conditions hold:
/* Version strings. */
const char rcs_graphxml_flexml_skeleton[] =
- "$" "Id: skel,v 1.28 2006/03/21 12:04:13 legranda Exp $";
+ "$" "Id: skel,v 1.31 2006/07/18 18:21:13 mquinson Exp $";
const char rcs_graphxml_flexml[] =
- "$" "Id: flexml.pl,v 1.47 2006/03/21 11:12:57 legranda Exp $";
+ "$" "Id: flexml.pl,v 1.53 2006/07/18 12:12:06 mquinson Exp $";
/* ANSI headers. */
#include <unistd.h>
/* XML processor api. */
/* FleXML-provided data. */
-const char* pcdata;
+const char* graphxml_pcdata;
AT_graphxml_node_name A_graphxml_node_name;
AT_graphxml_edge_source A_graphxml_edge_source;
-AT_graphxml_edge_isDirected A_graphxml_edge_isDirected;
+AT_graphxml_node_position_y A_graphxml_node_position_y;
+AT_graphxml_node_position_x A_graphxml_node_position_x;
+AT_graphxml_edge_data A_graphxml_edge_data;
AT_graphxml_edge_target A_graphxml_edge_target;
+AT_graphxml_graph_isDirected A_graphxml_graph_isDirected;
AT_graphxml_node_label A_graphxml_node_label;
+AT_graphxml_node_data A_graphxml_node_data;
AT_graphxml_edge_label A_graphxml_edge_label;
-AT_graphxml_edge_name A_graphxml_edge_name;
AT_graphxml_edge_length A_graphxml_edge_length;
+AT_graphxml_edge_name A_graphxml_edge_name;
/* XML state. */
#ifdef FLEX_DEBUG
#define CLEANUP cleanup()
/* Text buffer stack handling. */
-char bufferstack[FLEXML_BUFFERSTACKSIZE];
+static char bufferstack[FLEXML_BUFFERSTACKSIZE];
static char* limit = bufferstack + FLEXML_BUFFERSTACKSIZE;
typedef struct BufferLast_s {
- struct BufferLast_s *old; char* saved; char new1[1];
+ struct BufferLast_s *old; const char* saved; char new1[1];
} BufferLast;
#ifdef FLEXML_HasMixed
static BufferLast* last = (BufferLast*)0;
}
#ifdef FLEXML_HasMixed
-static void pushbuffer(char* p)
+static void pushbuffer(const char* p)
{
BufferLast* l = (BufferLast*)next;
assert(next < limit);
last = l;
}
-static char* popbuffer(void)
+static const char* popbuffer(void)
{
BufferLast* l = last;
assert(last != (BufferLast*)0);
/* <!-- Small DTD for xbt graphs. --> */
+ /* isDirected (true|false) "true"
+ * > */
+
<ROOT_graphxml_graph>"<graph"{s} {
+ A_graphxml_graph_isDirected = A_graphxml_graph_isDirected_true;
ENTER(AL_graphxml_graph);
}
<AL_graphxml_graph>{
+ "isDirected"{Eq}"'true'" |
+ "isDirected"{Eq}"\"true\"" A_graphxml_graph_isDirected = A_graphxml_graph_isDirected_true;
+ "isDirected"{Eq}"'false'" |
+ "isDirected"{Eq}"\"false\"" A_graphxml_graph_isDirected = A_graphxml_graph_isDirected_false;
+
">" {
- LEAVE; STag_graphxml_graph();pcdata = NULL; ENTER(S_graphxml_graph);
+ LEAVE; STag_graphxml_graph();graphxml_pcdata = NULL; ENTER(S_graphxml_graph);
}
"/>" {
- LEAVE; STag_graphxml_graph(); pcdata = NULL; ETag_graphxml_graph();
+ LEAVE; STag_graphxml_graph(); graphxml_pcdata = NULL; ETag_graphxml_graph();
switch (YY_START) {
case ROOT_graphxml_graph: SET(EPILOG); break;
}
/* label CDATA ""
* name CDATA #REQUIRED
+ * data CDATA ""
+ * position_x CDATA "-1.0"
+ * position_y CDATA "-1.0"
* > */
<ROOT_graphxml_node,S_graphxml_graph_2,S_graphxml_graph_3,S_graphxml_graph>"<node"{s} {
A_graphxml_node_label = NULL;
A_graphxml_node_name = NULL;
+ A_graphxml_node_data = NULL;
+ A_graphxml_node_position_x = "-1.0";
+ A_graphxml_node_position_y = "-1.0";
ENTER(AL_graphxml_node);
}
"name"{Eq}\' ENTER(VALUE1); BUFFERSET(A_graphxml_node_name);
"name"{Eq}\" ENTER(VALUE2); BUFFERSET(A_graphxml_node_name);
+ "data"{Eq}\' ENTER(VALUE1); BUFFERSET(A_graphxml_node_data);
+ "data"{Eq}\" ENTER(VALUE2); BUFFERSET(A_graphxml_node_data);
+
+ "position_x"{Eq}\' ENTER(VALUE1); BUFFERSET(A_graphxml_node_position_x);
+ "position_x"{Eq}\" ENTER(VALUE2); BUFFERSET(A_graphxml_node_position_x);
+
+ "position_y"{Eq}\' ENTER(VALUE1); BUFFERSET(A_graphxml_node_position_y);
+ "position_y"{Eq}\" ENTER(VALUE2); BUFFERSET(A_graphxml_node_position_y);
+
">" {
if (!A_graphxml_node_name) FAIL("Required attribute `name' not set for `node' element.");
- LEAVE; STag_graphxml_node();pcdata = NULL; ENTER(E_graphxml_node);
+ LEAVE; STag_graphxml_node();graphxml_pcdata = NULL; ENTER(E_graphxml_node);
}
"/>" {
if (!A_graphxml_node_name) FAIL("Required attribute `name' not set for `node' element.");
- LEAVE; STag_graphxml_node(); pcdata = NULL; ETag_graphxml_node();
+ LEAVE; STag_graphxml_node(); graphxml_pcdata = NULL; ETag_graphxml_node();
switch (YY_START) {
case S_graphxml_graph_2: case S_graphxml_graph_3: case S_graphxml_graph: SET(S_graphxml_graph_3); break;
case ROOT_graphxml_node: SET(EPILOG); break;
}
/* label CDATA ""
- * name CDATA #IMPLIED
- * source CDATA #REQUIRED
- * target CDATA #REQUIRED
- * length CDATA "0.0"
- * isDirected (true|false) "true"
+ * name CDATA #IMPLIED
+ * source CDATA #REQUIRED
+ * target CDATA #REQUIRED
+ * length CDATA "-1.0"
+ * data CDATA ""
* > */
<ROOT_graphxml_edge,S_graphxml_graph_1,S_graphxml_graph_3,S_graphxml_graph_5,S_graphxml_graph_4,S_graphxml_graph>"<edge"{s} {
A_graphxml_edge_name = NULL;
A_graphxml_edge_source = NULL;
A_graphxml_edge_target = NULL;
- A_graphxml_edge_length = "0.0";
- A_graphxml_edge_isDirected = A_graphxml_edge_isDirected_true;
+ A_graphxml_edge_length = "-1.0";
+ A_graphxml_edge_data = NULL;
ENTER(AL_graphxml_edge);
}
"length"{Eq}\' ENTER(VALUE1); BUFFERSET(A_graphxml_edge_length);
"length"{Eq}\" ENTER(VALUE2); BUFFERSET(A_graphxml_edge_length);
- "isDirected"{Eq}"'true'" |
- "isDirected"{Eq}"\"true\"" A_graphxml_edge_isDirected = A_graphxml_edge_isDirected_true;
- "isDirected"{Eq}"'false'" |
- "isDirected"{Eq}"\"false\"" A_graphxml_edge_isDirected = A_graphxml_edge_isDirected_false;
+ "data"{Eq}\' ENTER(VALUE1); BUFFERSET(A_graphxml_edge_data);
+ "data"{Eq}\" ENTER(VALUE2); BUFFERSET(A_graphxml_edge_data);
">" {
if (!A_graphxml_edge_source) FAIL("Required attribute `source' not set for `edge' element.");
if (!A_graphxml_edge_target) FAIL("Required attribute `target' not set for `edge' element.");
- LEAVE; STag_graphxml_edge();pcdata = NULL; ENTER(E_graphxml_edge);
+ LEAVE; STag_graphxml_edge();graphxml_pcdata = NULL; ENTER(E_graphxml_edge);
}
"/>" {
if (!A_graphxml_edge_source) FAIL("Required attribute `source' not set for `edge' element.");
if (!A_graphxml_edge_target) FAIL("Required attribute `target' not set for `edge' element.");
- LEAVE; STag_graphxml_edge(); pcdata = NULL; ETag_graphxml_edge();
+ LEAVE; STag_graphxml_edge(); graphxml_pcdata = NULL; ETag_graphxml_edge();
switch (YY_START) {
case S_graphxml_graph_1: case S_graphxml_graph_3: case S_graphxml_graph_5: case S_graphxml_graph_4: case S_graphxml_graph: SET(S_graphxml_graph_5); break;
case ROOT_graphxml_edge: SET(EPILOG); break;
