Method getChildIndexOrListMembership

src/org/antlr/codebuff/Trainer.java:961–986

Return the index 0..n-1 of t as child of t.parent. If t is index 0, always return 0. If t is a repeated subtree root and index within sibling list > 0, return CHILD_INDEX_LIST_ELEMENT. In all other cases, return the actual index of t. That means for a sibling list starting at child index 5, the

(ParseTree t)

	 *  5 but 2nd and beyond in list will return CHILD_INDEX_LIST_ELEMENT.
	 */
	public static int getChildIndexOrListMembership(ParseTree t) {
		if ( t==null ) return -1;
		ParseTree parent = t.getParent();
		if ( parent==null ) {
			return -1;
		}
		// we know we have a parent now
		// check to see if we are 2nd or beyond element in a sibling list
		if ( t instanceof ParserRuleContext ) {
			List<ParserRuleContext> siblings =
				((ParserRuleContext)parent).getRuleContexts(((ParserRuleContext)t).getClass());
			if ( siblings.size()>1 && siblings.indexOf(t)>0 ) {
				return CHILD_INDEX_REPEATED_ELEMENT;
			}
		}
		// check to see if we are 2nd or beyond repeated token
		if ( t instanceof TerminalNode ) {
			List<TerminalNode> repeatedTokens =
				((ParserRuleContext) parent).getTokens(((TerminalNode) t).getSymbol().getType());
			if ( repeatedTokens.size()>1 && repeatedTokens.indexOf(t)>0 ) {
				return CHILD_INDEX_REPEATED_ELEMENT;
			}
		}

		return getChildIndex(t);
	}

	public static int getChildIndex(ParseTree t) {
		if ( t==null ) return -1;