mirror of
https://github.com/python/cpython.git
synced 2024-11-24 17:47:13 +01:00
a9e7dc1081
* flmodule.c: added {do,check}_only_forms to fl's list of functions;
and don't print a message when an unknown object is returned.
* pythonrun.c: catch SIGHUP and SIGTERM to do essential cleanup.
* Made jpegmodule.c smaller by using getargs() and mkvalue() consistently.
* Increased parser stack size to 500 in parser.h.
* Implemented custom allocation of stack frames to frameobject.c and
added dynamic stack overflow checks (value stack only) to ceval.c.
(There seems to be a bug left: sometimes stack traces don't make sense.)
51 lines
2.0 KiB
C
51 lines
2.0 KiB
C
/***********************************************************
|
|
Copyright 1991, 1992 by Stichting Mathematisch Centrum, Amsterdam, The
|
|
Netherlands.
|
|
|
|
All Rights Reserved
|
|
|
|
Permission to use, copy, modify, and distribute this software and its
|
|
documentation for any purpose and without fee is hereby granted,
|
|
provided that the above copyright notice appear in all copies and that
|
|
both that copyright notice and this permission notice appear in
|
|
supporting documentation, and that the names of Stichting Mathematisch
|
|
Centrum or CWI not be used in advertising or publicity pertaining to
|
|
distribution of the software without specific, written prior permission.
|
|
|
|
STICHTING MATHEMATISCH CENTRUM DISCLAIMS ALL WARRANTIES WITH REGARD TO
|
|
THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
|
FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH CENTRUM BE LIABLE
|
|
FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
|
|
OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
|
|
******************************************************************/
|
|
|
|
/* Parser interface */
|
|
|
|
#define MAXSTACK 500
|
|
|
|
typedef struct _stackentry {
|
|
int s_state; /* State in current DFA */
|
|
dfa *s_dfa; /* Current DFA */
|
|
struct _node *s_parent; /* Where to add next node */
|
|
} stackentry;
|
|
|
|
typedef struct _stack {
|
|
stackentry *s_top; /* Top entry */
|
|
stackentry s_base[MAXSTACK];/* Array of stack entries */
|
|
/* NB The stack grows down */
|
|
} stack;
|
|
|
|
typedef struct {
|
|
struct _stack p_stack; /* Stack of parser states */
|
|
struct _grammar *p_grammar; /* Grammar to use */
|
|
struct _node *p_tree; /* Top of parse tree */
|
|
} parser_state;
|
|
|
|
parser_state *newparser PROTO((struct _grammar *g, int start));
|
|
void delparser PROTO((parser_state *ps));
|
|
int addtoken PROTO((parser_state *ps, int type, char *str, int lineno));
|
|
void addaccelerators PROTO((grammar *g));
|