Searched defs:token (Results 1 - 25 of 174) sorted by relevance

1234567

/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/
H A Dfix_isinstance.py13 from ..fixer_util import token namespace
36 if arg.type == token.NAME and arg.value in names_inserted:
37 if idx < len(args) - 1 and args[idx + 1].type == token.COMMA:
42 if arg.type == token.NAME:
44 if new_args and new_args[-1].type == token.COMMA:
H A Dfix_itertools_imports.py5 from lib2to3.fixer_util import BlankLine, syms, token namespace
21 if child.type == token.NAME:
24 elif child.type == token.STAR:
43 if remove_comma and child.type == token.COMMA:
48 while children and children[-1].type == token.COMMA:
H A Dfix_ne.py8 from ..pgen2 import token namespace
15 _accept_type = token.NOTEQUAL
22 new = pytree.Leaf(token.NOTEQUAL, u"!=", prefix=node.prefix)
H A Dfix_numliterals.py7 from ..pgen2 import token namespace
15 _accept_type = token.NUMBER
H A Dfix_apply.py10 from ..pgen2 import token namespace
39 if (func.type not in (token.NAME, syms.atom) and
41 func.children[-2].type == token.DOUBLESTAR)):
50 l_newargs = [pytree.Leaf(token.STAR, u"*"), args]
53 pytree.Leaf(token.DOUBLESTAR, u"**"),
55 l_newargs[-2].prefix = u" " # that's the ** token
H A Dfix_filter.py17 from ..pgen2 import token namespace
H A Dfix_has_key.py34 from ..pgen2 import token namespace
H A Dfix_set_literal.py8 from lib2to3.fixer_util import token, syms namespace
38 literal = [pytree.Leaf(token.LBRACE, u"{")]
40 literal.append(pytree.Leaf(token.RBRACE, u"}"))
H A Dfix_types.py23 from ..pgen2 import token namespace
H A Dfix_unicode.py6 from ..pgen2 import token namespace
17 if node.type == token.NAME:
21 elif node.type == token.STRING:
H A Dfix_ws_comma.py9 from ..pgen2 import token namespace
20 COMMA = pytree.Leaf(token.COMMA, u",")
21 COLON = pytree.Leaf(token.COLON, u":")
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/
H A Dfix_isinstance.py13 from ..fixer_util import token namespace
36 if arg.type == token.NAME and arg.value in names_inserted:
37 if idx < len(args) - 1 and args[idx + 1].type == token.COMMA:
42 if arg.type == token.NAME:
44 if new_args and new_args[-1].type == token.COMMA:
H A Dfix_itertools_imports.py5 from lib2to3.fixer_util import BlankLine, syms, token namespace
21 if child.type == token.NAME:
24 elif child.type == token.STAR:
43 if remove_comma and child.type == token.COMMA:
48 while children and children[-1].type == token.COMMA:
H A Dfix_ne.py8 from ..pgen2 import token namespace
15 _accept_type = token.NOTEQUAL
22 new = pytree.Leaf(token.NOTEQUAL, u"!=", prefix=node.prefix)
H A Dfix_numliterals.py7 from ..pgen2 import token namespace
15 _accept_type = token.NUMBER
H A Dfix_apply.py10 from ..pgen2 import token namespace
39 if (func.type not in (token.NAME, syms.atom) and
41 func.children[-2].type == token.DOUBLESTAR)):
50 l_newargs = [pytree.Leaf(token.STAR, u"*"), args]
53 pytree.Leaf(token.DOUBLESTAR, u"**"),
55 l_newargs[-2].prefix = u" " # that's the ** token
H A Dfix_filter.py17 from ..pgen2 import token namespace
H A Dfix_has_key.py34 from ..pgen2 import token namespace
H A Dfix_set_literal.py8 from lib2to3.fixer_util import token, syms namespace
38 literal = [pytree.Leaf(token.LBRACE, u"{")]
40 literal.append(pytree.Leaf(token.RBRACE, u"}"))
H A Dfix_types.py23 from ..pgen2 import token namespace
H A Dfix_unicode.py6 from ..pgen2 import token namespace
17 if node.type == token.NAME:
21 elif node.type == token.STRING:
H A Dfix_ws_comma.py9 from ..pgen2 import token namespace
20 COMMA = pytree.Leaf(token.COMMA, u",")
21 COLON = pytree.Leaf(token.COLON, u":")
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/pgen2/
H A Dconv.py12 Note that the token numbers are constants determined by the standard
13 Python tokenizer. The standard token module defines these numbers and
14 their names (the names are not used much). The token numbers are
33 from pgen2 import grammar, token namespace
252 self.tokens = {} # map from numeric token values to arc labels
254 if type == token.NAME and value is not None:
H A Dparse.py14 from . import token namespace
34 <for each input token>:
35 if p.addtoken(...): # parse a token; may raise ParseError
41 A Parser instance contains state pertaining to the current token
43 to parse separate token sequences.
76 tuple, where type is the node type (a token or symbol number),
114 """Add a token; return True iff this is the end of the program."""
115 # Map from token to label
117 # Loop until the token is shifted; may raise exceptions
128 # Shift a token; w
[all...]
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/pgen2/
H A Dconv.py12 Note that the token numbers are constants determined by the standard
13 Python tokenizer. The standard token module defines these numbers and
14 their names (the names are not used much). The token numbers are
33 from pgen2 import grammar, token namespace
252 self.tokens = {} # map from numeric token values to arc labels
254 if type == token.NAME and value is not None:

Completed in 313 milliseconds

1234567