Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 1 | struct _mp_lexer_t; |
Damien | 429d719 | 2013-10-04 19:53:11 +0100 | [diff] [blame] | 2 | |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 3 | // a mp_parse_node_t is: |
Damien | 429d719 | 2013-10-04 19:53:11 +0100 | [diff] [blame] | 4 | // - 0000...0000: no node |
Paul Sokolovsky | 56e5ef2 | 2014-02-22 16:39:45 +0200 | [diff] [blame^] | 5 | // - xxxx...xxx1: a small integer; bits 1 and above are the signed value, 2's complement |
| 6 | // - xxxx...xx00: pointer to mp_parse_node_struct_t |
| 7 | // - xx...x00010: an identifier; bits 5 and above are the qstr |
| 8 | // - xx...x00110: an integer; bits 5 and above are the qstr holding the value |
| 9 | // - xx...x01010: a decimal; bits 5 and above are the qstr holding the value |
| 10 | // - xx...x01110: a string; bits 5 and above are the qstr holding the value |
| 11 | // - xx...x10010: a string with triple quotes; bits 5 and above are the qstr holding the value |
| 12 | // - xx...x10110: a token; bits 5 and above are mp_token_kind_t |
Damien | 429d719 | 2013-10-04 19:53:11 +0100 | [diff] [blame] | 13 | |
Paul Sokolovsky | 56e5ef2 | 2014-02-22 16:39:45 +0200 | [diff] [blame^] | 14 | // TODO: these can now be unified with MP_OBJ_FITS_SMALL_INT(x) |
| 15 | // makes sure the top 2 bits of x are all cleared (positive number) or all set (negavite number) |
Damien | 0efb3a1 | 2013-10-12 16:16:56 +0100 | [diff] [blame] | 16 | // these macros can probably go somewhere else because they are used more than just in the parser |
Paul Sokolovsky | 56e5ef2 | 2014-02-22 16:39:45 +0200 | [diff] [blame^] | 17 | #define MP_UINT_HIGH_2_BITS (~((~((machine_uint_t)0)) >> 2)) |
Paul Sokolovsky | bbf0e2f | 2014-02-21 02:04:32 +0200 | [diff] [blame] | 18 | // parser's small ints are different from VM small int |
Paul Sokolovsky | 56e5ef2 | 2014-02-22 16:39:45 +0200 | [diff] [blame^] | 19 | #define MP_PARSE_FITS_SMALL_INT(x) (((((machine_uint_t)(x)) & MP_UINT_HIGH_2_BITS) == 0) || ((((machine_uint_t)(x)) & MP_UINT_HIGH_2_BITS) == MP_UINT_HIGH_2_BITS)) |
Damien | 0efb3a1 | 2013-10-12 16:16:56 +0100 | [diff] [blame] | 20 | |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 21 | #define MP_PARSE_NODE_NULL (0) |
Paul Sokolovsky | 56e5ef2 | 2014-02-22 16:39:45 +0200 | [diff] [blame^] | 22 | #define MP_PARSE_NODE_SMALL_INT (0x1) |
| 23 | #define MP_PARSE_NODE_ID (0x02) |
| 24 | #define MP_PARSE_NODE_INTEGER (0x06) |
| 25 | #define MP_PARSE_NODE_DECIMAL (0x0a) |
| 26 | #define MP_PARSE_NODE_STRING (0x0e) |
| 27 | #define MP_PARSE_NODE_BYTES (0x12) |
| 28 | #define MP_PARSE_NODE_TOKEN (0x16) |
Damien | 429d719 | 2013-10-04 19:53:11 +0100 | [diff] [blame] | 29 | |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 30 | typedef machine_uint_t mp_parse_node_t; // must be pointer size |
Damien | 429d719 | 2013-10-04 19:53:11 +0100 | [diff] [blame] | 31 | |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 32 | typedef struct _mp_parse_node_struct_t { |
Damien George | 0833500 | 2014-01-18 23:24:36 +0000 | [diff] [blame] | 33 | uint32_t source_line; // line number in source file |
Damien | 429d719 | 2013-10-04 19:53:11 +0100 | [diff] [blame] | 34 | uint32_t kind_num_nodes; // parse node kind, and number of nodes |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 35 | mp_parse_node_t nodes[]; // nodes |
| 36 | } mp_parse_node_struct_t; |
Damien | 429d719 | 2013-10-04 19:53:11 +0100 | [diff] [blame] | 37 | |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 38 | // macros for mp_parse_node_t usage |
Damien | 429d719 | 2013-10-04 19:53:11 +0100 | [diff] [blame] | 39 | // some of these evaluate their argument more than once |
| 40 | |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 41 | #define MP_PARSE_NODE_IS_NULL(pn) ((pn) == MP_PARSE_NODE_NULL) |
Paul Sokolovsky | 56e5ef2 | 2014-02-22 16:39:45 +0200 | [diff] [blame^] | 42 | #define MP_PARSE_NODE_IS_LEAF(pn) ((pn) & 3) |
| 43 | #define MP_PARSE_NODE_IS_STRUCT(pn) ((pn) != MP_PARSE_NODE_NULL && ((pn) & 3) == 0) |
| 44 | #define MP_PARSE_NODE_IS_STRUCT_KIND(pn, k) ((pn) != MP_PARSE_NODE_NULL && ((pn) & 3) == 0 && MP_PARSE_NODE_STRUCT_KIND((mp_parse_node_struct_t*)(pn)) == (k)) |
Damien | 429d719 | 2013-10-04 19:53:11 +0100 | [diff] [blame] | 45 | |
Paul Sokolovsky | 56e5ef2 | 2014-02-22 16:39:45 +0200 | [diff] [blame^] | 46 | #define MP_PARSE_NODE_IS_SMALL_INT(pn) (((pn) & 0x1) == MP_PARSE_NODE_SMALL_INT) |
| 47 | #define MP_PARSE_NODE_IS_ID(pn) (((pn) & 0x1f) == MP_PARSE_NODE_ID) |
| 48 | #define MP_PARSE_NODE_IS_TOKEN(pn) (((pn) & 0x1f) == MP_PARSE_NODE_TOKEN) |
| 49 | #define MP_PARSE_NODE_IS_TOKEN_KIND(pn, k) ((pn) == (MP_PARSE_NODE_TOKEN | ((k) << 5))) |
Damien | 429d719 | 2013-10-04 19:53:11 +0100 | [diff] [blame] | 50 | |
Paul Sokolovsky | 56e5ef2 | 2014-02-22 16:39:45 +0200 | [diff] [blame^] | 51 | #define MP_PARSE_NODE_LEAF_KIND(pn) ((pn) & 0x1f) |
Damien | 429d719 | 2013-10-04 19:53:11 +0100 | [diff] [blame] | 52 | // TODO should probably have int and uint versions of this macro |
Paul Sokolovsky | 56e5ef2 | 2014-02-22 16:39:45 +0200 | [diff] [blame^] | 53 | #define MP_PARSE_NODE_LEAF_ARG(pn) (((machine_uint_t)(pn)) >> 5) |
| 54 | #define MP_PARSE_NODE_LEAF_SMALL_INT(pn) (((machine_int_t)(pn)) >> 1) |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 55 | #define MP_PARSE_NODE_STRUCT_KIND(pns) ((pns)->kind_num_nodes & 0xff) |
| 56 | #define MP_PARSE_NODE_STRUCT_NUM_NODES(pns) ((pns)->kind_num_nodes >> 8) |
Damien | 429d719 | 2013-10-04 19:53:11 +0100 | [diff] [blame] | 57 | |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 58 | mp_parse_node_t mp_parse_node_new_leaf(machine_int_t kind, machine_int_t arg); |
Damien George | b829b5c | 2014-01-25 13:51:19 +0000 | [diff] [blame] | 59 | uint mp_parse_node_free(mp_parse_node_t pn); |
Damien | 429d719 | 2013-10-04 19:53:11 +0100 | [diff] [blame] | 60 | |
Damien George | cbd2f74 | 2014-01-19 11:48:48 +0000 | [diff] [blame] | 61 | void mp_parse_node_print(mp_parse_node_t pn, int indent); |
Damien | 429d719 | 2013-10-04 19:53:11 +0100 | [diff] [blame] | 62 | |
Damien | 5ac1b2e | 2013-10-18 19:58:12 +0100 | [diff] [blame] | 63 | typedef enum { |
Damien | d99b052 | 2013-12-21 18:17:45 +0000 | [diff] [blame] | 64 | MP_PARSE_SINGLE_INPUT, |
| 65 | MP_PARSE_FILE_INPUT, |
| 66 | MP_PARSE_EVAL_INPUT, |
| 67 | } mp_parse_input_kind_t; |
Damien | 5ac1b2e | 2013-10-18 19:58:12 +0100 | [diff] [blame] | 68 | |
Damien George | c596612 | 2014-02-15 16:10:44 +0000 | [diff] [blame] | 69 | typedef enum { |
| 70 | MP_PARSE_ERROR_UNEXPECTED_INDENT, |
| 71 | MP_PARSE_ERROR_UNMATCHED_UNINDENT, |
| 72 | MP_PARSE_ERROR_INVALID_SYNTAX, |
| 73 | } mp_parse_error_kind_t; |
| 74 | |
| 75 | // returns MP_PARSE_NODE_NULL on error, and then parse_error_kind_out is valid |
| 76 | mp_parse_node_t mp_parse(struct _mp_lexer_t *lex, mp_parse_input_kind_t input_kind, mp_parse_error_kind_t *parse_error_kind_out); |