Lines Matching refs:CHILD
107 w = node2tuple(CHILD(n, i), mkseq, addelem, lineno, col_offset);
228 int v = parser_compare_nodes(CHILD(left, j), CHILD(right, j));
803 "unsupported number of child nodes");
808 node* new_child = CHILD(root, i - 1);
965 /* Verifies that the number of child nodes is exactly 'num', raising
1006 && vfunc(CHILD(tree, 0)));
1012 res = validate_comma(CHILD(tree, --nch));
1016 res = (validate_comma(CHILD(tree, pos))
1017 && vfunc(CHILD(tree, pos + 1)));
1037 res = (validate_name(CHILD(tree, 0), "class")
1038 && validate_ntype(CHILD(tree, 1), NAME)
1039 && validate_colon(CHILD(tree, nch - 2))
1040 && validate_suite(CHILD(tree, nch - 1)));
1048 res = ((validate_lparen(CHILD(tree, 2)) &&
1049 validate_testlist(CHILD(tree, 3)) &&
1050 validate_rparen(CHILD(tree, 4))));
1053 res = (validate_lparen(CHILD(tree,2)) &&
1054 validate_rparen(CHILD(tree,3)));
1070 && validate_name(CHILD(tree, 0), "if")
1071 && validate_test(CHILD(tree, 1))
1072 && validate_colon(CHILD(tree, 2))
1073 && validate_suite(CHILD(tree, 3)));
1077 res = (validate_name(CHILD(tree, nch - 3), "else")
1078 && validate_colon(CHILD(tree, nch - 2))
1079 && validate_suite(CHILD(tree, nch - 1)));
1091 res = (validate_name(CHILD(tree, j), "elif")
1092 && validate_colon(CHILD(tree, j + 2))
1093 && validate_test(CHILD(tree, j + 1))
1094 && validate_suite(CHILD(tree, j + 3)));
1113 res = (validate_lparen(CHILD(tree, 0))
1114 && validate_rparen(CHILD(tree, nch - 1)));
1116 res = validate_varargslist(CHILD(tree, 1));
1138 res = validate_simple_stmt(CHILD(tree, 0));
1141 res = (validate_newline(CHILD(tree, 0))
1142 && validate_indent(CHILD(tree, 1))
1143 && validate_stmt(CHILD(tree, 2))
1144 && validate_dedent(CHILD(tree, nch - 1)));
1150 res = validate_stmt(CHILD(tree, i));
1196 sym = TYPE(CHILD(tree, start));
1202 res = validate_name(CHILD(tree, start+1), NULL);
1204 res = (validate_name(CHILD(tree, start+1), NULL)
1205 && validate_comma(CHILD(tree, start+2))
1206 && validate_doublestar(CHILD(tree, start+3))
1207 && validate_name(CHILD(tree, start+4), NULL));
1214 res = validate_name(CHILD(tree, start+1), NULL);
1241 err_string("varargslist missing child nodes");
1244 sym = TYPE(CHILD(tree, 0));
1253 sym = TYPE(CHILD(tree, nch-1));
1262 res = validate_fpdef(CHILD(tree, i));
1264 if (res && TYPE(CHILD(tree, i)) == EQUAL && (i+2 <= nch)) {
1265 res = (validate_equal(CHILD(tree, i))
1266 && validate_test(CHILD(tree, i+1)));
1271 res = validate_comma(CHILD(tree, i));
1274 && (TYPE(CHILD(tree, i)) == DOUBLESTAR
1275 || TYPE(CHILD(tree, i)) == STAR))
1291 res = validate_comma(CHILD(tree, nch-1));
1299 res = validate_fpdef(CHILD(tree, 0));
1301 if (res && (i+2 <= nch) && TYPE(CHILD(tree, i)) == EQUAL) {
1302 res = (validate_equal(CHILD(tree, i))
1303 && validate_test(CHILD(tree, i+1)));
1311 res = (validate_comma(CHILD(tree, i))
1312 && validate_fpdef(CHILD(tree, i+1)));
1314 if (res && (nch - i) >= 2 && TYPE(CHILD(tree, i)) == EQUAL) {
1315 res = (validate_equal(CHILD(tree, i))
1316 && validate_test(CHILD(tree, i+1)));
1337 if (res && TYPE(CHILD(tree, 0)) == list_for)
1338 res = validate_list_for(CHILD(tree, 0));
1340 res = validate_list_if(CHILD(tree, 0));
1352 if (res && TYPE(CHILD(tree, 0)) == comp_for)
1353 res = validate_comp_for(CHILD(tree, 0));
1355 res = validate_comp_if(CHILD(tree, 0));
1369 res = validate_list_iter(CHILD(tree, 4));
1374 res = (validate_name(CHILD(tree, 0), "for")
1375 && validate_exprlist(CHILD(tree, 1))
1376 && validate_name(CHILD(tree, 2), "in")
1377 && validate_testlist_safe(CHILD(tree, 3)));
1391 res = validate_comp_iter(CHILD(tree, 4));
1396 res = (validate_name(CHILD(tree, 0), "for")
1397 && validate_exprlist(CHILD(tree, 1))
1398 && validate_name(CHILD(tree, 2), "in")
1399 && validate_or_test(CHILD(tree, 3)));
1413 res = validate_list_iter(CHILD(tree, 2));
1418 res = (validate_name(CHILD(tree, 0), "if")
1419 && validate_old_test(CHILD(tree, 1)));
1433 res = validate_comp_iter(CHILD(tree, 2));
1438 res = (validate_name(CHILD(tree, 0), "if")
1439 && validate_old_test(CHILD(tree, 1)));
1458 res = validate_ntype(CHILD(tree, 0), NAME);
1460 res = (validate_lparen(CHILD(tree, 0))
1461 && validate_fplist(CHILD(tree, 1))
1462 && validate_rparen(CHILD(tree, 2)));
1488 tree = CHILD(tree, 0);
1508 && validate_small_stmt(CHILD(tree, 0))
1509 && validate_newline(CHILD(tree, nch - 1)));
1515 res = validate_semi(CHILD(tree, --nch));
1520 res = (validate_semi(CHILD(tree, i))
1521 && validate_small_stmt(CHILD(tree, i + 1)));
1534 CHILD(tree, 0));
1545 res = validate_node(CHILD(tree, 0));
1548 err_string("illegal small_stmt child type");
1554 "Unrecognized child node of small_stmt: %d.",
1555 TYPE(CHILD(tree, 0)));
1574 tree = CHILD(tree, 0);
1609 && validate_testlist(CHILD(tree, 0)));
1612 && TYPE(CHILD(tree, 1)) == augassign) {
1613 res = validate_numnodes(CHILD(tree, 1), 1, "augassign")
1614 && validate_yield_or_testlist(CHILD(tree, 2));
1617 char *s = STR(CHILD(CHILD(tree, 1), 0));
1637 res = validate_equal(CHILD(tree, j))
1638 && validate_yield_or_testlist(CHILD(tree, j + 1));
1655 && validate_name(CHILD(tree, 0), "print"));
1658 int sym = TYPE(CHILD(tree, 1));
1663 res = validate_test(CHILD(tree, i++));
1668 res = (validate_ntype(CHILD(tree, i), RIGHTSHIFT)
1669 && validate_test(CHILD(tree, i+1)));
1677 res = (validate_comma(CHILD(tree, i))
1678 && validate_test(CHILD(tree, i+1)));
1685 res = validate_comma(CHILD(tree, i));
1696 && validate_name(CHILD(tree, 0), "del")
1697 && validate_exprlist(CHILD(tree, 1)));
1707 && validate_name(CHILD(tree, 0), "return"));
1710 res = validate_testlist(CHILD(tree, 1));
1724 res = validate_name(CHILD(tree, 0), "raise");
1726 res = validate_test(CHILD(tree, 1));
1728 res = (validate_comma(CHILD(tree, 2))
1729 && validate_test(CHILD(tree, 3)));
1731 res = (validate_comma(CHILD(tree, 4))
1732 && validate_test(CHILD(tree, 5)));
1738 res = (validate_comma(CHILD(tree, 2))
1739 && validate_test(CHILD(tree, 3)));
1753 && validate_name(CHILD(tree, 0), "yield"));
1756 res = validate_testlist(CHILD(tree, 1));
1769 && validate_yield_expr(CHILD(tree, 0)));
1781 ok = validate_name(CHILD(tree, 0), NULL);
1783 ok = (validate_name(CHILD(tree, 0), NULL)
1784 && validate_name(CHILD(tree, 1), "as")
1785 && validate_name(CHILD(tree, 2), NULL));
1801 && validate_name(CHILD(tree, 0), NULL));
1805 res = (validate_dot(CHILD(tree, i))
1806 && validate_name(CHILD(tree, i+1), NULL));
1822 res = validate_dotted_name(CHILD(tree, 0));
1824 res = (validate_dotted_name(CHILD(tree, 0))
1825 && validate_name(CHILD(tree, 1), "as")
1826 && validate_name(CHILD(tree, 2), NULL));
1841 int res = is_odd(nch) && validate_dotted_as_name(CHILD(tree, 0));
1845 res = (validate_comma(CHILD(tree, i))
1846 && validate_dotted_as_name(CHILD(tree, i + 1)));
1856 int res = validate_import_as_name(CHILD(tree, 0));
1860 res = (validate_comma(CHILD(tree, i))
1861 && validate_import_as_name(CHILD(tree, i + 1)));
1872 && validate_name(CHILD(tree, 0), "import")
1873 && validate_dotted_as_names(CHILD(tree, 1)));
1884 if (TYPE(CHILD(tree, i)) != DOT)
1897 int havename = (TYPE(CHILD(tree, ndots + 1)) == dotted_name);
1902 && validate_name(CHILD(tree, 0), "from")
1903 && (!havename || validate_dotted_name(CHILD(tree, ndots + 1)))
1904 && validate_name(CHILD(tree, offset + 1), "import");
1906 if (res && TYPE(CHILD(tree, offset + 2)) == LPAR)
1908 && validate_lparen(CHILD(tree, offset + 2))
1909 && validate_import_as_names(CHILD(tree, offset + 3))
1910 && validate_rparen(CHILD(tree, offset + 4)));
1911 else if (res && TYPE(CHILD(tree, offset + 2)) != STAR)
1912 res = validate_import_as_names(CHILD(tree, offset + 2));
1925 int ntype = TYPE(CHILD(tree, 0));
1928 res = validate_node(CHILD(tree, 0));
1931 err_string("illegal import_stmt child type");
1937 "Unrecognized child node of import_stmt: %d.",
1938 TYPE(CHILD(tree, 0)));
1958 res = (validate_name(CHILD(tree, 0), "global")
1959 && validate_ntype(CHILD(tree, 1), NAME));
1961 res = (validate_comma(CHILD(tree, j))
1962 && validate_ntype(CHILD(tree, j + 1), NAME));
1978 && validate_name(CHILD(tree, 0), "exec")
1979 && validate_expr(CHILD(tree, 1)));
1984 res = (validate_name(CHILD(tree, 2), "in")
1985 && validate_test(CHILD(tree, 3)));
1987 res = (validate_comma(CHILD(tree, 4))
1988 && validate_test(CHILD(tree, 5)));
2004 && (validate_name(CHILD(tree, 0), "assert"))
2005 && validate_test(CHILD(tree, 1)));
2010 res = (validate_comma(CHILD(tree, 2))
2011 && validate_test(CHILD(tree, 3)));
2023 && validate_name(CHILD(tree, 0), "while")
2024 && validate_test(CHILD(tree, 1))
2025 && validate_colon(CHILD(tree, 2))
2026 && validate_suite(CHILD(tree, 3)));
2029 res = (validate_name(CHILD(tree, 4), "else")
2030 && validate_colon(CHILD(tree, 5))
2031 && validate_suite(CHILD(tree, 6)));
2043 && validate_name(CHILD(tree, 0), "for")
2044 && validate_exprlist(CHILD(tree, 1))
2045 && validate_name(CHILD(tree, 2), "in")
2046 && validate_testlist(CHILD(tree, 3))
2047 && validate_colon(CHILD(tree, 4))
2048 && validate_suite(CHILD(tree, 5)));
2051 res = (validate_name(CHILD(tree, 6), "else")
2052 && validate_colon(CHILD(tree, 7))
2053 && validate_suite(CHILD(tree, 8)));
2074 res = (validate_name(CHILD(tree, 0), "try")
2075 && validate_colon(CHILD(tree, 1))
2076 && validate_suite(CHILD(tree, 2))
2077 && validate_colon(CHILD(tree, nch - 2))
2078 && validate_suite(CHILD(tree, nch - 1)));
2081 if (TYPE(CHILD(tree, nch - 3)) != except_clause)
2082 name = STR(CHILD(tree, nch - 3));
2088 if (res && (TYPE(CHILD(tree, pos)) == NAME) &&
2089 (strcmp(STR(CHILD(tree, pos)), "finally") == 0)) {
2091 && validate_colon(CHILD(tree, 4))
2092 && validate_suite(CHILD(tree, 5)));
2096 while (res && pos < nch && (TYPE(CHILD(tree, pos)) == except_clause)) {
2097 res = (validate_except_clause(CHILD(tree, pos))
2098 && validate_colon(CHILD
2099 && validate_suite(CHILD(tree, pos + 2)));
2103 if (res && pos < nch && (TYPE(CHILD(tree, pos)) == NAME) &&
2104 (strcmp(STR(CHILD(tree, pos)), "else") == 0)) {
2105 res = (validate_colon(CHILD(tree, pos + 1))
2106 && validate_suite(CHILD(tree, pos + 2)));
2111 res = (validate_name(CHILD(tree, pos), "finally")
2113 && validate_colon(CHILD(tree, pos + 1))
2114 && validate_suite(CHILD(tree, pos + 2)));
2126 && validate_name(CHILD(tree, 0), "except"));
2129 res = validate_test(CHILD(tree, 1));
2131 if (TYPE(CHILD(tree, 2)) == NAME)
2132 res = validate_name(CHILD(tree, 2), "as");
2134 res = validate_comma(CHILD(tree, 2));
2135 res = res && validate_test(CHILD(tree, 3));
2147 if (res && (TYPE(CHILD(tree, 0)) == lambdef))
2149 && validate_lambdef(CHILD(tree, 0)));
2151 res = validate_or_test(CHILD(tree, 0));
2153 validate_name(CHILD(tree, 1), "if") &&
2154 validate_or_test(CHILD(tree, 2)) &&
2155 validate_name(CHILD(tree, 3), "else") &&
2156 validate_test(CHILD(tree, 4)))));
2167 if (res && (TYPE(CHILD(tree, 0)) == old_lambdef))
2168 res = (validate_old_lambdef(CHILD(tree, 0)));
2170 res = (validate_or_test(CHILD(tree, 0)));
2183 res = validate_and_test(CHILD(tree, 0));
2185 res = (validate_name(CHILD(tree, pos), "or")
2186 && validate_and_test(CHILD(tree, pos + 1)));
2199 && validate_not_test(CHILD(tree, 0)));
2202 res = (validate_name(CHILD(tree, pos), "and")
2203 && validate_not_test(CHILD(tree, 0)));
2217 res = (validate_name(CHILD(tree, 0), "not")
2218 && validate_not_test(CHILD(tree, 1)));
2220 res = validate_comparison(CHILD(tree, 0));
2233 && validate_expr(CHILD(tree, 0)));
2236 res = (validate_comp_op(CHILD(tree, pos))
2237 && validate_expr(CHILD(tree, pos + 1)));
2253 * Only child will be a terminal with a well-defined symbolic name
2256 tree = CHILD(tree, 0);
2281 res = (validate_ntype(CHILD(tree, 0), NAME)
2282 && validate_ntype(CHILD(tree, 1), NAME)
2283 && (((strcmp(STR(CHILD(tree, 0)), "is") == 0)
2284 && (strcmp(STR(CHILD(tree, 1)), "not") == 0))
2285 || ((strcmp(STR(CHILD(tree, 0)), "not") == 0)
2286 && (strcmp(STR(CHILD(tree, 1)), "in") == 0))));
2301 && validate_xor_expr(CHILD(tree, 0)));
2304 res = (validate_xor_expr(CHILD(tree, j))
2305 && validate_vbar(CHILD(tree, j - 1)));
2318 && validate_and_expr(CHILD(tree, 0)));
2321 res = (validate_circumflex(CHILD(tree, j - 1))
2322 && validate_and_expr(CHILD(tree, j)));
2335 && validate_shift_expr(CHILD(tree, 0)));
2338 res = (validate_ampersand(CHILD(tree, pos))
2339 && validate_shift_expr(CHILD(tree, pos + 1)));
2351 && (*termvalid)(CHILD(tree, 0)));
2354 if (TYPE(CHILD(tree, pos)) != op1)
2355 res = validate_ntype(CHILD(tree, pos), op2);
2357 res = (*termvalid)(CHILD(tree, pos + 1));
2387 && validate_factor(CHILD(tree, 0)));
2390 res = (((TYPE(CHILD(tree, pos)) == STAR)
2391 || (TYPE(CHILD(tree, pos)) == SLASH)
2392 || (TYPE(CHILD(tree, pos)) == DOUBLESLASH)
2393 || (TYPE(CHILD(tree, pos)) == PERCENT))
2394 && validate_factor(CHILD(tree, pos + 1)));
2410 && ((TYPE(CHILD(tree, 0)) == PLUS)
2411 || (TYPE(CHILD(tree, 0)) == MINUS)
2412 || (TYPE(CHILD(tree, 0)) == TILDE))
2413 && validate_factor(CHILD(tree, 1)))
2415 && validate_power(CHILD(tree, 0)))));
2430 && validate_atom(CHILD(tree, 0)));
2432 while (res && (pos < nch) && (TYPE(CHILD(tree, pos)) == trailer))
2433 res = validate_trailer(CHILD(tree, pos++));
2440 res = (validate_doublestar(CHILD(tree, pos))
2441 && validate_factor(CHILD(tree, pos + 1)));
2457 switch (TYPE(CHILD(tree, 0))) {
2460 && (validate_rparen(CHILD(tree, nch - 1))));
2463 if (TYPE(CHILD(tree, 1))==yield_expr)
2464 res = validate_yield_expr(CHILD(tree, 1));
2466 res = validate_testlist_comp(CHILD(tree, 1));
2471 res = validate_ntype(CHILD(tree, 1), RSQB);
2473 res = (validate_listmaker(CHILD(tree, 1))
2474 && validate_ntype(CHILD(tree, 2), RSQB));
2482 && validate_ntype(CHILD(tree, nch - 1), RBRACE));
2485 res = validate_dictorsetmaker(CHILD(tree, 1));
2489 && validate_testlist1(CHILD(tree, 1))
2490 && validate_ntype(CHILD(tree, 2), BACKQUOTE));
2498 res = validate_ntype(CHILD(tree, pos), STRING);
2519 err_string("missing child nodes of listmaker");
2521 ok = validate_test(CHILD(tree, 0));
2526 if (nch == 2 && TYPE(CHILD(tree, 1)) == list_for)
2527 ok = validate_list_for(CHILD(tree, 1));
2532 ok = (validate_comma(CHILD(tree, i))
2533 && validate_test(CHILD(tree, i+1)));
2537 ok = validate_comma(CHILD(tree, i));
2556 err_string("missing child nodes of testlist_comp");
2558 ok = validate_test(CHILD(tree, 0));
2564 if (nch == 2 && TYPE(CHILD(tree, 1)) == comp_for)
2565 ok = validate_comp_for(CHILD(tree, 1));
2570 ok = (validate_comma(CHILD(tree, i))
2571 && validate_test(CHILD(tree, i+1)));
2575 ok = validate_comma(CHILD(tree, i));
2594 validate_at(CHILD(tree, 0)) &&
2595 validate_dotted_name(CHILD(tree, 1)) &&
2599 ok = (validate_lparen(CHILD(tree, 2)) &&
2603 ok = validate_arglist(CHILD(tree, 3));
2620 ok = validate_decorator(CHILD(tree, i));
2634 && validate_test(CHILD(tree, 0)));
2636 ok = (validate_name(CHILD(tree, 1), "as")
2637 && validate_expr(CHILD(tree, 2)));
2652 && validate_name(CHILD(tree, 0), "with")
2656 ok = validate_with_item(CHILD(tree, i));
2703 && validate_name(CHILD(tree, 0), "lambda")
2704 && validate_colon(CHILD(tree, nch - 2))
2705 && validate_test(CHILD(tree, nch - 1)));
2708 res = validate_varargslist(CHILD(tree, 1));
2722 && validate_name(CHILD(tree, 0), "lambda")
2723 && validate_colon(CHILD(tree, nch - 2))
2724 && validate_test(CHILD(tree, nch - 1)));
2727 res = validate_varargslist(CHILD(tree, 1));
2752 if (TYPE(CHILD(tree, i)) == argument) {
2753 node *ch = CHILD(tree, i);
2754 if (NCH(ch) == 2 && TYPE(CHILD(ch, 1)) == comp_for) {
2764 ok = (validate_argument(CHILD(tree, i))
2765 && validate_comma(CHILD(tree, i+1)));
2776 int sym = TYPE(CHILD(tree, i));
2779 ok = validate_argument(CHILD(tree, i));
2787 ok = validate_star(CHILD(tree, i));
2789 ok = validate_test(CHILD(tree, i+1));
2791 ok = (validate_test(CHILD(tree, i+1))
2792 && validate_comma(CHILD(tree, i+2))
2793 && validate_doublestar(CHILD(tree, i+3))
2794 && validate_test(CHILD(tree, i+4)));
2802 ok = (validate_doublestar(CHILD(tree, i))
2803 && validate_test(CHILD(tree, i+1)));
2829 && validate_test(CHILD(tree, 0)));
2832 res = validate_comp_for(CHILD(tree, 1));
2834 res = (validate_equal(CHILD(tree, 1))
2835 && validate_test(CHILD(tree, 2)));
2853 switch (TYPE(CHILD(tree, 0))) {
2855 res = validate_rparen(CHILD(tree, nch - 1));
2857 res = validate_arglist(CHILD(tree, 1));
2861 && validate_subscriptlist(CHILD(tree, 1))
2862 && validate_ntype(CHILD(tree, 2), RSQB));
2866 && validate_ntype(CHILD(tree, 1), NAME));
2908 if (TYPE(CHILD(tree, 0)) == DOT)
2911 && validate_dot(CHILD(tree, 0))
2912 && validate_dot(CHILD(tree, 1))
2913 && validate_dot(CHILD(tree, 2)));
2915 if (TYPE(CHILD(tree, 0)) == test)
2916 res = validate_test(CHILD(tree, 0));
2918 res = validate_colon(CHILD(tree, 0));
2925 if ((TYPE(CHILD(tree, 0)) != COLON) || (nch == 4)) {
2926 res = validate_test(CHILD(tree, 0));
2930 res = validate_colon(CHILD(tree, offset));
2934 if (TYPE(CHILD(tree, offset)) == test) {
2935 res = validate_test(CHILD(tree, offset));
2940 res = validate_sliceop(CHILD(tree, offset));
2957 res = validate_colon(CHILD(tree, 0));
2959 res = validate_test(CHILD(tree, 1));
2989 if (ok && (nch == 1 || TYPE(CHILD(tree, 1)) == COMMA)) {
2993 ok = validate_test(CHILD(tree, i++));
2995 ok = (validate_comma(CHILD(tree, i))
2996 && validate_test(CHILD(tree, i+1)));
3001 else if (ok && TYPE(CHILD(tree, 1)) == comp_for) {
3005 ok = (validate_test(CHILD(tree, 0))
3006 && validate_comp_for(CHILD(tree, 1)));
3008 else if (ok && NCH(tree) > 3 && TYPE(CHILD(tree, 3)) == comp_for) {
3012 ok = (validate_test(CHILD(tree, 0))
3013 && validate_colon(CHILD(tree, 1))
3014 && validate_test(CHILD(tree, 2))
3015 && validate_comp_for(CHILD(tree, 3)));
3022 ok = (validate_test(CHILD(tree, i))
3023 && validate_colon(CHILD(tree, i+1))
3024 && validate_test(CHILD(tree, i+2)));
3033 ok = (validate_comma(CHILD(tree, i))
3034 && validate_test(CHILD(tree, i+1))
3035 && validate_colon(CHILD(tree, i+2))
3036 && validate_test(CHILD(tree, i+3)));
3043 ok = validate_comma(CHILD(tree, i));
3061 && validate_testlist(CHILD(tree, 0))
3062 && validate_ntype(CHILD(tree, nch - 1), ENDMARKER));
3065 res = validate_ntype(CHILD(tree, pos), NEWLINE);
3113 && ((TYPE(CHILD(tree, 0)) == break_stmt)
3114 || (TYPE(CHILD(tree, 0)) == continue_stmt)
3115 || (TYPE(CHILD(tree, 0)) == yield_stmt)
3116 || (TYPE(CHILD(tree, 0)) == return_stmt)
3117 || (TYPE(CHILD(tree, 0)) == raise_stmt)));
3119 next = CHILD(tree, 0);
3149 && validate_name(CHILD(tree, 0), "pass"));
3153 && validate_name(CHILD(tree, 0), "break"));
3157 && validate_name(CHILD(tree, 0), "continue"));
3289 && validate_ntype(CHILD(tree, nch), ENDMARKER));
3292 if (TYPE(CHILD(tree, j)) == stmt)
3293 res = validate_stmt(CHILD(tree, j));
3295 res = validate_newline(CHILD(tree, j));
3312 && validate_file_input(CHILD(tree, 0)));
