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;
213 if (c < '0' || '7' < c) {
217 v = (v << 3) + c - '0';
226 static uint16_t lex_class;
235 lex_class = ENDOFFILE;
239 lex_class = lex_classes[c];
240 if (lex_class & BACKSLASH) {
243 lex_class = ENDOFFILE;
245 lex_class = PRINTABLE;
248 } while (lex_class & IGNORE);
252 #define AO_LISP_TOKEN_MAX 32
254 static char token_string[AO_LISP_TOKEN_MAX];
255 static int token_int;
256 static int token_len;
258 static inline void add_token(int c) {
259 if (c && token_len < AO_LISP_TOKEN_MAX - 1)
260 token_string[token_len++] = c;
263 static inline void end_token(void) {
264 token_string[token_len] = '\0';
275 if (lex_class & ENDOFFILE)
280 if (lex_class & WHITE)
283 if (lex_class & (BRA|KET|QUOTEC)) {
295 if (lex_class & TWIDDLE) {
299 if (lex_class & STRINGC) {
304 if (lex_class & (STRINGC|ENDOFFILE)) {
311 if (lex_class & PRINTABLE) {
321 if (!(lex_class & NUMBER)) {
324 if (token_len != 0 &&
331 if (lex_class & DIGIT) {
334 token_int = token_int * 10 + c - '0';
341 if (lex_class & (NOTNAME)) {
342 // if (lex_class & ENDOFFILE)
346 if (isnum && hasdigit) {
348 token_int = -token_int;
359 static int parse_token;
360 static uint8_t been_here;
361 static struct ao_lisp_cons *read_cons;
362 static struct ao_lisp_cons *read_cons_tail;
363 static struct ao_lisp_cons *read_stack;
368 struct ao_lisp_atom *atom;
374 ao_lisp_root_add(&ao_lisp_cons_type, &read_cons);
375 ao_lisp_root_add(&ao_lisp_cons_type, &read_cons_tail);
376 ao_lisp_root_add(&ao_lisp_cons_type, &read_stack);
380 read_cons = read_cons_tail = read_stack = 0;
382 while (parse_token == OPEN) {
384 read_stack = ao_lisp_cons(ao_lisp_cons_poly(read_cons), read_stack);
386 read_cons_tail = NULL;
390 switch (parse_token) {
396 atom = ao_lisp_atom_intern(token_string);
398 v = ao_lisp_atom_poly(atom);
403 v = ao_lisp_int_poly(token_int);
406 string = ao_lisp_string_copy(token_string);
408 v = ao_lisp_string_poly(string);
414 v = ao_lisp_cons_poly(read_cons);
418 read_cons = ao_lisp_poly_cons(read_stack->car);
419 read_stack = read_stack->cdr;
420 for (read_cons_tail = read_cons;
421 read_cons_tail && read_cons_tail->cdr;
422 read_cons_tail = read_cons_tail->cdr)
431 struct ao_lisp_cons *read = ao_lisp_cons(v, NULL);
433 read_cons_tail->cdr = read;
436 read_cons_tail = read;