src/English/parse/en_LanguageSpecificFunctions.cpp
// assign premods, head, and postmod to node, given kids of size size.
// links the premods and postmods too. Overwrites any previous info in node
// kids is assumed to be in normal order:
// first premod...last premod, head, first postmod...last postmod

assign premods, head, and postmod to node, given kids of size size.
links the premods and postmods too. Overwrites any previous info in node
kids is assumed to be in normal order:
first premod...last premod, head, first postmod...last postmod
assign premods head and postmod to node given kids of size size . links the premods and postmods too . Overwrites any previous info in node kids is assumed to be in normal order : first premod ... last premod head first postmod ... last postmod
void EnglishLanguageSpecificFunctions::_fillNPFromVector(ParseNode* node, ParseNode* kids[], int size) {
	int head = findNPHead(kids, size);
	int i;
	for (i = head-1; i >0; i--)
		kids[i]->next = kids[i-1];
	kids[0]->next = 0;
	kids[head]->next = 0;
	for (i = head+1; i < size-1; i++)
		kids[i]->next = kids[i+1];
	kids[size-1]->next = 0;
	if (head-1 >= 0)
		node->premods = kids[head-1];
	else
		node->premods = 0;
	node->headNode = kids[head];
	if (head+1 < size)
		node->postmods = kids[head+1];
	else
		node->postmods = 0;
}
void EnglishLanguageSpecificFunctions :: _fillNPFromVector ( ParseNode * node , ParseNode * kids [ ] , int size ) { int head = findNPHead ( kids , size ) ; int i ; for ( i = head - 1 ; i > 0 ; i -- ) kids [ i ] -> next = kids [ i - 1 ] ; kids [ 0 ] -> next = 0 ; kids [ head ] -> next = 0 ; for ( i = head + 1 ; i < size - 1 ; i ++ ) kids [ i ] -> next = kids [ i + 1 ] ; kids [ size - 1 ] -> next = 0 ; if ( head - 1 >= 0 ) node -> premods = kids [ head - 1 ] ; else node -> premods = 0 ; node -> headNode = kids [ head ] ; if ( head + 1 < size ) node -> postmods = kids [ head + 1 ] ; else node -> postmods = 0 ; }
assign premods, head, and postmod to node, given kids of size size.
assign premods head and postmod to node given kids of size size .
// set premod chain (must be reversed for the node)
 // head has no next
 // postmod chain already in proper order
 // now insert premod, head, and post into node, or insert
 // 0 if no such thing
 // premods
 // head
 // postmods
