Message127798
| Author |
benjamin.peterson |
| Recipients |
belopolsky, benjamin.peterson |
| Date |
2011年02月03日.17:08:02 |
| SpamBayes Score |
8.3023544e-08 |
| Marked as misclassified |
No |
| Message-id |
<AANLkTikas2vtwjRCKKLzjjjHSL+9KDx_9BYWU6AMvhRJ@mail.gmail.com> |
| In-reply-to |
<1296752433.45.0.101254250853.issue11105@psf.upfronthosting.co.za> |
| Content |
2011年2月3日 Alexander Belopolsky <report@bugs.python.org>:
>
> Alexander Belopolsky <belopolsky@users.sourceforge.net> added the comment:
>
> Looks like a stack overflow caused by an infinite recursion. I am not sure if it is possible to add cycle detection code without sacrificing performance or setting some arbitrary limits.
Yes, it's definitely low priority. It's probably easier to crash the
interpreter by producing differently malformed ast anyway.
>
> I wonder: Why ast nodes need to be mutable?
So people can change them. |
|