Subversion Repositories tendra.SVN

Rev

Rev 2 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
2 7u83 1
/*
2
    		 Crown Copyright (c) 1997
3
 
4
    This TenDRA(r) Computer Program is subject to Copyright
5
    owned by the United Kingdom Secretary of State for Defence
6
    acting through the Defence Evaluation and Research Agency
7
    (DERA).  It is made available to Recipients with a
8
    royalty-free licence for its use, reproduction, transfer
9
    to other parties and amendment for any purpose not excluding
10
    product development provided that any such use et cetera
11
    shall be deemed to be acceptance of the following conditions:-
12
 
13
        (1) Its Recipients shall ensure that this Notice is
14
        reproduced upon any copies or amended versions of it;
15
 
16
        (2) Any amended version of it shall be clearly marked to
17
        show both the nature of and the organisation responsible
18
        for the relevant amendment or amendments;
19
 
20
        (3) Its onward transfer from a recipient to another
21
        party shall be deemed to be that party's acceptance of
22
        these conditions;
23
 
24
        (4) DERA gives no warranty or assurance as to its
25
        quality or suitability for any purpose and DERA accepts
26
        no liability whatsoever in relation to any use to which
27
        it may be put.
28
*/
29
 
30
/*
31
    AUTOMATICALLY GENERATED BY lexi VERSION 1.1
32
*/
33
 
34
 
35
/* LOOKUP TABLE */
36
 
37
static unsigned char lookup_tab [257] = {
38
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
39
    0x0000, 0x0001, 0x0001, 0x0000, 0x0000, 0x0001, 0x0000, 0x0000,
40
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
41
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
42
    0x0001, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
43
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
44
    0x000c, 0x000c, 0x000c, 0x000c, 0x000c, 0x000c, 0x000c, 0x000c,
45
    0x000c, 0x000c, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
46
    0x0000, 0x000a, 0x000a, 0x000a, 0x000a, 0x000a, 0x000a, 0x000a,
47
    0x000a, 0x000a, 0x000a, 0x000a, 0x000a, 0x000a, 0x000a, 0x000a,
48
    0x000a, 0x000a, 0x000a, 0x000a, 0x000a, 0x000a, 0x000a, 0x000a,
49
    0x000a, 0x000a, 0x000a, 0x0000, 0x0000, 0x0000, 0x0000, 0x000a,
50
    0x0000, 0x000a, 0x000a, 0x000a, 0x000a, 0x000a, 0x000a, 0x000a,
51
    0x000a, 0x000a, 0x000a, 0x000a, 0x000a, 0x000a, 0x000a, 0x000a,
52
    0x000a, 0x000a, 0x000a, 0x000a, 0x000a, 0x000a, 0x000a, 0x000a,
53
    0x000a, 0x000a, 0x000a, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
54
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
55
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
56
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
57
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
58
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
59
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
60
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
61
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
62
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
63
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
64
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
65
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
66
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
67
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
68
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
69
    0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
70
    0x0000
71
} ;
72
 
73
#ifndef LEX_EOF
74
#define LEX_EOF			256
75
#endif
76
 
77
#define lookup_char( C )	( ( int ) lookup_tab [ ( C ) ] )
78
#define is_white( T )		( ( T ) & 0x0001 )
79
#define is_alpha( T )		( ( T ) & 0x0002 )
80
#define is_digit( T )		( ( T ) & 0x0004 )
81
#define is_alphanum( T )	( ( T ) & 0x0008 )
82
 
83
#ifndef PROTO_Z
84
#ifdef __STDC__
85
#define PROTO_Z()		( void )
86
#else
87
#define PROTO_Z()		()
88
#endif
89
#endif
90
 
91
 
92
/* MAIN PASS ANALYSER */
93
 
