Version 5.0 The LEDA User Manual

void parser.append(const char ∗ key)
appends key to the current path.
void parser.goback( )
removes the last key word from the current path. If the current
path is empty this operation has no effect.
3.3 User Defined Rules
void parser.add graph rule for cur path(gml graph rule f, gml value type t)
adds graph rule f for value type t and for the current path.
void parser.add node rule for cur path(gml node rule f, gml value type t)
adds node rule f for value type t and for the current path.
void parser.add edge rule for cur path(gml edge rule f, gml value type t)
adds edge rule f for value type t and for the current path.
void parser.add graph rule(gml graph rule f, gml value type t, char ∗ key = 0)
adds graph rule f for value type t and path graph.key to
parser, if key is specified. Otherwise, f is added for the current
path.
void parser.add node rule(gml node rule f, gml value type t, char ∗ key = 0)
adds node rule f for path graph.node.key (or the current path,
if no key is specified) and value type t to parser.
void parser.add edge rule(gml edge rule f, gml value type t, char ∗ key = 0)
void parser.add new graph rule(gml graph rule f)
void parser.add new node rule(gml node rule f)
void parser.add new edge rule(gml edge rule f)
adds edge rule f for path graph.edge.key (or the current path,
if no key is specified) and value type t to parser.
adds graph rule f to parser. During parsing f is called whenever
an object o with path graph and type gml list is encountered.
f is called before objects in the list of o are parsed.
adds node rule f for path graph.node and value type gml list
to parser. f is called before objects in the corresponding list
are parsed.
adds edge rule f for path graph.edge and value type gml list
to parser. f is called before objects in the corresponding list
are parsed.