add_node/2 | adds a node of TagType to the ParseState. |
add_node/3 | adds a node of TagType to the ParseState. |
add_node/4 | adds a node of TagType to the ParseState. |
new_graph/0 | return a digraph that checks that graph remains acyclical Note : the digraph graph, returned is implemented (in digraph) with a ets table so the returned graph acts as a reference (pointer), rather than a single assignment variable value. |
add_node(ParseState, X2::TagType) -> #parse_state{}
returns: containing the new graph (due to the implementation of digraph this will be the same value - therefore ParseState is simply returned)
adds a node of TagType to the ParseState.
add_node(ParseState, X2::TagType, Conds::DestCond) -> #parse_state{}
returns: containing the new graph (due to the implementation of digraph this will be the same value - therefore ParseState is simply returned)
adds a node of TagType to the ParseState.
add_node(ParseState, X2::TagType, TimeZone::Index, Conds::DestCond) -> #parse_state{}
returns: containing the new graph (due to the implementation of digraph this will be the same value - therefore ParseState is simply returned)
adds a node of TagType to the ParseState.
new_graph() -> term()
returns: digraph
return a digraph that checks that graph remains acyclical Note : the digraph graph, returned is implemented (in digraph) with a ets table so the returned graph acts as a reference (pointer), rather than a single assignment variable value.
Generated by EDoc, Oct 17 2007, 16:48:07.