* General Public License for more details.
*/
-#define DBG_EVAL 0
#include "ao_lisp.h"
#include "ao_lisp_read.h"
PRINTABLE|WHITE, /* */
PRINTABLE, /* ! */
PRINTABLE|STRINGC, /* " */
- PRINTABLE|COMMENT, /* # */
+ PRINTABLE|POUND, /* # */
PRINTABLE, /* $ */
PRINTABLE, /* % */
PRINTABLE, /* & */
- PRINTABLE|QUOTEC, /* ' */
- PRINTABLE|BRA, /* ( */
- PRINTABLE|KET, /* ) */
+ PRINTABLE|SPECIAL, /* ' */
+ PRINTABLE|SPECIAL, /* ( */
+ PRINTABLE|SPECIAL, /* ) */
PRINTABLE, /* * */
PRINTABLE|SIGN, /* + */
PRINTABLE, /* , */
PRINTABLE|SIGN, /* - */
- PRINTABLE, /* . */
+ PRINTABLE|SPECIAL, /* . */
PRINTABLE, /* / */
PRINTABLE|DIGIT, /* 0 */
PRINTABLE|DIGIT, /* 1 */
PRINTABLE, /* { */
PRINTABLE|VBAR, /* | */
PRINTABLE, /* } */
- PRINTABLE|TWIDDLE, /* ~ */
+ PRINTABLE, /* ~ */
IGNORE, /* ^? */
};
lex_unget_c = c;
}
+static uint16_t lex_class;
+
static int
-lex_quoted (void)
+lexc(void)
+{
+ int c;
+ do {
+ c = lex_get();
+ if (c == EOF) {
+ c = 0;
+ lex_class = ENDOFFILE;
+ } else {
+ c &= 0x7f;
+ lex_class = lex_classes[c];
+ }
+ } while (lex_class & IGNORE);
+ return c;
+}
+
+static int
+lex_quoted(void)
{
int c;
int v;
int count;
c = lex_get();
- if (c == EOF)
- return EOF;
+ if (c == EOF) {
+ lex_class = ENDOFFILE;
+ return 0;
+ }
+ lex_class = 0;
c &= 0x7f;
switch (c) {
case 'n':
}
}
-static uint16_t lex_class;
-
-static int
-lexc(void)
-{
- int c;
- do {
- c = lex_get();
- if (c == EOF) {
- lex_class = ENDOFFILE;
- c = 0;
- } else {
- c &= 0x7f;
- lex_class = lex_classes[c];
- if (lex_class & BACKSLASH) {
- c = lex_quoted();
- if (c == EOF)
- lex_class = ENDOFFILE;
- else
- lex_class = PRINTABLE;
- }
- }
- } while (lex_class & IGNORE);
- return c;
-}
-
#define AO_LISP_TOKEN_MAX 32
static char token_string[AO_LISP_TOKEN_MAX];
}
static int
-lex(void)
+_lex(void)
{
int c;
continue;
}
- if (lex_class & (BRA|KET|QUOTEC)) {
+ if (lex_class & SPECIAL) {
add_token(c);
end_token();
switch (c) {
case '(':
+ case '[':
return OPEN;
case ')':
+ case ']':
return CLOSE;
case '\'':
return QUOTE;
+ case '.':
+ return DOT;
}
}
- if (lex_class & TWIDDLE) {
- token_int = lexc();
- return NUM;
+ if (lex_class & POUND) {
+ c = lexc();
+ switch (c) {
+ case 't':
+ add_token(c);
+ end_token();
+ return BOOL;
+ case 'f':
+ add_token(c);
+ end_token();
+ return BOOL;
+ case '\\':
+ for (;;) {
+ int alphabetic;
+ c = lexc();
+ alphabetic = (('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z'));
+ if (token_len == 0) {
+ add_token(c);
+ if (!alphabetic)
+ break;
+ } else {
+ if (alphabetic)
+ add_token(c);
+ else {
+ lex_unget(c);
+ break;
+ }
+ }
+ }
+ end_token();
+ if (token_len == 1)
+ token_int = token_string[0];
+ else if (!strcmp(token_string, "space"))
+ token_int = ' ';
+ else if (!strcmp(token_string, "newline"))
+ token_int = '\n';
+ else if (!strcmp(token_string, "tab"))
+ token_int = '\t';
+ else if (!strcmp(token_string, "return"))
+ token_int = '\r';
+ else if (!strcmp(token_string, "formfeed"))
+ token_int = '\f';
+ else {
+ ao_lisp_error(AO_LISP_INVALID, "invalid character token #\\%s", token_string);
+ continue;
+ }
+ return NUM;
+ }
}
if (lex_class & STRINGC) {
for (;;) {
c = lexc();
+ if (lex_class & BACKSLASH)
+ c = lex_quoted();
if (lex_class & (STRINGC|ENDOFFILE)) {
end_token();
return STRING;
}
}
+static inline int lex(void)
+{
+ int parse_token = _lex();
+ DBGI("token %d (%s)\n", parse_token, token_string);
+ return parse_token;
+}
+
static int parse_token;
struct ao_lisp_cons *ao_lisp_read_cons;
struct ao_lisp_cons *ao_lisp_read_cons_tail;
struct ao_lisp_cons *ao_lisp_read_stack;
+#define READ_IN_QUOTE 0x01
+#define READ_SAW_DOT 0x02
+#define READ_DONE_DOT 0x04
+
static int
-push_read_stack(int cons, int in_quote)
+push_read_stack(int cons, int read_state)
{
- DBGI("push read stack %p %d\n", ao_lisp_read_cons, in_quote);
+ DBGI("push read stack %p 0x%x\n", ao_lisp_read_cons, read_state);
DBG_IN();
if (cons) {
ao_lisp_read_stack = ao_lisp_cons_cons(ao_lisp_cons_poly(ao_lisp_read_cons),
- ao_lisp_cons_cons(ao_lisp_int_poly(in_quote),
- ao_lisp_read_stack));
+ ao_lisp__cons(ao_lisp_int_poly(read_state),
+ ao_lisp_cons_poly(ao_lisp_read_stack)));
if (!ao_lisp_read_stack)
return 0;
}
static int
pop_read_stack(int cons)
{
- int in_quote = 0;
+ int read_state = 0;
if (cons) {
ao_lisp_read_cons = ao_lisp_poly_cons(ao_lisp_read_stack->car);
ao_lisp_read_stack = ao_lisp_poly_cons(ao_lisp_read_stack->cdr);
- in_quote = ao_lisp_poly_int(ao_lisp_read_stack->car);
+ read_state = ao_lisp_poly_int(ao_lisp_read_stack->car);
ao_lisp_read_stack = ao_lisp_poly_cons(ao_lisp_read_stack->cdr);
for (ao_lisp_read_cons_tail = ao_lisp_read_cons;
ao_lisp_read_cons_tail && ao_lisp_read_cons_tail->cdr;
ao_lisp_read_stack = 0;
}
DBG_OUT();
- DBGI("pop read stack %p %d\n", ao_lisp_read_cons, in_quote);
- return in_quote;
+ DBGI("pop read stack %p %d\n", ao_lisp_read_cons, read_state);
+ return read_state;
}
ao_poly
struct ao_lisp_atom *atom;
char *string;
int cons;
- int in_quote;
+ int read_state;
ao_poly v;
- parse_token = lex();
- DBGI("token %d (%s)\n", parse_token, token_string);
cons = 0;
- in_quote = 0;
+ read_state = 0;
ao_lisp_read_cons = ao_lisp_read_cons_tail = ao_lisp_read_stack = 0;
for (;;) {
+ parse_token = lex();
while (parse_token == OPEN) {
- if (!push_read_stack(cons, in_quote))
+ if (!push_read_stack(cons, read_state))
return AO_LISP_NIL;
cons++;
- in_quote = 0;
+ read_state = 0;
parse_token = lex();
- DBGI("token %d (%s)\n", parse_token, token_string);
}
switch (parse_token) {
case NUM:
v = ao_lisp_int_poly(token_int);
break;
+ case BOOL:
+ if (token_string[0] == 't')
+ v = _ao_lisp_bool_true;
+ else
+ v = _ao_lisp_bool_false;
+ break;
case STRING:
string = ao_lisp_string_copy(token_string);
if (string)
v = AO_LISP_NIL;
break;
case QUOTE:
- if (!push_read_stack(cons, in_quote))
+ if (!push_read_stack(cons, read_state))
return AO_LISP_NIL;
cons++;
- in_quote = 1;
+ read_state |= READ_IN_QUOTE;
v = _ao_lisp_atom_quote;
break;
case CLOSE:
}
v = ao_lisp_cons_poly(ao_lisp_read_cons);
--cons;
- in_quote = pop_read_stack(cons);
+ read_state = pop_read_stack(cons);
break;
+ case DOT:
+ if (!cons) {
+ ao_lisp_error(AO_LISP_INVALID, ". outside of cons");
+ return AO_LISP_NIL;
+ }
+ if (!ao_lisp_read_cons) {
+ ao_lisp_error(AO_LISP_INVALID, ". first in cons");
+ return AO_LISP_NIL;
+ }
+ read_state |= READ_SAW_DOT;
+ continue;
}
/* loop over QUOTE ends */
if (!cons)
return v;
- struct ao_lisp_cons *read = ao_lisp_cons_cons(v, NULL);
- if (!read)
+ if (read_state & READ_DONE_DOT) {
+ ao_lisp_error(AO_LISP_INVALID, ". not last in cons");
return AO_LISP_NIL;
+ }
- if (ao_lisp_read_cons_tail)
- ao_lisp_read_cons_tail->cdr = ao_lisp_cons_poly(read);
- else
- ao_lisp_read_cons = read;
- ao_lisp_read_cons_tail = read;
+ if (read_state & READ_SAW_DOT) {
+ read_state |= READ_DONE_DOT;
+ ao_lisp_read_cons_tail->cdr = v;
+ } else {
+ struct ao_lisp_cons *read = ao_lisp_cons_cons(v, AO_LISP_NIL);
+ if (!read)
+ return AO_LISP_NIL;
+
+ if (ao_lisp_read_cons_tail)
+ ao_lisp_read_cons_tail->cdr = ao_lisp_cons_poly(read);
+ else
+ ao_lisp_read_cons = read;
+ ao_lisp_read_cons_tail = read;
+ }
- if (!in_quote || !ao_lisp_read_cons->cdr)
+ if (!(read_state & READ_IN_QUOTE) || !ao_lisp_read_cons->cdr)
break;
v = ao_lisp_cons_poly(ao_lisp_read_cons);
--cons;
- in_quote = pop_read_stack(cons);
+ read_state = pop_read_stack(cons);
}
-
- parse_token = lex();
- DBGI("token %d (%s)\n", parse_token, token_string);
}
return v;
}