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, /* - */
65 PRINTABLE|DOTC, /* . */
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;
210 if (c < '0' || '7' < c) {
214 v = (v << 3) + c - '0';
223 static uint16_t lex_class;
232 lex_class = ENDOFFILE;
236 lex_class = lex_classes[c];
237 if (lex_class & BACKSLASH) {
240 lex_class = ENDOFFILE;
242 lex_class = PRINTABLE;
245 } while (lex_class & IGNORE);
249 #define AO_LISP_TOKEN_MAX 32
251 static char token_string[AO_LISP_TOKEN_MAX];
252 static int token_int;
253 static int token_len;
255 static inline void add_token(int c) {
256 if (c && token_len < AO_LISP_TOKEN_MAX - 1)
257 token_string[token_len++] = c;
260 static inline void end_token(void) {
261 token_string[token_len] = '\0';
272 if (lex_class & ENDOFFILE)
275 if (lex_class & WHITE)
278 if (lex_class & COMMENT) {
279 while ((c = lexc()) != '\n') {
280 if (lex_class & ENDOFFILE)
286 if (lex_class & (BRA|KET|QUOTEC)) {
298 if (lex_class & (DOTC)) {
303 if (lex_class & TWIDDLE) {
307 if (lex_class & STRINGC) {
310 if (lex_class & (STRINGC|ENDOFFILE)) {
317 if (lex_class & PRINTABLE) {
327 if (!(lex_class & NUMBER)) {
330 if (token_len != 0 &&
337 if (lex_class & DIGIT) {
340 token_int = token_int * 10 + c - '0';
345 if (lex_class & (NOTNAME)) {
346 // if (lex_class & ENDOFFILE)
350 if (isnum && hasdigit) {
352 token_int = -token_int;
363 static inline int lex(void)
365 int parse_token = _lex();
366 DBGI("token %d (%s)\n", parse_token, token_string);
370 static int parse_token;
372 struct ao_lisp_cons *ao_lisp_read_cons;
373 struct ao_lisp_cons *ao_lisp_read_cons_tail;
374 struct ao_lisp_cons *ao_lisp_read_stack;
376 #define READ_IN_QUOTE 0x01
377 #define READ_SAW_DOT 0x02
378 #define READ_DONE_DOT 0x04
381 push_read_stack(int cons, int read_state)
383 DBGI("push read stack %p 0x%x\n", ao_lisp_read_cons, read_state);
386 ao_lisp_read_stack = ao_lisp_cons_cons(ao_lisp_cons_poly(ao_lisp_read_cons),
387 ao_lisp__cons(ao_lisp_int_poly(read_state),
388 ao_lisp_cons_poly(ao_lisp_read_stack)));
389 if (!ao_lisp_read_stack)
392 ao_lisp_read_cons = NULL;
393 ao_lisp_read_cons_tail = NULL;
398 pop_read_stack(int cons)
402 ao_lisp_read_cons = ao_lisp_poly_cons(ao_lisp_read_stack->car);
403 ao_lisp_read_stack = ao_lisp_poly_cons(ao_lisp_read_stack->cdr);
404 read_state = ao_lisp_poly_int(ao_lisp_read_stack->car);
405 ao_lisp_read_stack = ao_lisp_poly_cons(ao_lisp_read_stack->cdr);
406 for (ao_lisp_read_cons_tail = ao_lisp_read_cons;
407 ao_lisp_read_cons_tail && ao_lisp_read_cons_tail->cdr;
408 ao_lisp_read_cons_tail = ao_lisp_poly_cons(ao_lisp_read_cons_tail->cdr))
411 ao_lisp_read_cons = 0;
412 ao_lisp_read_cons_tail = 0;
413 ao_lisp_read_stack = 0;
416 DBGI("pop read stack %p %d\n", ao_lisp_read_cons, read_state);
423 struct ao_lisp_atom *atom;
432 ao_lisp_read_cons = ao_lisp_read_cons_tail = ao_lisp_read_stack = 0;
435 while (parse_token == OPEN) {
436 if (!push_read_stack(cons, read_state))
443 switch (parse_token) {
447 ao_lisp_error(AO_LISP_EOF, "unexpected end of file");
448 return _ao_lisp_atom_eof;
451 atom = ao_lisp_atom_intern(token_string);
453 v = ao_lisp_atom_poly(atom);
458 v = ao_lisp_int_poly(token_int);
461 string = ao_lisp_string_copy(token_string);
463 v = ao_lisp_string_poly(string);
468 if (!push_read_stack(cons, read_state))
471 read_state |= READ_IN_QUOTE;
472 v = _ao_lisp_atom_quote;
479 v = ao_lisp_cons_poly(ao_lisp_read_cons);
481 read_state = pop_read_stack(cons);
485 ao_lisp_error(AO_LISP_INVALID, ". outside of cons");
488 if (!ao_lisp_read_cons) {
489 ao_lisp_error(AO_LISP_INVALID, ". first in cons");
492 read_state |= READ_SAW_DOT;
496 /* loop over QUOTE ends */
501 if (read_state & READ_DONE_DOT) {
502 ao_lisp_error(AO_LISP_INVALID, ". not last in cons");
506 if (read_state & READ_SAW_DOT) {
507 read_state |= READ_DONE_DOT;
508 ao_lisp_read_cons_tail->cdr = v;
510 struct ao_lisp_cons *read = ao_lisp_cons_cons(v, AO_LISP_NIL);
514 if (ao_lisp_read_cons_tail)
515 ao_lisp_read_cons_tail->cdr = ao_lisp_cons_poly(read);
517 ao_lisp_read_cons = read;
518 ao_lisp_read_cons_tail = read;
521 if (!(read_state & READ_IN_QUOTE) || !ao_lisp_read_cons->cdr)
524 v = ao_lisp_cons_poly(ao_lisp_read_cons);
526 read_state = pop_read_stack(cons);