traverseda
/
cpython
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity
cpython/Tools/compiler/ast.txt

88 lines
2.0 KiB
Plaintext
Raw Normal View History

Revise implementations of getChildren() and getChildNodes(). Add support for floor division (// and //=) The implementation of getChildren() and getChildNodes() is intended to be faster, because it avoids calling flatten() on every return value. But it's not clear that it is a lot faster, because constructing a tuple with just the right values ends up being slow. (Too many attribute lookups probably.) The ast.txt file is much more complicated, with funny characters at the ends of names (*, &, !) to indicate the types of each child node. The astgen script is also much more complex, making me wonder if it's still useful.
2001-08-29 15:08:02 -03:00
# This file describes the nodes of the AST in ast.py. The module is
# generated by astgen.py.
# The descriptions use the following special notation to describe
# properties of the children:
# * this child is not a node
# ! this child is a sequence that contains nodes in it
# & this child may be set to None
# = ... a default value for the node constructor (optional args)
Module: doc*, node
Stmt: nodes!
Function: name*, argnames*, defaults!, flags*, doc*, code
Lambda: argnames*, defaults!, flags*, code
Class: name*, bases!, doc*, code
Support for generation of ast.py from simple description of node structure (ast.txt). Usage is python astgen.py > ast.py.
2000-10-25 14:59:17 -03:00
Pass:
Break:
Continue:
Revise implementations of getChildren() and getChildNodes(). Add support for floor division (// and //=) The implementation of getChildren() and getChildNodes() is intended to be faster, because it avoids calling flatten() on every return value. But it's not clear that it is a lot faster, because constructing a tuple with just the right values ends up being slow. (Too many attribute lookups probably.) The ast.txt file is much more complicated, with funny characters at the ends of names (*, &, !) to indicate the types of each child node. The astgen script is also much more complex, making me wonder if it's still useful.
2001-08-29 15:08:02 -03:00
For: assign, list, body, else_&
While: test, body, else_&
If: tests!, else_&
Exec: expr, locals&, globals&
From: modname*, names*
Import: names*
Raise: expr1&, expr2&, expr3&
Support for generation of ast.py from simple description of node structure (ast.txt). Usage is python astgen.py > ast.py.
2000-10-25 14:59:17 -03:00
TryFinally: body, final
Revise implementations of getChildren() and getChildNodes(). Add support for floor division (// and //=) The implementation of getChildren() and getChildNodes() is intended to be faster, because it avoids calling flatten() on every return value. But it's not clear that it is a lot faster, because constructing a tuple with just the right values ends up being slow. (Too many attribute lookups probably.) The ast.txt file is much more complicated, with funny characters at the ends of names (*, &, !) to indicate the types of each child node. The astgen script is also much more complex, making me wonder if it's still useful.
2001-08-29 15:08:02 -03:00
TryExcept: body, handlers!, else_&
Support for generation of ast.py from simple description of node structure (ast.txt). Usage is python astgen.py > ast.py.
2000-10-25 14:59:17 -03:00
Return: value
Add Yield node
2001-08-14 15:57:43 -03:00
Yield: value
Revise implementations of getChildren() and getChildNodes(). Add support for floor division (// and //=) The implementation of getChildren() and getChildNodes() is intended to be faster, because it avoids calling flatten() on every return value. But it's not clear that it is a lot faster, because constructing a tuple with just the right values ends up being slow. (Too many attribute lookups probably.) The ast.txt file is much more complicated, with funny characters at the ends of names (*, &, !) to indicate the types of each child node. The astgen script is also much more complex, making me wonder if it's still useful.
2001-08-29 15:08:02 -03:00
Const: value*
Print: nodes!, dest&
Printnl: nodes!, dest&
Support for generation of ast.py from simple description of node structure (ast.txt). Usage is python astgen.py > ast.py.
2000-10-25 14:59:17 -03:00
Discard: expr
Revise implementations of getChildren() and getChildNodes(). Add support for floor division (// and //=) The implementation of getChildren() and getChildNodes() is intended to be faster, because it avoids calling flatten() on every return value. But it's not clear that it is a lot faster, because constructing a tuple with just the right values ends up being slow. (Too many attribute lookups probably.) The ast.txt file is much more complicated, with funny characters at the ends of names (*, &, !) to indicate the types of each child node. The astgen script is also much more complex, making me wonder if it's still useful.
2001-08-29 15:08:02 -03:00
AugAssign: node, op*, expr
Assign: nodes!, expr
AssTuple: nodes!
AssList: nodes!
AssName: name*, flags*
AssAttr: expr, attrname*, flags*
ListComp: expr, quals!
ListCompFor: assign, list, ifs!
Support for generation of ast.py from simple description of node structure (ast.txt). Usage is python astgen.py > ast.py.
2000-10-25 14:59:17 -03:00
ListCompIf: test
Revise implementations of getChildren() and getChildNodes(). Add support for floor division (// and //=) The implementation of getChildren() and getChildNodes() is intended to be faster, because it avoids calling flatten() on every return value. But it's not clear that it is a lot faster, because constructing a tuple with just the right values ends up being slow. (Too many attribute lookups probably.) The ast.txt file is much more complicated, with funny characters at the ends of names (*, &, !) to indicate the types of each child node. The astgen script is also much more complex, making me wonder if it's still useful.
2001-08-29 15:08:02 -03:00
List: nodes!
Dict: items!
Support for generation of ast.py from simple description of node structure (ast.txt). Usage is python astgen.py > ast.py.
2000-10-25 14:59:17 -03:00
Not: expr
Revise implementations of getChildren() and getChildNodes(). Add support for floor division (// and //=) The implementation of getChildren() and getChildNodes() is intended to be faster, because it avoids calling flatten() on every return value. But it's not clear that it is a lot faster, because constructing a tuple with just the right values ends up being slow. (Too many attribute lookups probably.) The ast.txt file is much more complicated, with funny characters at the ends of names (*, &, !) to indicate the types of each child node. The astgen script is also much more complex, making me wonder if it's still useful.
2001-08-29 15:08:02 -03:00
Compare: expr, ops!
Name: name*
the names attribute of Global is not a node
2001-09-14 19:40:36 -03:00
Global: names*
Support for generation of ast.py from simple description of node structure (ast.txt). Usage is python astgen.py > ast.py.
2000-10-25 14:59:17 -03:00
Backquote: expr
Revise implementations of getChildren() and getChildNodes(). Add support for floor division (// and //=) The implementation of getChildren() and getChildNodes() is intended to be faster, because it avoids calling flatten() on every return value. But it's not clear that it is a lot faster, because constructing a tuple with just the right values ends up being slow. (Too many attribute lookups probably.) The ast.txt file is much more complicated, with funny characters at the ends of names (*, &, !) to indicate the types of each child node. The astgen script is also much more complex, making me wonder if it's still useful.
2001-08-29 15:08:02 -03:00
Getattr: expr, attrname*
CallFunc: node, args!, star_args& = None, dstar_args& = None
Keyword: name*, expr
Subscript: expr, flags*, subs!
Support for generation of ast.py from simple description of node structure (ast.txt). Usage is python astgen.py > ast.py.
2000-10-25 14:59:17 -03:00
Ellipsis:
Revise implementations of getChildren() and getChildNodes(). Add support for floor division (// and //=) The implementation of getChildren() and getChildNodes() is intended to be faster, because it avoids calling flatten() on every return value. But it's not clear that it is a lot faster, because constructing a tuple with just the right values ends up being slow. (Too many attribute lookups probably.) The ast.txt file is much more complicated, with funny characters at the ends of names (*, &, !) to indicate the types of each child node. The astgen script is also much more complex, making me wonder if it's still useful.
2001-08-29 15:08:02 -03:00
Sliceobj: nodes!
Slice: expr, flags*, lower&, upper&
Assert: test, fail&
Tuple: nodes!
Or: nodes!
And: nodes!
Bitor: nodes!
Bitxor: nodes!
Bitand: nodes!
Support for generation of ast.py from simple description of node structure (ast.txt). Usage is python astgen.py > ast.py.
2000-10-25 14:59:17 -03:00
LeftShift: (left, right)
RightShift: (left, right)
Add: (left, right)
Sub: (left, right)
Mul: (left, right)
Div: (left, right)
Mod: (left, right)
Power: (left, right)
Revise implementations of getChildren() and getChildNodes(). Add support for floor division (// and //=) The implementation of getChildren() and getChildNodes() is intended to be faster, because it avoids calling flatten() on every return value. But it's not clear that it is a lot faster, because constructing a tuple with just the right values ends up being slow. (Too many attribute lookups probably.) The ast.txt file is much more complicated, with funny characters at the ends of names (*, &, !) to indicate the types of each child node. The astgen script is also much more complex, making me wonder if it's still useful.
2001-08-29 15:08:02 -03:00
FloorDiv: (left, right)
Support for generation of ast.py from simple description of node structure (ast.txt). Usage is python astgen.py > ast.py.
2000-10-25 14:59:17 -03:00
UnaryAdd: expr
UnarySub: expr
Invert: expr
init(Function):
self.varargs = self.kwargs = None
if flags & CO_VARARGS:
self.varargs = 1
if flags & CO_VARKEYWORDS:
self.kwargs = 1
init(Lambda):
self.varargs = self.kwargs = None
if flags & CO_VARARGS:
self.varargs = 1
if flags & CO_VARKEYWORDS:
self.kwargs = 1