Staging
v0.5.1
v0.5.1
https://github.com/python/cpython
Revision bca701403253379409dece03053dbd739c0bd059 authored by Lysandros Nikolaou on 26 October 2020, 22:42:04 UTC, committed by GitHub on 26 October 2020, 22:42:04 UTC
* Implement running the parser a second time for the errors messages The first parser run is only responsible for detecting whether there is a `SyntaxError` or not. If there isn't the AST gets returned. Otherwise, the parser is run a second time with all the `invalid_*` rules enabled so that all the customized error messages get produced.
1 parent c8c4200
Tip revision: bca701403253379409dece03053dbd739c0bd059 authored by Lysandros Nikolaou on 26 October 2020, 22:42:04 UTC
bpo-42123: Run the parser two times and only enable invalid rules on the second run (GH-22111)
bpo-42123: Run the parser two times and only enable invalid rules on the second run (GH-22111)
Tip revision: bca7014
rotatingtree.h
/* "Rotating trees" (Armin Rigo)
*
* Google "splay trees" for the general idea.
*
* It's a dict-like data structure that works best when accesses are not
* random, but follow a strong pattern. The one implemented here is for
* access patterns where the same small set of keys is looked up over
* and over again, and this set of keys evolves slowly over time.
*/
#include <stdlib.h>
#define EMPTY_ROTATING_TREE ((rotating_node_t *)NULL)
typedef struct rotating_node_s rotating_node_t;
typedef int (*rotating_tree_enum_fn) (rotating_node_t *node, void *arg);
struct rotating_node_s {
void *key;
rotating_node_t *left;
rotating_node_t *right;
};
void RotatingTree_Add(rotating_node_t **root, rotating_node_t *node);
rotating_node_t* RotatingTree_Get(rotating_node_t **root, void *key);
int RotatingTree_Enum(rotating_node_t *root, rotating_tree_enum_fn enumfn,
void *arg);
Computing file changes ...
