db_lex.c revision 1.8 1 1.8 christos /* $NetBSD: db_lex.c,v 1.8 1996/02/05 01:57:05 christos Exp $ */
2 1.4 cgd
3 1.1 cgd /*
4 1.1 cgd * Mach Operating System
5 1.1 cgd * Copyright (c) 1991,1990 Carnegie Mellon University
6 1.1 cgd * All Rights Reserved.
7 1.1 cgd *
8 1.1 cgd * Permission to use, copy, modify and distribute this software and its
9 1.1 cgd * documentation is hereby granted, provided that both the copyright
10 1.1 cgd * notice and this permission notice appear in all copies of the
11 1.1 cgd * software, derivative works or modified versions, and any portions
12 1.1 cgd * thereof, and that both notices appear in supporting documentation.
13 1.1 cgd *
14 1.1 cgd * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS
15 1.1 cgd * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
16 1.1 cgd * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
17 1.1 cgd *
18 1.1 cgd * Carnegie Mellon requests users of this software to return to
19 1.1 cgd *
20 1.1 cgd * Software Distribution Coordinator or Software.Distribution (at) CS.CMU.EDU
21 1.1 cgd * School of Computer Science
22 1.1 cgd * Carnegie Mellon University
23 1.1 cgd * Pittsburgh PA 15213-3890
24 1.1 cgd *
25 1.1 cgd * any improvements or extensions that they make and grant Carnegie the
26 1.1 cgd * rights to redistribute these changes.
27 1.2 cgd *
28 1.1 cgd * Author: David B. Golub, Carnegie Mellon University
29 1.1 cgd * Date: 7/90
30 1.1 cgd */
31 1.3 mycroft
32 1.1 cgd /*
33 1.1 cgd * Lexical analyzer.
34 1.1 cgd */
35 1.5 mycroft #include <sys/param.h>
36 1.5 mycroft
37 1.8 christos #include <machine/db_machdep.h>
38 1.8 christos
39 1.1 cgd #include <ddb/db_lex.h>
40 1.8 christos #include <ddb/db_output.h>
41 1.8 christos #include <ddb/db_command.h>
42 1.8 christos #include <ddb/db_sym.h>
43 1.8 christos #include <ddb/db_extern.h>
44 1.1 cgd
45 1.1 cgd char db_line[120];
46 1.1 cgd char * db_lp, *db_endlp;
47 1.1 cgd
48 1.1 cgd int
49 1.1 cgd db_read_line()
50 1.1 cgd {
51 1.1 cgd int i;
52 1.1 cgd
53 1.1 cgd i = db_readline(db_line, sizeof(db_line));
54 1.1 cgd if (i == 0)
55 1.1 cgd return (0); /* EOI */
56 1.1 cgd db_lp = db_line;
57 1.1 cgd db_endlp = db_lp + i;
58 1.1 cgd return (i);
59 1.1 cgd }
60 1.1 cgd
61 1.1 cgd void
62 1.1 cgd db_flush_line()
63 1.1 cgd {
64 1.1 cgd db_lp = db_line;
65 1.1 cgd db_endlp = db_line;
66 1.1 cgd }
67 1.1 cgd
68 1.1 cgd int db_look_char = 0;
69 1.1 cgd
70 1.1 cgd int
71 1.1 cgd db_read_char()
72 1.1 cgd {
73 1.1 cgd int c;
74 1.1 cgd
75 1.1 cgd if (db_look_char != 0) {
76 1.1 cgd c = db_look_char;
77 1.1 cgd db_look_char = 0;
78 1.1 cgd }
79 1.1 cgd else if (db_lp >= db_endlp)
80 1.1 cgd c = -1;
81 1.1 cgd else
82 1.1 cgd c = *db_lp++;
83 1.1 cgd return (c);
84 1.1 cgd }
85 1.1 cgd
86 1.1 cgd void
87 1.1 cgd db_unread_char(c)
88 1.5 mycroft int c;
89 1.1 cgd {
90 1.1 cgd db_look_char = c;
91 1.1 cgd }
92 1.1 cgd
93 1.1 cgd int db_look_token = 0;
94 1.1 cgd
95 1.1 cgd void
96 1.1 cgd db_unread_token(t)
97 1.1 cgd int t;
98 1.1 cgd {
99 1.1 cgd db_look_token = t;
100 1.1 cgd }
101 1.1 cgd
102 1.1 cgd int
103 1.1 cgd db_read_token()
104 1.1 cgd {
105 1.1 cgd int t;
106 1.1 cgd
107 1.1 cgd if (db_look_token) {
108 1.1 cgd t = db_look_token;
109 1.1 cgd db_look_token = 0;
110 1.1 cgd }
111 1.1 cgd else
112 1.1 cgd t = db_lex();
113 1.1 cgd return (t);
114 1.1 cgd }
115 1.1 cgd
116 1.1 cgd int db_radix = 16;
117 1.1 cgd
118 1.1 cgd void
119 1.1 cgd db_flush_lex()
120 1.1 cgd {
121 1.1 cgd db_flush_line();
122 1.1 cgd db_look_char = 0;
123 1.1 cgd db_look_token = 0;
124 1.1 cgd }
125 1.1 cgd
126 1.1 cgd int
127 1.1 cgd db_lex()
128 1.1 cgd {
129 1.1 cgd int c;
130 1.1 cgd
131 1.1 cgd c = db_read_char();
132 1.1 cgd while (c <= ' ' || c > '~') {
133 1.1 cgd if (c == '\n' || c == -1)
134 1.1 cgd return (tEOL);
135 1.1 cgd c = db_read_char();
136 1.1 cgd }
137 1.1 cgd
138 1.1 cgd if (c >= '0' && c <= '9') {
139 1.1 cgd /* number */
140 1.8 christos int r, digit = 0;
141 1.1 cgd
142 1.1 cgd if (c > '0')
143 1.1 cgd r = db_radix;
144 1.1 cgd else {
145 1.1 cgd c = db_read_char();
146 1.1 cgd if (c == 'O' || c == 'o')
147 1.1 cgd r = 8;
148 1.1 cgd else if (c == 'T' || c == 't')
149 1.1 cgd r = 10;
150 1.1 cgd else if (c == 'X' || c == 'x')
151 1.1 cgd r = 16;
152 1.1 cgd else {
153 1.1 cgd r = db_radix;
154 1.1 cgd db_unread_char(c);
155 1.1 cgd }
156 1.1 cgd c = db_read_char();
157 1.1 cgd }
158 1.1 cgd db_tok_number = 0;
159 1.1 cgd for (;;) {
160 1.1 cgd if (c >= '0' && c <= ((r == 8) ? '7' : '9'))
161 1.1 cgd digit = c - '0';
162 1.1 cgd else if (r == 16 && ((c >= 'A' && c <= 'F') ||
163 1.1 cgd (c >= 'a' && c <= 'f'))) {
164 1.1 cgd if (c >= 'a')
165 1.1 cgd digit = c - 'a' + 10;
166 1.1 cgd else if (c >= 'A')
167 1.1 cgd digit = c - 'A' + 10;
168 1.1 cgd }
169 1.1 cgd else
170 1.1 cgd break;
171 1.1 cgd db_tok_number = db_tok_number * r + digit;
172 1.1 cgd c = db_read_char();
173 1.1 cgd }
174 1.1 cgd if ((c >= '0' && c <= '9') ||
175 1.1 cgd (c >= 'A' && c <= 'Z') ||
176 1.1 cgd (c >= 'a' && c <= 'z') ||
177 1.1 cgd (c == '_'))
178 1.1 cgd {
179 1.1 cgd db_error("Bad character in number\n");
180 1.7 mycroft /*NOTREACHED*/
181 1.1 cgd }
182 1.1 cgd db_unread_char(c);
183 1.1 cgd return (tNUMBER);
184 1.1 cgd }
185 1.1 cgd if ((c >= 'A' && c <= 'Z') ||
186 1.1 cgd (c >= 'a' && c <= 'z') ||
187 1.1 cgd c == '_' || c == '\\')
188 1.1 cgd {
189 1.1 cgd /* string */
190 1.1 cgd char *cp;
191 1.1 cgd
192 1.1 cgd cp = db_tok_string;
193 1.1 cgd if (c == '\\') {
194 1.1 cgd c = db_read_char();
195 1.7 mycroft if (c == '\n' || c == -1) {
196 1.1 cgd db_error("Bad escape\n");
197 1.7 mycroft /*NOTREACHED*/
198 1.7 mycroft }
199 1.1 cgd }
200 1.1 cgd *cp++ = c;
201 1.1 cgd while (1) {
202 1.1 cgd c = db_read_char();
203 1.1 cgd if ((c >= 'A' && c <= 'Z') ||
204 1.1 cgd (c >= 'a' && c <= 'z') ||
205 1.1 cgd (c >= '0' && c <= '9') ||
206 1.1 cgd c == '_' || c == '\\' || c == ':')
207 1.1 cgd {
208 1.1 cgd if (c == '\\') {
209 1.1 cgd c = db_read_char();
210 1.7 mycroft if (c == '\n' || c == -1) {
211 1.1 cgd db_error("Bad escape\n");
212 1.7 mycroft /*NOTREACHED*/
213 1.7 mycroft }
214 1.1 cgd }
215 1.1 cgd *cp++ = c;
216 1.1 cgd if (cp == db_tok_string+sizeof(db_tok_string)) {
217 1.1 cgd db_error("String too long\n");
218 1.7 mycroft /*NOTREACHED*/
219 1.1 cgd }
220 1.1 cgd continue;
221 1.1 cgd }
222 1.1 cgd else {
223 1.1 cgd *cp = '\0';
224 1.1 cgd break;
225 1.1 cgd }
226 1.1 cgd }
227 1.1 cgd db_unread_char(c);
228 1.1 cgd return (tIDENT);
229 1.1 cgd }
230 1.1 cgd
231 1.1 cgd switch (c) {
232 1.1 cgd case '+':
233 1.1 cgd return (tPLUS);
234 1.1 cgd case '-':
235 1.1 cgd return (tMINUS);
236 1.1 cgd case '.':
237 1.1 cgd c = db_read_char();
238 1.1 cgd if (c == '.')
239 1.1 cgd return (tDOTDOT);
240 1.1 cgd db_unread_char(c);
241 1.1 cgd return (tDOT);
242 1.1 cgd case '*':
243 1.1 cgd return (tSTAR);
244 1.1 cgd case '/':
245 1.1 cgd return (tSLASH);
246 1.1 cgd case '=':
247 1.1 cgd return (tEQ);
248 1.1 cgd case '%':
249 1.1 cgd return (tPCT);
250 1.1 cgd case '#':
251 1.1 cgd return (tHASH);
252 1.1 cgd case '(':
253 1.1 cgd return (tLPAREN);
254 1.1 cgd case ')':
255 1.1 cgd return (tRPAREN);
256 1.1 cgd case ',':
257 1.1 cgd return (tCOMMA);
258 1.1 cgd case '"':
259 1.1 cgd return (tDITTO);
260 1.1 cgd case '$':
261 1.1 cgd return (tDOLLAR);
262 1.1 cgd case '!':
263 1.1 cgd return (tEXCL);
264 1.1 cgd case '<':
265 1.1 cgd c = db_read_char();
266 1.1 cgd if (c == '<')
267 1.1 cgd return (tSHIFT_L);
268 1.1 cgd db_unread_char(c);
269 1.1 cgd break;
270 1.1 cgd case '>':
271 1.1 cgd c = db_read_char();
272 1.1 cgd if (c == '>')
273 1.1 cgd return (tSHIFT_R);
274 1.1 cgd db_unread_char(c);
275 1.1 cgd break;
276 1.1 cgd case -1:
277 1.1 cgd return (tEOF);
278 1.1 cgd }
279 1.1 cgd db_printf("Bad character\n");
280 1.1 cgd db_flush_lex();
281 1.1 cgd return (tEOF);
282 1.1 cgd }
283