blob: 2c0e327e0e1b0dbdcaaed6c64cb289b5c8dd1c1e [file] [log] [blame]
Guido van Rossumf70e43a1991-02-19 12:39:46 +00001/***********************************************************
Guido van Rossum5113f5f1992-04-05 14:20:22 +00002Copyright 1991, 1992 by Stichting Mathematisch Centrum, Amsterdam, The
Guido van Rossumf70e43a1991-02-19 12:39:46 +00003Netherlands.
4
5 All Rights Reserved
6
7Permission to use, copy, modify, and distribute this software and its
8documentation for any purpose and without fee is hereby granted,
9provided that the above copyright notice appear in all copies and that
10both that copyright notice and this permission notice appear in
11supporting documentation, and that the names of Stichting Mathematisch
12Centrum or CWI not be used in advertising or publicity pertaining to
13distribution of the software without specific, written prior permission.
14
15STICHTING MATHEMATISCH CENTRUM DISCLAIMS ALL WARRANTIES WITH REGARD TO
16THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
17FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH CENTRUM BE LIABLE
18FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
19WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
20ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
21OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
22
23******************************************************************/
24
Guido van Rossum85a5fbb1990-10-14 12:07:46 +000025/* Parser interface */
26
Guido van Rossuma9e7dc11992-10-18 18:53:57 +000027#define MAXSTACK 500
Guido van Rossum85a5fbb1990-10-14 12:07:46 +000028
29typedef struct _stackentry {
30 int s_state; /* State in current DFA */
31 dfa *s_dfa; /* Current DFA */
Guido van Rossum3f5da241990-12-20 15:06:42 +000032 struct _node *s_parent; /* Where to add next node */
Guido van Rossum85a5fbb1990-10-14 12:07:46 +000033} stackentry;
34
35typedef struct _stack {
36 stackentry *s_top; /* Top entry */
37 stackentry s_base[MAXSTACK];/* Array of stack entries */
38 /* NB The stack grows down */
39} stack;
40
41typedef struct {
42 struct _stack p_stack; /* Stack of parser states */
43 struct _grammar *p_grammar; /* Grammar to use */
44 struct _node *p_tree; /* Top of parse tree */
45} parser_state;
46
47parser_state *newparser PROTO((struct _grammar *g, int start));
48void delparser PROTO((parser_state *ps));
Guido van Rossum3f5da241990-12-20 15:06:42 +000049int addtoken PROTO((parser_state *ps, int type, char *str, int lineno));
50void addaccelerators PROTO((grammar *g));