| 2 |
7u83 |
1 |
/*
|
| 6 |
7u83 |
2 |
* Copyright (c) 2002-2005 The TenDRA Project <http://www.tendra.org/>.
|
|
|
3 |
* All rights reserved.
|
|
|
4 |
*
|
|
|
5 |
* Redistribution and use in source and binary forms, with or without
|
|
|
6 |
* modification, are permitted provided that the following conditions are met:
|
|
|
7 |
*
|
|
|
8 |
* 1. Redistributions of source code must retain the above copyright notice,
|
|
|
9 |
* this list of conditions and the following disclaimer.
|
|
|
10 |
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
|
11 |
* this list of conditions and the following disclaimer in the documentation
|
|
|
12 |
* and/or other materials provided with the distribution.
|
|
|
13 |
* 3. Neither the name of The TenDRA Project nor the names of its contributors
|
|
|
14 |
* may be used to endorse or promote products derived from this software
|
|
|
15 |
* without specific, prior written permission.
|
|
|
16 |
*
|
|
|
17 |
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS
|
|
|
18 |
* IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
|
|
|
19 |
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
|
20 |
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
|
|
|
21 |
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
|
22 |
* EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
|
23 |
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
|
|
|
24 |
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
|
|
25 |
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
|
|
|
26 |
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
|
|
27 |
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
28 |
*
|
|
|
29 |
* $Id$
|
|
|
30 |
*/
|
|
|
31 |
/*
|
| 2 |
7u83 |
32 |
Crown Copyright (c) 1997, 1998
|
| 6 |
7u83 |
33 |
|
| 2 |
7u83 |
34 |
This TenDRA(r) Computer Program is subject to Copyright
|
|
|
35 |
owned by the United Kingdom Secretary of State for Defence
|
|
|
36 |
acting through the Defence Evaluation and Research Agency
|
|
|
37 |
(DERA). It is made available to Recipients with a
|
|
|
38 |
royalty-free licence for its use, reproduction, transfer
|
|
|
39 |
to other parties and amendment for any purpose not excluding
|
|
|
40 |
product development provided that any such use et cetera
|
|
|
41 |
shall be deemed to be acceptance of the following conditions:-
|
| 6 |
7u83 |
42 |
|
| 2 |
7u83 |
43 |
(1) Its Recipients shall ensure that this Notice is
|
|
|
44 |
reproduced upon any copies or amended versions of it;
|
| 6 |
7u83 |
45 |
|
| 2 |
7u83 |
46 |
(2) Any amended version of it shall be clearly marked to
|
|
|
47 |
show both the nature of and the organisation responsible
|
|
|
48 |
for the relevant amendment or amendments;
|
| 6 |
7u83 |
49 |
|
| 2 |
7u83 |
50 |
(3) Its onward transfer from a recipient to another
|
|
|
51 |
party shall be deemed to be that party's acceptance of
|
|
|
52 |
these conditions;
|
| 6 |
7u83 |
53 |
|
| 2 |
7u83 |
54 |
(4) DERA gives no warranty or assurance as to its
|
|
|
55 |
quality or suitability for any purpose and DERA accepts
|
|
|
56 |
no liability whatsoever in relation to any use to which
|
|
|
57 |
it may be put.
|
|
|
58 |
*/
|
|
|
59 |
|
|
|
60 |
|
|
|
61 |
#ifndef PARSE_INCLUDED
|
|
|
62 |
#define PARSE_INCLUDED
|
|
|
63 |
|
|
|
64 |
|
|
|
65 |
/*
|
|
|
66 |
TYPE REPRESENTING A PARSER STATE
|
|
|
67 |
|
|
|
68 |
This type is used to represent the information to be saved before the
|
|
|
69 |
separate compilation of any saved preprocessing tokens and restored
|
|
|
70 |
afterwards.
|
|
|
71 |
*/
|
|
|
72 |
|
|
|
73 |
typedef struct pstate_tag {
|
| 6 |
7u83 |
74 |
LOCATION loc;
|
|
|
75 |
OPTIONS *opts;
|
|
|
76 |
int flag[10];
|
|
|
77 |
DECL_SPEC dspec[2];
|
|
|
78 |
NAMESPACE nspace[2];
|
|
|
79 |
STACK(NAMESPACE)nstack[3];
|
|
|
80 |
} PARSE_STATE;
|
| 2 |
7u83 |
81 |
|
|
|
82 |
|
|
|
83 |
/*
|
|
|
84 |
TOKEN EXPANSION STATES
|
|
|
85 |
|
|
|
86 |
These values are used as arguments to expand_token to indicate the
|
|
|
87 |
current parsing state.
|
|
|
88 |
*/
|
|
|
89 |
|
|
|
90 |
#define EXPAND_NORMAL 0
|
|
|
91 |
#define EXPAND_AHEAD 1
|
|
|
92 |
#define EXPAND_RESCAN 2
|
|
|
93 |
#define EXPAND_TEMPLATE 3
|
|
|
94 |
#define EXPAND_IDENTIFIER 4
|
|
|
95 |
#define EXPAND_COLON_COLON 5
|
|
|
96 |
#define EXPAND_CHECK_COLON 6
|
|
|
97 |
#define EXPAND_DESTRUCTOR 7
|
|
|
98 |
#define EXPAND_STRING 8
|
|
|
99 |
|
|
|
100 |
|
|
|
101 |
/*
|
|
|
102 |
TOKEN PARSER DECLARATIONS
|
|
|
103 |
|
|
|
104 |
The routines in this module are concerned with reading the next lexical
|
|
|
105 |
token from the input file. They include expand_token which is the top
|
|
|
106 |
level lexical analysis and preprocessing routine.
|
|
|
107 |
*/
|
|
|
108 |
|
| 6 |
7u83 |
109 |
extern void init_parser(PPTOKEN *);
|
|
|
110 |
extern int expand_token(int);
|
|
|
111 |
extern int expand_preproc(int);
|
|
|
112 |
extern void rescan_template(NAMESPACE);
|
|
|
113 |
extern PPTOKEN *patch_tokens(int);
|
|
|
114 |
extern PPTOKEN *restore_parser(void);
|
|
|
115 |
extern PPTOKEN *read_loc_tokens(PPTOKEN *);
|
|
|
116 |
extern void snip_tokens(PPTOKEN *, PPTOKEN *);
|
|
|
117 |
extern void save_state(PARSE_STATE *, int);
|
|
|
118 |
extern void restore_state(PARSE_STATE *);
|
|
|
119 |
extern int crt_state_depth;
|
| 2 |
7u83 |
120 |
|
|
|
121 |
|
|
|
122 |
/*
|
|
|
123 |
CURRENT TOKEN INFORMATION
|
|
|
124 |
|
|
|
125 |
These variables are used to store information about the current lexical
|
|
|
126 |
token as read by expand_token. crt_lex_token gives the current token
|
|
|
127 |
number, with any additional information being stored in crt_token.
|
|
|
128 |
last_lex_token gives the previous value of crt_lex_token. Finally
|
|
|
129 |
saved_lex_token is used as a temporary store in exception handling.
|
|
|
130 |
*/
|
|
|
131 |
|
| 6 |
7u83 |
132 |
extern PPTOKEN *crt_token;
|
|
|
133 |
extern NAMESPACE crt_lookup;
|
|
|
134 |
extern int crt_lex_token;
|
|
|
135 |
extern int saved_lex_token;
|
|
|
136 |
extern int last_lex_token;
|
|
|
137 |
extern int have_syntax_error;
|
| 2 |
7u83 |
138 |
|
|
|
139 |
|
|
|
140 |
/*
|
|
|
141 |
PARSER MACROS
|
|
|
142 |
|
|
|
143 |
These macros are used by the SID parser to access the output of the
|
|
|
144 |
lexical analysis and preprocessing routines. CURRENT_TERMINAL gives
|
|
|
145 |
the value of the current lexical token. ADVANCE_LEXER reads the next
|
|
|
146 |
lexical token. RESCAN_LEXER rescans the current token. SAVE_LEXER
|
|
|
147 |
and RESTORE_LEXER are used in exception handling.
|
|
|
148 |
*/
|
|
|
149 |
|
|
|
150 |
#define CURRENT_TERMINAL crt_lex_token
|
| 6 |
7u83 |
151 |
#define RESTORE_LEXER crt_lex_token = saved_lex_token;
|
|
|
152 |
#define next_token() expand_token(EXPAND_AHEAD)
|
|
|
153 |
#define RESCAN_LEXER crt_lex_token = expand_token(EXPAND_RESCAN)
|
| 2 |
7u83 |
154 |
|
| 6 |
7u83 |
155 |
#define ADVANCE_LEXER \
|
|
|
156 |
{ \
|
|
|
157 |
last_lex_token = crt_lex_token; \
|
|
|
158 |
crt_lex_token = expand_token(EXPAND_NORMAL); \
|
| 2 |
7u83 |
159 |
}
|
|
|
160 |
|
|
|
161 |
|
| 6 |
7u83 |
162 |
#define SAVE_LEXER(T) \
|
|
|
163 |
{ \
|
|
|
164 |
saved_lex_token = crt_lex_token; \
|
|
|
165 |
crt_lex_token = (T); \
|
| 2 |
7u83 |
166 |
}
|
|
|
167 |
|
|
|
168 |
|
|
|
169 |
#endif
|