Subversion Repositories tendra.SVN

Rev

Rev 2 | 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 
/*
7 7u83 31 
 *  AUTOMATICALLY GENERATED BY lexi VERSION 1.2
32 
 */
2 7u83 33 
 
34 
 
35 
/* LOOKUP TABLE */
36 
 
7 7u83 37 
static unsigned char lookup_tab[257] = {
2 7u83 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
7 7u83 71 
};
2 7u83 72 
 
73 
#ifndef LEX_EOF
7 7u83 74 
#define LEX_EOF		256
2 7u83 75 
#endif
76 
 
7 7u83 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)
2 7u83 82 
 
83 
 
84 
/* MAIN PASS ANALYSER */
85 
 
7 7u83 86 
int
87 
read_token(void)
2 7u83 88 
{
7 7u83 89 
    start: {
90 
	int c0 = read_char(), t0;
91 
	t0 = lookup_char(c0);
92 
	if (is_white(t0)) goto start;
93 
	switch (c0) {
94 
	    case '!': {
95 
		return(lex_exclaim);
2 7u83 96 
	    }
7 7u83 97 
	    case '"': {
98 
		return(get_string(c0));
2 7u83 99 
	    }
7 7u83 100 
	    case '#': {
101 
		return(get_comment(c0));
2 7u83 102 
	    }
7 7u83 103 
	    case '$': {
104 
		int c1 = read_char(), t1;
105 
		t1 = lookup_char(c1);
106 
		if (is_alpha(t1)) {
107 
		    return(get_variable(c0, c1));
2 7u83 108 
		}
7 7u83 109 
		unread_char(c1);
110 
		break;
2 7u83 111 
	    }
7 7u83 112 
	    case '%': {
113 
		int c1 = read_char();
114 
		if (c1 == '%') {
115 
		    return(get_text(c0, c1));
2 7u83 116 
		}
7 7u83 117 
		unread_char(c1);
118 
		break;
2 7u83 119 
	    }
7 7u83 120 
	    case '(': {
121 
		return(lex_open_Hround);
2 7u83 122 
	    }
7 7u83 123 
	    case ')': {
124 
		return(lex_close_Hround);
2 7u83 125 
	    }
7 7u83 126 
	    case '*': {
127 
		return(lex_star);
2 7u83 128 
	    }
7 7u83 129 
	    case '+': {
130 
		int c1 = read_char(), t1;
131 
		t1 = lookup_char(c1);
132 
		if (is_alpha(t1)) {
133 
		    return(get_command(c0, c1));
2 7u83 134 
		}
7 7u83 135 
		unread_char(c1);
136 
		break;
2 7u83 137 
	    }
7 7u83 138 
	    case ',': {
139 
		return(lex_comma);
2 7u83 140 
	    }
7 7u83 141 
	    case '-': {
142 
		return(lex_minus);
2 7u83 143 
	    }
7 7u83 144 
	    case '.': {
145 
		int c1 = read_char();
146 
		if (c1 == '.') {
147 
		    int c2 = read_char();
148 
		    if (c2 == '.') {
149 
			return(lex_ellipsis);
2 7u83 150 
		    }
7 7u83 151 
		    unread_char(c2);
152 
		    return(lex_dot_Hdot);
2 7u83 153 
		}
7 7u83 154 
		unread_char(c1);
155 
		return(lex_dot);
2 7u83 156 
	    }
7 7u83 157 
	    case '/': {
158 
		int c1 = read_char();
159 
		if (c1 == '*') {
160 
		    return(get_c_comment(c0, c1));
2 7u83 161 
		}
7 7u83 162 
		unread_char(c1);
163 
		break;
2 7u83 164 
	    }
7 7u83 165 
	    case ':': {
166 
		int c1 = read_char();
167 
		if (c1 == '=') {
168 
		    return(lex_assign);
2 7u83 169 
		}
7 7u83 170 
		unread_char(c1);
171 
		return(lex_colon);
2 7u83 172 
	    }
7 7u83 173 
	    case ';': {
174 
		return(lex_semicolon);
2 7u83 175 
	    }
7 7u83 176 
	    case '=': {
177 
		return(lex_equal);
2 7u83 178 
	    }
7 7u83 179 
	    case '?': {
180 
		return(lex_question);
2 7u83 181 
	    }
7 7u83 182 
	    case '[': {
183 
		return(lex_open_Hsquare);
2 7u83 184 
	    }
7 7u83 185 
	    case ']': {
186 
		return(lex_close_Hsquare);
2 7u83 187 
	    }
7 7u83 188 
	    case '{': {
189 
		return(lex_open_Hbrace);
2 7u83 190 
	    }
7 7u83 191 
	    case '|': {
192 
		return(lex_or);
2 7u83 193 
	    }
7 7u83 194 
	    case '}': {
195 
		return(lex_close_Hbrace);
2 7u83 196 
	    }
7 7u83 197 
	    case '~': {
198 
		int c1 = read_char(), t1;
199 
		t1 = lookup_char(c1);
200 
		if (is_alpha(t1)) {
201 
		    return(get_local(c0, c1));
2 7u83 202 
		}
7 7u83 203 
		unread_char(c1);
204 
		break;
2 7u83 205 
	    }
7 7u83 206 
	    case LEX_EOF: {
207 
		return(lex_eof);
2 7u83 208 
	    }
209 
	}
7 7u83 210 
	if (is_alpha(t0)) {
211 
	    return(get_global(c0));
212 
	} else if (is_digit(t0)) {
213 
	    return(get_number(c0));
2 7u83 214 
	}
7 7u83 215 
	return(unknown_token(c0));
2 7u83 216 
    }
217 
}