Lines Matching refs:And
6 The simplest ways to invoke this module are via parse and parseFile.
12 # and Bill Tutt (rassilon@lima.mudlib.org)
15 # Modifications and improvements for Python 2.0 by Jeremy Hylton and
19 # (except Module, Discard and Stmt) added by Sylvain Thenault
26 # and replace OWNER, ORGANIZATION, and YEAR as appropriate.
187 if node[0] != token.ENDMARKER and node[0] != token.NEWLINE:
198 assert listlen >= 1 and listlen % 2 == 1
587 if len(nodelist) == 2 and nodelist[1][0] == symbol.comp_for:
594 if len(nodelist) == 1 and nodelist[0][0] == symbol.lambdef:
608 if len(nodelist) == 1 and nodelist[0][0] == symbol.lambdef:
614 # not_test ('and' not_test)*
615 return self.com_binary(And, nodelist)
652 # the two have very different semantics and results (note that the
767 # hack... changes in compile.c:parsestr and
794 # in the callers. In these cases, use lookup_node() and call the
803 # and compound_stmt.
850 if i < len(nodelist) and nodelist[i][0] == token.EQUAL:
879 # String together the dotted names and return the string
882 if type(n) == type(()) and n[0] == 1:
994 Names, slices, and attributes are the only allowable nodes.
1126 # XXX(avassalotti) Set and dict comprehensions should have generator
1226 elif len(nodelist) > 3 and nodelist[3][0] == symbol.comp_for:
1283 if len_nodelist != 2 and isinstance(result, GenExpr) \
1284 and len(node) == 3 and node[2][0] == symbol.comp_for:
1296 if len(nodelist) == 3 and nodelist[2][0] == symbol.comp_for:
1307 while len(n) == 2 and n[0] != token.NAME:
1324 (len(sub) > 2 and sub[2][0] == token.COLON)) and \
1338 if t == token.DOT and node[2][0] == token.DOT:
1364 if i < len(node) and node[i][0] == symbol.test:
1420 if n in _doc_nodes and len(node) == 1:
