Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
C
cpython
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
Kirill Smelkov
cpython
Commits
5dc96069
Commit
5dc96069
authored
Aug 04, 2000
by
Jeremy Hylton
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
update my email address
fix com_call_function to cope with trailing comma in "f(a, b,)"
parent
43b85044
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
8 additions
and
2 deletions
+8
-2
Lib/compiler/transformer.py
Lib/compiler/transformer.py
+4
-1
Tools/compiler/compiler/transformer.py
Tools/compiler/compiler/transformer.py
+4
-1
No files found.
Lib/compiler/transformer.py
View file @
5dc96069
...
...
@@ -11,7 +11,7 @@
# February 1997.
#
# Support for ast.Node subclasses written and other revisions by
# Jeremy Hylton (jeremy@
cnri.reston.va.us
)
# Jeremy Hylton (jeremy@
beopen.com
)
#
"""Parse tree transformation module.
...
...
@@ -1001,6 +1001,9 @@ class Transformer:
args
.
append
(
result
)
else
:
i
=
i
+
1
# No broken by star arg, so skip the last one we processed.
if
i
<
len_nodelist
and
nodelist
[
i
][
0
]
==
token
.
COMMA
:
# need to accept an application that looks like "f(a, b,)"
i
=
i
+
1
star_node
=
dstar_node
=
None
while
i
<
len_nodelist
:
tok
=
nodelist
[
i
]
...
...
Tools/compiler/compiler/transformer.py
View file @
5dc96069
...
...
@@ -11,7 +11,7 @@
# February 1997.
#
# Support for ast.Node subclasses written and other revisions by
# Jeremy Hylton (jeremy@
cnri.reston.va.us
)
# Jeremy Hylton (jeremy@
beopen.com
)
#
"""Parse tree transformation module.
...
...
@@ -1001,6 +1001,9 @@ class Transformer:
args
.
append
(
result
)
else
:
i
=
i
+
1
# No broken by star arg, so skip the last one we processed.
if
i
<
len_nodelist
and
nodelist
[
i
][
0
]
==
token
.
COMMA
:
# need to accept an application that looks like "f(a, b,)"
i
=
i
+
1
star_node
=
dstar_node
=
None
while
i
<
len_nodelist
:
tok
=
nodelist
[
i
]
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment