| commit | 4a97b1517a6b5ff22e2984b677a680b07ff0ce11 | [log] [tgz] |
|---|---|---|
| author | Pablo Galindo <Pablogsal@gmail.com> | Wed Sep 02 17:44:19 2020 +0100 |
| committer | GitHub <noreply@github.com> | Wed Sep 02 17:44:19 2020 +0100 |
| tree | d31c9d8aa26544863790e5643c79c10e0172f0c3 | |
| parent | 3940333637b98a2781869977b077552514784529 [diff] |
bpo-41690: Use a loop to collect args in the parser instead of recursion (GH-22053)
This program can segfault the parser by stack overflow:
```
import ast
code = "f(" + ",".join(['a' for _ in range(100000)]) + ")"
print("Ready!")
ast.parse(code)
```
the reason is that the rule for arguments has a simple recursion when collecting args:
args[expr_ty]:
[...]
| a=named_expression b=[',' c=args { c }] {
[...] }