creates a ` binary operator ' subtree , given the information about the parent and the two child nodex . concode_field_sep FilterPredicate predicate concode_elem_sep List collectedNodes concode_field_sep AST getLastSibling concode_elem_sep AST findTypeInChildren concode_elem_sep AST findPreviousSibling concode_elem_sep String getPathText concode_elem_sep void getPathText concode_elem_sep String getTokenTypeName concode_elem_sep boolean isSubtreeChild concode_elem_sep String getDebugString concode_elem_sep List getCollectedNodes concode_elem_sep Integer extractIntegerValue concode_elem_sep AST create concode_elem_sep AST createParent concode_elem_sep String getConstantName concode_elem_sep boolean exclude concode_elem_sep boolean exclude concode_elem_sep boolean include concode_elem_sep Map generateTokenNameCache concode_elem_sep void appendSibling concode_elem_sep ASTArray createAstArray concode_elem_sep AST createTree concode_elem_sep void insertChild concode_elem_sep List collectChildren concode_elem_sep AST getLastChild concode_elem_sep void makeSiblingOfParent concode_elem_sep void visit concode_elem_sep boolean hasExactlyOneChild concode_elem_sep AST insertSibling concode_elem_sep List collect concode_elem_sep AST createSibling
AST function ( ASTFactory arg0 , int arg1 , String arg2 , AST arg3 , AST arg4 ) { ASTArray loc0 = createAstArray ( arg0 , 3 , arg1 , arg2 , arg3 ) ; loc0 . add ( arg4 ) ; return arg0 . make ( loc0 ) ; }