2 * Copyright © 2016 Keith Packard <keithp@keithp.com>
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation, either version 2 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful, but
10 * WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * General Public License for more details.
16 #include "ao_lisp_read.h"
18 static const uint16_t lex_classes[128] = {
51 PRINTABLE|WHITE, /* */
53 PRINTABLE|STRINGC, /* " */
54 PRINTABLE|COMMENT, /* # */
58 PRINTABLE|QUOTEC, /* ' */
59 PRINTABLE|BRA, /* ( */
60 PRINTABLE|KET, /* ) */
62 PRINTABLE|SIGN, /* + */
64 PRINTABLE|SIGN, /* - */
67 PRINTABLE|DIGIT, /* 0 */
68 PRINTABLE|DIGIT, /* 1 */
69 PRINTABLE|DIGIT, /* 2 */
70 PRINTABLE|DIGIT, /* 3 */
71 PRINTABLE|DIGIT, /* 4 */
72 PRINTABLE|DIGIT, /* 5 */
73 PRINTABLE|DIGIT, /* 6 */
74 PRINTABLE|DIGIT, /* 7 */
75 PRINTABLE|DIGIT, /* 8 */
76 PRINTABLE|DIGIT, /* 9 */
78 PRINTABLE|COMMENT, /* ; */
111 PRINTABLE|BACKSLASH, /* \ */
143 PRINTABLE|VBAR, /* | */
145 PRINTABLE|TWIDDLE, /* ~ */
149 static int lex_unget_c;
160 static uint8_t at_eol;
226 if (c < '0' || '7' < c) {
230 v = (v << 3) + c - '0';
239 static uint16_t lex_class;
248 lex_class = ENDOFFILE;
252 lex_class = lex_classes[c];
253 if (lex_class & BACKSLASH) {
256 lex_class = ENDOFFILE;
258 lex_class = PRINTABLE;
261 } while (lex_class & IGNORE);
265 #define AO_LISP_TOKEN_MAX 32
267 static char token_string[AO_LISP_TOKEN_MAX];
268 static int token_int;
269 static int token_len;
271 static inline void add_token(int c) {
272 if (c && token_len < AO_LISP_TOKEN_MAX - 1)
273 token_string[token_len++] = c;
276 static inline void end_token(void) {
277 token_string[token_len] = '\0';
288 if (lex_class & ENDOFFILE)
293 if (lex_class & WHITE)
296 if (lex_class & (BRA|KET|QUOTEC)) {
308 if (lex_class & TWIDDLE) {
312 if (lex_class & STRINGC) {
317 if (lex_class & (STRINGC|ENDOFFILE)) {
324 if (lex_class & PRINTABLE) {
334 if (!(lex_class & NUMBER)) {
337 if (token_len != 0 &&
344 if (lex_class & DIGIT) {
347 token_int = token_int * 10 + c - '0';
354 if (lex_class & (NOTNAME)) {
355 // if (lex_class & ENDOFFILE)
359 if (isnum && hasdigit) {
361 token_int = -token_int;
372 static int parse_token;
373 static uint8_t been_here;
374 static struct ao_lisp_cons *read_cons;
375 static struct ao_lisp_cons *read_cons_tail;
376 static struct ao_lisp_cons *read_stack;
381 struct ao_lisp_atom *atom;
387 ao_lisp_root_add(&ao_lisp_cons_type, &read_cons);
388 ao_lisp_root_add(&ao_lisp_cons_type, &read_cons_tail);
389 ao_lisp_root_add(&ao_lisp_cons_type, &read_stack);
393 read_cons = read_cons_tail = read_stack = 0;
395 while (parse_token == OPEN) {
397 read_stack = ao_lisp_cons_cons(ao_lisp_cons_poly(read_cons), read_stack);
399 read_cons_tail = NULL;
403 switch (parse_token) {
409 atom = ao_lisp_atom_intern(token_string);
411 v = ao_lisp_atom_poly(atom);
416 v = ao_lisp_int_poly(token_int);
419 string = ao_lisp_string_copy(token_string);
421 v = ao_lisp_string_poly(string);
427 v = ao_lisp_cons_poly(read_cons);
431 read_cons = ao_lisp_poly_cons(read_stack->car);
432 read_stack = ao_lisp_poly_cons(read_stack->cdr);
433 for (read_cons_tail = read_cons;
434 read_cons_tail && read_cons_tail->cdr;
435 read_cons_tail = ao_lisp_poly_cons(read_cons_tail->cdr))
444 struct ao_lisp_cons *read = ao_lisp_cons_cons(v, NULL);
446 read_cons_tail->cdr = ao_lisp_cons_poly(read);
449 read_cons_tail = read;