TreeList ts = pN.flattenAlternativeChildren( choices.toArray() );
Tree[] tarr = choices.toArray(); TreeList ts = pN.flattenAlternativeChildren( tarr );
    Tree pattern() {	int pos = s.pos;	Tree first = pattern1();	if(( s.token == IDENTIFIER )&&( s.name == BAR )) {	    TreeList choices = new TreeList();	    choices.append( first );	    while(( s.token == IDENTIFIER )&&( s.name == BAR )) {		s.nextToken();		choices.append( pattern1() );	    }	    TreeList ts = pN.flattenAlternativeChildren( choices.toArray() );	    return pN.flattenAlternative( make.Alternative( pos, ts.toArray() ) );	}	return first;    }