Lines Matching refs:SubGraph
128 SubGraph *p_SubGraph;
130 parseNode( node, p_SubGraph, 1 ); // NB Subgraph pointed to will change in recursive fn.
142 bool GRXMLDoc::parseNode( XMLNode &node, SubGraph *&p_SubGraph, const unsigned int level )
144 // We will create a new subgraph for each rule node.
145 // The "current" subgraph is substituted with the new subgraph for all ops on child nodes.
146 // After processing child nodes the original subgraph is reinstated
167 SubGraph *p_LocalSubGraph;
184 bool GRXMLDoc::beginNode( XMLNode &node, SubGraph *&p_SubGraph, const unsigned int level )
227 // NB This fn creates a new subgraph.
233 // NB This fn creates a new subgraph.
277 bool GRXMLDoc::endNode( XMLNode &node, SubGraph *&p_SubGraph, const unsigned int level )
407 bool GRXMLDoc::beginParseRuleNode( XMLNode &node, SubGraph *&p_SubGraph)
410 // Note: The subGraph may change if there are forward references. This
428 // so swap the placeholder subgraph in.
429 // NB subgraph and rule name are already known to lists.
430 SubGraph *p_ExistingSubgraph;
435 FATAL_ERROR("ERROR! Subgraph without rule name entry found!", -1);
440 SubGraph *newGraph;
461 bool GRXMLDoc::endParseRuleNode( XMLNode &node, SubGraph *&p_SubGraph )
463 // The rule expression has been built as a subgraph and ID added to the rule list.
464 // Finished editing subgraph
484 bool GRXMLDoc::processCDATA( XMLNode &node, SubGraph *&p_SubGraph )
555 bool GRXMLDoc::beginItem( XMLNode &node, SubGraph *&p_SubGraph )
586 bool GRXMLDoc::endItem( XMLNode &node, SubGraph *&p_SubGraph )
597 bool GRXMLDoc::beginRuleRef( XMLNode &node, SubGraph *&p_SubGraph )
599 // Extend word FST node with an entire FST subgraph.
629 // Forward reference; create a placeholder subgraph ptr.
630 //SubGraph *newGraph = new SubGraph( (char *) ruleName.c_str() );
632 SubGraph *newGraph;
637 // We will add the subgraph when we have the tag - see endItem().
646 bool GRXMLDoc::endRuleRef(XMLNode &grmNode, SubGraph *&p_SubGraph )
657 bool GRXMLDoc::beginOneOf(XMLNode &grmNode, SubGraph *&p_SubGraph)
665 bool GRXMLDoc::endOneOf(XMLNode &grmNode, SubGraph *&p_SubGraph)
673 bool GRXMLDoc::beginTag( XMLNode &node, SubGraph *&p_SubGraph )
694 bool GRXMLDoc::endTag( XMLNode &node, SubGraph *&p_SubGraph )
701 bool GRXMLDoc::beginCount( XMLNode &node, SubGraph *&p_SubGraph )
715 // not in subgraph but in graph?!
742 bool GRXMLDoc::endCount( XMLNode &node, SubGraph *&p_SubGraph )
813 Extends list of SubGraphs with given subGraph
819 bool GRXMLDoc::addRuleToList(std::string const & ruleName, SubGraph *&p_SubGraph)
831 // Create the new subgraph and update lists
833 p_SubGraph = new SubGraph( (char *) ruleName.c_str(), index );
837 FATAL_ERROR("ERROR! subgraph for " + ruleName + " is already defined!", -1 );
854 SubGraph *p_SubGraph;
863 FATAL_ERROR("No subgraph for rule " + ruleName + "! Mismatched rules and subgraph hashtables!", -1);
873 bool GRXMLDoc::findSubGraph(std::string & s, SubGraph *&p_SubGraph)
893 bool GRXMLDoc::findSubGraphIndex( SubGraph *p_SubGraph, std::string &s )
956 SubGraph *p_SubGraph;
973 void GRXMLDoc::printSubgraph( SubGraph &p_SubGraph )
1133 SubGraph *p_SubGraph;
1134 SubGraph *p_SemGraph;
1142 p_SemGraph = new SubGraph( (char *) "Main", -1);
