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

105 lines
2.5 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)
Add comment about updating docs
2005-11-22 11:01:13 -04:00
#
# If you add node types here, please be sure to update the list of
# Node types in Doc/lib/asttable.tex.
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
Module: doc*, node
Stmt: nodes!
PEP-0318, @decorator-style. In Guido's words: "@ seems the syntax that everybody can hate equally" Implementation by Mark Russell, from SF #979728.
2004-08-02 03:10:11 -03:00
Decorators: nodes!
Function: decorators&, name*, argnames*, defaults!, flags*, doc*, code
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
Lambda: argnames*, defaults!, flags*, code
Issue 2117. Update compiler module to handle class decorators. Thanks Thomas Herve
2008-02-25 14:06:00 -04:00
Class: name*, bases!, doc*, code, decorators& = None
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_&
PEP 343 -- the with-statement. This was started by Mike Bland and completed by Guido (with help from Neal). This still needs a __future__ statement added; Thomas is working on Michael's patch for that aspect. There's a small amount of code cleanup and refactoring in ast.c, compile.c and ceval.c (I fixed the lltrace behavior when EXT_POP is used -- however I had to make lltrace a static global).
2006-02-27 18:32:47 -04:00
With: expr, vars&, body
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
If: tests!, else_&
Update for absolute/relative imports and ifelse-expressions.
2006-03-03 14:11:37 -04:00
IfExp: test, then, else_
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
Exec: expr, locals&, globals&
Update for absolute/relative imports and ifelse-expressions.
2006-03-03 14:11:37 -04:00
From: modname*, names*, level*
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
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
PEP 343 -- the with-statement. This was started by Mike Bland and completed by Guido (with help from Neal). This still needs a __future__ statement added; Thomas is working on Michael's patch for that aspect. There's a small amount of code cleanup and refactoring in ast.c, compile.c and ceval.c (I fixed the lltrace behavior when EXT_POP is used -- however I had to make lltrace a static global).
2006-02-27 18:32:47 -04:00
GenExpr: code
SF patch #872326: Generator expression implementation (Code contributed by Jiwon Seo.) The documentation portion of the patch is being re-worked and will be checked-in soon. Likewise, PEP 289 will be updated to reflect Guido's rationale for the design decisions on binding behavior (as described in in his patch comments and in discussions on python-dev). The test file, test_genexps.py, is written in doctest format and is meant to exercise all aspects of the the patch. Further additions are welcome from everyone. Please stress test this new feature as much as possible before the alpha release.
2004-05-19 05:20:33 -03:00
GenExprInner: expr, quals!
GenExprFor: assign, iter, ifs!
GenExprIf: 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
SF patch #872326: Generator expression implementation (Code contributed by Jiwon Seo.) The documentation portion of the patch is being re-worked and will be checked-in soon. Likewise, PEP 289 will be updated to reflect Guido's rationale for the design decisions on binding behavior (as described in in his patch comments and in discussions on python-dev). The test file, test_genexps.py, is written in doctest format and is meant to exercise all aspects of the the patch. Further additions are welcome from everyone. Please stress test this new feature as much as possible before the alpha release.
2004-05-19 05:20:33 -03:00
init(GenExpr):
Issue 2117. Update compiler module to handle class decorators. Thanks Thomas Herve
2008-02-25 14:06:00 -04:00
self.argnames = ['.0']
SF patch #872326: Generator expression implementation (Code contributed by Jiwon Seo.) The documentation portion of the patch is being re-worked and will be checked-in soon. Likewise, PEP 289 will be updated to reflect Guido's rationale for the design decisions on binding behavior (as described in in his patch comments and in discussions on python-dev). The test file, test_genexps.py, is written in doctest format and is meant to exercise all aspects of the the patch. Further additions are welcome from everyone. Please stress test this new feature as much as possible before the alpha release.
2004-05-19 05:20:33 -03:00
self.varargs = self.kwargs = None
init(GenExprFor):
self.is_outmost = False