94
int read_token PROTO_Z ()
95
{
96
    start : {
97
	int c0 = read_char (), t0 ;
98
	t0 = lookup_char ( c0 ) ;
99
	if ( is_white ( t0 ) ) goto start ;
100
	switch ( c0 ) {
101
	    case '!' : {
102
		return ( lex_exclaim ) ;
103
	    }
104
	    case '"' : {
105
		return ( get_string ( c0 ) ) ;
106
	    }
107
	    case '#' : {
108
		return ( get_comment ( c0 ) ) ;
109
	    }
110
	    case '$' : {
111
		int c1 = read_char (), t1 ;
112
		t1 = lookup_char ( c1 ) ;
113
		if ( is_alpha ( t1 ) ) {
114
		    return ( get_variable ( c0, c1 ) ) ;
115
		}
116
		unread_char ( c1 ) ;
117
		break ;
118
	    }
119
	    case '%' : {
120
		int c1 = read_char () ;
121
		if ( c1 == '%' ) {
122
		    return ( get_text ( c0, c1 ) ) ;
123
		}
124
		unread_char ( c1 ) ;
125
		break ;
126
	    }
127
	    case '(' : {
128
		return ( lex_open_Hround ) ;
129
	    }
130
	    case ')' : {
131
		return ( lex_close_Hround ) ;
132
	    }
133
	    case '*' : {
134
		return ( lex_star ) ;
135
	    }
136
	    case '+' : {
137
		int c1 = read_char (), t1 ;
138
		t1 = lookup_char ( c1 ) ;
139
		if ( is_alpha ( t1 ) ) {
140
		    return ( get_command ( c0, c1 ) ) ;
141
		}
142
		unread_char ( c1 ) ;
143
		break ;
144
	    }
145
	    case ',' : {
146
		return ( lex_comma ) ;
147
	    }
148
	    case '-' : {
149
		return ( lex_minus ) ;
150
	    }
151
	    case '.' : {
152
		int c1 = read_char () ;
153
		if ( c1 == '.' ) {
154
		    int c2 = read_char () ;
155
		    if ( c2 == '.' ) {
156
			return ( lex_ellipsis ) ;
157
		    }
158
		    unread_char ( c2 ) ;
159
		    return ( lex_dot_Hdot ) ;
160
		}
161
		unread_char ( c1 ) ;
162
		return ( lex_dot ) ;
163
	    }
164
	    case '/' : {
165
		int c1 = read_char () ;
166
		if ( c1 == '*' ) {
167
		    return ( get_c_comment ( c0, c1 ) ) ;
168
		}
169
		unread_char ( c1 ) ;
170
		break ;
171
	    }
172
	    case ':' : {
173
		int c1 = read_char () ;
174
		if ( c1 == '=' ) {
175
		    return ( lex_assign ) ;
176
		}
177
		unread_char ( c1 ) ;
178
		return ( lex_colon ) ;
179
	    }
180
	    case ';' : {
181
		return ( lex_semicolon ) ;
182
	    }
183
	    case '=' : {
184
		return ( lex_equal ) ;
185
	    }
186
	    case '?' : {
187
		return ( lex_question ) ;
188
	    }
189
	    case '[' : {
190
		return ( lex_open_Hsquare ) ;
191
	    }
192
	    case ']' : {
193
		return ( lex_close_Hsquare ) ;
194
	    }
195
	    case '{' : {
196
		return ( lex_open_Hbrace ) ;
197
	    }
198
	    case '|' : {
199
		return ( lex_or ) ;
200
	    }
201
	    case '}' : {
202
		return ( lex_close_Hbrace ) ;
203
	    }
204
	    case '~' : {
205
		int c1 = read_char (), t1 ;
206
		t1 = lookup_char ( c1 ) ;
207
		if ( is_alpha ( t1 ) ) {
208
		    return ( get_local ( c0, c1 ) ) ;
209
		}
210
		unread_char ( c1 ) ;
211
		break ;
212
	    }
213
	    case LEX_EOF : {
214
		return ( lex_eof ) ;
215
	    }
216
	}
217
	if ( is_alpha ( t0 ) ) {
218
	    return ( get_global ( c0 ) ) ;
219
	} else if ( is_digit ( t0 ) ) {
220
	    return ( get_number ( c0 ) ) ;
221
	}
222
	return ( unknown_token ( c0 ) ) ;
223
    }
224
}