diff --git a/lex.yy.c b/lex.yy.c new file mode 100644 index 0000000..ee74aef --- /dev/null +++ b/lex.yy.c @@ -0,0 +1,2279 @@ + +#line 3 "lex.yy.c" + +#define YY_INT_ALIGNED short int + +/* A lexical scanner generated by flex */ + +#define FLEX_SCANNER +#define YY_FLEX_MAJOR_VERSION 2 +#define YY_FLEX_MINOR_VERSION 5 +#define YY_FLEX_SUBMINOR_VERSION 35 +#if YY_FLEX_SUBMINOR_VERSION > 0 +#define FLEX_BETA +#endif + +/* First, we deal with platform-specific or compiler-specific issues. */ + +/* begin standard C headers. */ +#include +#include +#include +#include + +/* end standard C headers. */ + +/* flex integer type definitions */ + +#ifndef FLEXINT_H +#define FLEXINT_H + +/* C99 systems have . Non-C99 systems may or may not. */ + +#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L + +/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h, + * if you want the limit (max/min) macros for int types. + */ +#ifndef __STDC_LIMIT_MACROS +#define __STDC_LIMIT_MACROS 1 +#endif + +#include +typedef int8_t flex_int8_t; +typedef uint8_t flex_uint8_t; +typedef int16_t flex_int16_t; +typedef uint16_t flex_uint16_t; +typedef int32_t flex_int32_t; +typedef uint32_t flex_uint32_t; +typedef uint64_t flex_uint64_t; +#else +typedef signed char flex_int8_t; +typedef short int flex_int16_t; +typedef int flex_int32_t; +typedef unsigned char flex_uint8_t; +typedef unsigned short int flex_uint16_t; +typedef unsigned int flex_uint32_t; +#endif /* ! C99 */ + +/* Limits of integral types. */ +#ifndef INT8_MIN +#define INT8_MIN (-128) +#endif +#ifndef INT16_MIN +#define INT16_MIN (-32767-1) +#endif +#ifndef INT32_MIN +#define INT32_MIN (-2147483647-1) +#endif +#ifndef INT8_MAX +#define INT8_MAX (127) +#endif +#ifndef INT16_MAX +#define INT16_MAX (32767) +#endif +#ifndef INT32_MAX +#define INT32_MAX (2147483647) +#endif +#ifndef UINT8_MAX +#define UINT8_MAX (255U) +#endif +#ifndef UINT16_MAX +#define UINT16_MAX (65535U) +#endif +#ifndef UINT32_MAX +#define UINT32_MAX (4294967295U) +#endif + +#endif /* ! FLEXINT_H */ + +#ifdef __cplusplus + +/* The "const" storage-class-modifier is valid. */ +#define YY_USE_CONST + +#else /* ! __cplusplus */ + +/* C99 requires __STDC__ to be defined as 1. */ +#if defined (__STDC__) + +#define YY_USE_CONST + +#endif /* defined (__STDC__) */ +#endif /* ! __cplusplus */ + +#ifdef YY_USE_CONST +#define yyconst const +#else +#define yyconst +#endif + +/* Returned upon end-of-file. */ +#define YY_NULL 0 + +/* Promotes a possibly negative, possibly signed char to an unsigned + * integer for use as an array index. If the signed char is negative, + * we want to instead treat it as an 8-bit unsigned char, hence the + * double cast. + */ +#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c) + +/* Enter a start condition. This macro really ought to take a parameter, + * but we do it the disgusting crufty way forced on us by the ()-less + * definition of BEGIN. + */ +#define BEGIN (yy_start) = 1 + 2 * + +/* Translate the current start state into a value that can be later handed + * to BEGIN to return to the state. The YYSTATE alias is for lex + * compatibility. + */ +#define YY_START (((yy_start) - 1) / 2) +#define YYSTATE YY_START + +/* Action number for EOF rule of a given start state. */ +#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) + +/* Special action meaning "start processing a new file". */ +#define YY_NEW_FILE yyrestart(yyin ) + +#define YY_END_OF_BUFFER_CHAR 0 + +/* Size of default input buffer. */ +#ifndef YY_BUF_SIZE +#define YY_BUF_SIZE 16384 +#endif + +/* The state buf must be large enough to hold one state per character in the main buffer. + */ +#define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type)) + +#ifndef YY_TYPEDEF_YY_BUFFER_STATE +#define YY_TYPEDEF_YY_BUFFER_STATE +typedef struct yy_buffer_state *YY_BUFFER_STATE; +#endif + +#ifndef YY_TYPEDEF_YY_SIZE_T +#define YY_TYPEDEF_YY_SIZE_T +typedef size_t yy_size_t; +#endif + +extern yy_size_t yyleng; + +extern FILE *yyin, *yyout; + +#define EOB_ACT_CONTINUE_SCAN 0 +#define EOB_ACT_END_OF_FILE 1 +#define EOB_ACT_LAST_MATCH 2 + + #define YY_LESS_LINENO(n) + +/* Return all but the first "n" matched characters back to the input stream. */ +#define yyless(n) \ + do \ + { \ + /* Undo effects of setting up yytext. */ \ + int yyless_macro_arg = (n); \ + YY_LESS_LINENO(yyless_macro_arg);\ + *yy_cp = (yy_hold_char); \ + YY_RESTORE_YY_MORE_OFFSET \ + (yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \ + YY_DO_BEFORE_ACTION; /* set up yytext again */ \ + } \ + while ( 0 ) + +#define unput(c) yyunput( c, (yytext_ptr) ) + +#ifndef YY_STRUCT_YY_BUFFER_STATE +#define YY_STRUCT_YY_BUFFER_STATE +struct yy_buffer_state + { + FILE *yy_input_file; + + char *yy_ch_buf; /* input buffer */ + char *yy_buf_pos; /* current position in input buffer */ + + /* Size of input buffer in bytes, not including room for EOB + * characters. + */ + yy_size_t yy_buf_size; + + /* Number of characters read into yy_ch_buf, not including EOB + * characters. + */ + yy_size_t yy_n_chars; + + /* Whether we "own" the buffer - i.e., we know we created it, + * and can realloc() it to grow it, and should free() it to + * delete it. + */ + int yy_is_our_buffer; + + /* Whether this is an "interactive" input source; if so, and + * if we're using stdio for input, then we want to use getc() + * instead of fread(), to make sure we stop fetching input after + * each newline. + */ + int yy_is_interactive; + + /* Whether we're considered to be at the beginning of a line. + * If so, '^' rules will be active on the next match, otherwise + * not. + */ + int yy_at_bol; + + int yy_bs_lineno; /**< The line count. */ + int yy_bs_column; /**< The column count. */ + + /* Whether to try to fill the input buffer when we reach the + * end of it. + */ + int yy_fill_buffer; + + int yy_buffer_status; + +#define YY_BUFFER_NEW 0 +#define YY_BUFFER_NORMAL 1 + /* When an EOF's been seen but there's still some text to process + * then we mark the buffer as YY_EOF_PENDING, to indicate that we + * shouldn't try reading from the input source any more. We might + * still have a bunch of tokens to match, though, because of + * possible backing-up. + * + * When we actually see the EOF, we change the status to "new" + * (via yyrestart()), so that the user can continue scanning by + * just pointing yyin at a new input file. + */ +#define YY_BUFFER_EOF_PENDING 2 + + }; +#endif /* !YY_STRUCT_YY_BUFFER_STATE */ + +/* Stack of input buffers. */ +static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */ +static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */ +static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */ + +/* We provide macros for accessing buffer states in case in the + * future we want to put the buffer states in a more general + * "scanner state". + * + * Returns the top of the stack, or NULL. + */ +#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \ + ? (yy_buffer_stack)[(yy_buffer_stack_top)] \ + : NULL) + +/* Same as previous macro, but useful when we know that the buffer stack is not + * NULL or when we need an lvalue. For internal use only. + */ +#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)] + +/* yy_hold_char holds the character lost when yytext is formed. */ +static char yy_hold_char; +static yy_size_t yy_n_chars; /* number of characters read into yy_ch_buf */ +yy_size_t yyleng; + +/* Points to current character in buffer. */ +static char *yy_c_buf_p = (char *) 0; +static int yy_init = 0; /* whether we need to initialize */ +static int yy_start = 0; /* start state number */ + +/* Flag which is used to allow yywrap()'s to do buffer switches + * instead of setting up a fresh yyin. A bit of a hack ... + */ +static int yy_did_buffer_switch_on_eof; + +void yyrestart (FILE *input_file ); +void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ); +YY_BUFFER_STATE yy_create_buffer (FILE *file,int size ); +void yy_delete_buffer (YY_BUFFER_STATE b ); +void yy_flush_buffer (YY_BUFFER_STATE b ); +void yypush_buffer_state (YY_BUFFER_STATE new_buffer ); +void yypop_buffer_state (void ); + +static void yyensure_buffer_stack (void ); +static void yy_load_buffer_state (void ); +static void yy_init_buffer (YY_BUFFER_STATE b,FILE *file ); + +#define YY_FLUSH_BUFFER yy_flush_buffer(YY_CURRENT_BUFFER ) + +YY_BUFFER_STATE yy_scan_buffer (char *base,yy_size_t size ); +YY_BUFFER_STATE yy_scan_string (yyconst char *yy_str ); +YY_BUFFER_STATE yy_scan_bytes (yyconst char *bytes,yy_size_t len ); + +void *yyalloc (yy_size_t ); +void *yyrealloc (void *,yy_size_t ); +void yyfree (void * ); + +#define yy_new_buffer yy_create_buffer + +#define yy_set_interactive(is_interactive) \ + { \ + if ( ! YY_CURRENT_BUFFER ){ \ + yyensure_buffer_stack (); \ + YY_CURRENT_BUFFER_LVALUE = \ + yy_create_buffer(yyin,YY_BUF_SIZE ); \ + } \ + YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \ + } + +#define yy_set_bol(at_bol) \ + { \ + if ( ! YY_CURRENT_BUFFER ){\ + yyensure_buffer_stack (); \ + YY_CURRENT_BUFFER_LVALUE = \ + yy_create_buffer(yyin,YY_BUF_SIZE ); \ + } \ + YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \ + } + +#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol) + +/* Begin user sect3 */ + +#define yywrap(n) 1 +#define YY_SKIP_YYWRAP + +typedef unsigned char YY_CHAR; + +FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0; + +typedef int yy_state_type; + +extern int yylineno; + +int yylineno = 1; + +extern char *yytext; +#define yytext_ptr yytext + +static yy_state_type yy_get_previous_state (void ); +static yy_state_type yy_try_NUL_trans (yy_state_type current_state ); +static int yy_get_next_buffer (void ); +static void yy_fatal_error (yyconst char msg[] ); + +/* Done after the current pattern has been matched and before the + * corresponding action - sets up yytext. + */ +#define YY_DO_BEFORE_ACTION \ + (yytext_ptr) = yy_bp; \ + yyleng = (yy_size_t) (yy_cp - yy_bp); \ + (yy_hold_char) = *yy_cp; \ + *yy_cp = '\0'; \ + (yy_c_buf_p) = yy_cp; + +#define YY_NUM_RULES 84 +#define YY_END_OF_BUFFER 85 +/* This struct is not used in this scanner, + but its presence is necessary. */ +struct yy_trans_info + { + flex_int32_t yy_verify; + flex_int32_t yy_nxt; + }; +static yyconst flex_int16_t yy_accept[111] = + { 0, + 0, 0, 85, 83, 82, 81, 83, 54, 83, 45, + 56, 57, 41, 83, 48, 49, 35, 32, 59, 33, + 60, 34, 74, 74, 61, 58, 39, 46, 40, 55, + 44, 80, 65, 64, 52, 53, 47, 36, 80, 63, + 69, 67, 66, 68, 62, 80, 50, 42, 51, 43, + 81, 12, 0, 79, 0, 6, 7, 70, 3, 27, + 28, 23, 24, 25, 74, 74, 26, 78, 20, 21, + 29, 31, 30, 0, 75, 74, 0, 0, 0, 22, + 8, 4, 38, 14, 10, 9, 37, 11, 13, 5, + 80, 0, 73, 72, 0, 78, 15, 19, 0, 76, + + 77, 18, 17, 16, 1, 2, 0, 71, 77, 0 + } ; + +static yyconst flex_int32_t yy_ec[256] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, + 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 2, 5, 6, 7, 8, 9, 10, 11, 12, + 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, + 22, 22, 22, 22, 22, 22, 22, 23, 24, 25, + 26, 27, 28, 29, 30, 30, 30, 30, 30, 30, + 31, 31, 31, 31, 31, 32, 31, 31, 31, 31, + 31, 33, 31, 31, 31, 31, 31, 31, 31, 31, + 34, 35, 36, 37, 38, 1, 30, 39, 30, 30, + + 40, 41, 31, 31, 42, 31, 43, 44, 31, 31, + 31, 31, 31, 45, 46, 47, 31, 31, 31, 48, + 31, 31, 49, 50, 51, 52, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1 + } ; + +static yyconst flex_int32_t yy_meta[53] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, + 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, + 2, 2, 2, 1, 1, 1, 1, 1, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, + 1, 1 + } ; + +static yyconst flex_int16_t yy_base[114] = + { 0, + 0, 0, 175, 176, 176, 176, 156, 153, 47, 129, + 125, 176, 176, 0, 124, 176, 36, 37, 176, 43, + 47, 39, 58, 63, 59, 176, 64, 176, 63, 118, + 107, 0, 0, 0, 123, 176, 176, 176, 74, 0, + 0, 0, 0, 0, 0, 77, 117, 176, 176, 176, + 176, 176, 90, 176, 117, 176, 176, 176, 176, 176, + 176, 176, 176, 88, 93, 101, 176, 106, 82, 176, + 176, 176, 176, 111, 69, 117, 121, 86, 122, 176, + 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, + 0, 66, 128, 0, 37, 176, 176, 176, 133, 176, + + 141, 176, 176, 176, 176, 176, 144, 147, 150, 176, + 172, 70, 54 + } ; + +static yyconst flex_int16_t yy_def[114] = + { 0, + 110, 1, 110, 110, 110, 110, 110, 110, 111, 110, + 110, 110, 110, 112, 110, 110, 110, 110, 110, 110, + 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, + 110, 113, 113, 113, 110, 110, 110, 110, 113, 113, + 113, 113, 113, 113, 113, 113, 110, 110, 110, 110, + 110, 110, 111, 110, 111, 110, 110, 110, 110, 110, + 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, + 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, + 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, + 113, 110, 113, 46, 110, 110, 110, 110, 110, 110, + + 110, 110, 110, 110, 110, 110, 110, 110, 110, 0, + 110, 110, 110 + } ; + +static yyconst flex_int16_t yy_nxt[229] = + { 0, + 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, + 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, + 24, 24, 25, 26, 27, 28, 29, 30, 31, 32, + 32, 33, 34, 35, 4, 36, 37, 38, 39, 32, + 40, 41, 32, 42, 43, 44, 45, 46, 47, 48, + 49, 50, 54, 60, 62, 91, 71, 72, 61, 63, + 64, 73, 65, 66, 66, 67, 68, 68, 68, 86, + 81, 58, 78, 69, 70, 74, 82, 65, 65, 65, + 74, 55, 76, 76, 76, 79, 80, 106, 83, 87, + 84, 88, 85, 93, 93, 54, 94, 94, 94, 97, + + 75, 105, 77, 102, 98, 75, 94, 68, 68, 68, + 74, 100, 65, 65, 65, 94, 94, 94, 74, 110, + 76, 76, 76, 95, 55, 68, 68, 68, 99, 92, + 68, 68, 68, 90, 74, 75, 76, 76, 76, 103, + 77, 101, 101, 75, 104, 89, 96, 93, 93, 107, + 59, 57, 108, 108, 108, 56, 77, 52, 51, 75, + 109, 109, 109, 108, 108, 108, 108, 108, 108, 109, + 109, 109, 53, 53, 110, 3, 110, 110, 110, 110, + 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, + 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, + + 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, + 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, + 110, 110, 110, 110, 110, 110, 110, 110 + } ; + +static yyconst flex_int16_t yy_chk[229] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 9, 17, 18, 113, 22, 22, 17, 18, + 20, 22, 20, 20, 20, 20, 21, 21, 21, 29, + 27, 112, 25, 21, 21, 23, 27, 23, 23, 23, + 24, 9, 24, 24, 24, 25, 25, 95, 27, 29, + 27, 29, 27, 39, 39, 53, 46, 46, 46, 69, + + 23, 92, 24, 78, 69, 24, 46, 64, 64, 64, + 65, 75, 65, 65, 65, 46, 46, 46, 66, 55, + 66, 66, 66, 47, 53, 68, 68, 68, 74, 35, + 74, 74, 74, 31, 76, 65, 76, 76, 76, 79, + 66, 77, 77, 66, 79, 30, 68, 93, 93, 99, + 15, 11, 99, 99, 99, 10, 76, 8, 7, 76, + 101, 101, 101, 107, 107, 107, 108, 108, 108, 109, + 109, 109, 111, 111, 3, 110, 110, 110, 110, 110, + 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, + 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, + + 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, + 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, + 110, 110, 110, 110, 110, 110, 110, 110 + } ; + +static yy_state_type yy_last_accepting_state; +static char *yy_last_accepting_cpos; + +extern int yy_flex_debug; +int yy_flex_debug = 0; + +/* The intent behind this definition is that it'll catch + * any uses of REJECT which flex missed. + */ +#define REJECT reject_used_but_not_detected +#define yymore() yymore_used_but_not_detected +#define YY_MORE_ADJ 0 +#define YY_RESTORE_YY_MORE_OFFSET +char *yytext; +#line 1 "parser/impossible.l" +#line 2 "parser/impossible.l" + /*extern "C" + { + int yylex(void); + }*/ + + #include "Values.h" + #include "instruction.h" + #include "defines.h" + + #include "impossible.tab.hpp" +#line 552 "lex.yy.c" + +#define INITIAL 0 + +#ifndef YY_NO_UNISTD_H +/* Special case for "unistd.h", since it is non-ANSI. We include it way + * down here because we want the user's section 1 to have been scanned first. + * The user has a chance to override it with an option. + */ +#include +#endif + +#ifndef YY_EXTRA_TYPE +#define YY_EXTRA_TYPE void * +#endif + +static int yy_init_globals (void ); + +/* Accessor methods to globals. + These are made visible to non-reentrant scanners for convenience. */ + +int yylex_destroy (void ); + +int yyget_debug (void ); + +void yyset_debug (int debug_flag ); + +YY_EXTRA_TYPE yyget_extra (void ); + +void yyset_extra (YY_EXTRA_TYPE user_defined ); + +FILE *yyget_in (void ); + +void yyset_in (FILE * in_str ); + +FILE *yyget_out (void ); + +void yyset_out (FILE * out_str ); + +yy_size_t yyget_leng (void ); + +char *yyget_text (void ); + +int yyget_lineno (void ); + +void yyset_lineno (int line_number ); + +/* Macros after this point can all be overridden by user definitions in + * section 1. + */ + +#ifndef YY_SKIP_YYWRAP +#ifdef __cplusplus +extern "C" int yywrap (void ); +#else +extern int yywrap (void ); +#endif +#endif + + static void yyunput (int c,char *buf_ptr ); + +#ifndef yytext_ptr +static void yy_flex_strncpy (char *,yyconst char *,int ); +#endif + +#ifdef YY_NEED_STRLEN +static int yy_flex_strlen (yyconst char * ); +#endif + +#ifndef YY_NO_INPUT + +#ifdef __cplusplus +static int yyinput (void ); +#else +static int input (void ); +#endif + +#endif + +/* Amount of stuff to slurp up with each read. */ +#ifndef YY_READ_BUF_SIZE +#define YY_READ_BUF_SIZE 8192 +#endif + +/* Copy whatever the last rule matched to the standard output. */ +#ifndef ECHO +/* This used to be an fputs(), but since the string might contain NUL's, + * we now use fwrite(). + */ +#define ECHO fwrite( yytext, yyleng, 1, yyout ) +#endif + +/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL, + * is returned in "result". + */ +#ifndef YY_INPUT +#define YY_INPUT(buf,result,max_size) \ + if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \ + { \ + int c = '*'; \ + yy_size_t n; \ + for ( n = 0; n < max_size && \ + (c = getc( yyin )) != EOF && c != '\n'; ++n ) \ + buf[n] = (char) c; \ + if ( c == '\n' ) \ + buf[n++] = (char) c; \ + if ( c == EOF && ferror( yyin ) ) \ + YY_FATAL_ERROR( "input in flex scanner failed" ); \ + result = n; \ + } \ + else \ + { \ + errno=0; \ + while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \ + { \ + if( errno != EINTR) \ + { \ + YY_FATAL_ERROR( "input in flex scanner failed" ); \ + break; \ + } \ + errno=0; \ + clearerr(yyin); \ + } \ + }\ +\ + +#endif + +/* No semi-colon after return; correct usage is to write "yyterminate();" - + * we don't want an extra ';' after the "return" because that will cause + * some compilers to complain about unreachable statements. + */ +#ifndef yyterminate +#define yyterminate() return YY_NULL +#endif + +/* Number of entries by which start-condition stack grows. */ +#ifndef YY_START_STACK_INCR +#define YY_START_STACK_INCR 25 +#endif + +/* Report a fatal error. */ +#ifndef YY_FATAL_ERROR +#define YY_FATAL_ERROR(msg) yy_fatal_error( msg ) +#endif + +/* end tables serialization structures and prototypes */ + +/* Default declaration of generated scanner - a define so the user can + * easily add parameters. + */ +#ifndef YY_DECL +#define YY_DECL_IS_OURS 1 + +extern int yylex (void); + +#define YY_DECL int yylex (void) +#endif /* !YY_DECL */ + +/* Code executed at the beginning of each rule, after yytext and yyleng + * have been set up. + */ +#ifndef YY_USER_ACTION +#define YY_USER_ACTION +#endif + +/* Code executed at the end of each rule. */ +#ifndef YY_BREAK +#define YY_BREAK break; +#endif + +#define YY_RULE_SETUP \ + YY_USER_ACTION + +/** The main scanner function which does all the work. + */ +YY_DECL +{ + register yy_state_type yy_current_state; + register char *yy_cp, *yy_bp; + register int yy_act; + +#line 16 "parser/impossible.l" + + +#line 737 "lex.yy.c" + + if ( !(yy_init) ) + { + (yy_init) = 1; + +#ifdef YY_USER_INIT + YY_USER_INIT; +#endif + + if ( ! (yy_start) ) + (yy_start) = 1; /* first start state */ + + if ( ! yyin ) + yyin = stdin; + + if ( ! yyout ) + yyout = stdout; + + if ( ! YY_CURRENT_BUFFER ) { + yyensure_buffer_stack (); + YY_CURRENT_BUFFER_LVALUE = + yy_create_buffer(yyin,YY_BUF_SIZE ); + } + + yy_load_buffer_state( ); + } + + while ( 1 ) /* loops until end-of-file is reached */ + { + yy_cp = (yy_c_buf_p); + + /* Support of yytext. */ + *yy_cp = (yy_hold_char); + + /* yy_bp points to the position in yy_ch_buf of the start of + * the current run. + */ + yy_bp = yy_cp; + + yy_current_state = (yy_start); +yy_match: + do + { + register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)]; + if ( yy_accept[yy_current_state] ) + { + (yy_last_accepting_state) = yy_current_state; + (yy_last_accepting_cpos) = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 111 ) + yy_c = yy_meta[(unsigned int) yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; + ++yy_cp; + } + while ( yy_base[yy_current_state] != 176 ); + +yy_find_action: + yy_act = yy_accept[yy_current_state]; + if ( yy_act == 0 ) + { /* have to back up */ + yy_cp = (yy_last_accepting_cpos); + yy_current_state = (yy_last_accepting_state); + yy_act = yy_accept[yy_current_state]; + } + + YY_DO_BEFORE_ACTION; + +do_action: /* This label is used only to access EOF actions. */ + + switch ( yy_act ) + { /* beginning of action switch */ + case 0: /* must back up */ + /* undo the effects of YY_DO_BEFORE_ACTION */ + *yy_cp = (yy_hold_char); + yy_cp = (yy_last_accepting_cpos); + yy_current_state = (yy_last_accepting_state); + goto yy_find_action; + +case 1: +YY_RULE_SETUP +#line 18 "parser/impossible.l" +{ return T_RECUR; } + YY_BREAK +case 2: +YY_RULE_SETUP +#line 19 "parser/impossible.l" +{ return T_RECURV; } + YY_BREAK +case 3: +YY_RULE_SETUP +#line 21 "parser/impossible.l" +{ return T_RISE; } + YY_BREAK +case 4: +YY_RULE_SETUP +#line 22 "parser/impossible.l" +{ return T_SINK; } + YY_BREAK +case 5: +YY_RULE_SETUP +#line 24 "parser/impossible.l" +{ return T_RAND; } + YY_BREAK +case 6: +YY_RULE_SETUP +#line 25 "parser/impossible.l" +{ return T_SORT; } + YY_BREAK +case 7: +YY_RULE_SETUP +#line 26 "parser/impossible.l" +{ return T_SHUFFLE; } + YY_BREAK +case 8: +YY_RULE_SETUP +#line 28 "parser/impossible.l" +{ return T_HASH_FRONT; } + YY_BREAK +case 9: +YY_RULE_SETUP +#line 29 "parser/impossible.l" +{ return T_HASH_BACK; } + YY_BREAK +case 10: +YY_RULE_SETUP +#line 30 "parser/impossible.l" +{ return T_AT_FRONT; } + YY_BREAK +case 11: +YY_RULE_SETUP +#line 31 "parser/impossible.l" +{ return T_AT_BACK; } + YY_BREAK +case 12: +YY_RULE_SETUP +#line 33 "parser/impossible.l" +{ return T_DBANG; } + YY_BREAK +case 13: +YY_RULE_SETUP +#line 34 "parser/impossible.l" +{ return T_DQUESTION; } + YY_BREAK +case 14: +YY_RULE_SETUP +#line 35 "parser/impossible.l" +{ return T_WHILE; } + YY_BREAK +case 15: +YY_RULE_SETUP +#line 37 "parser/impossible.l" +{ return T_MAP; } + YY_BREAK +case 16: +YY_RULE_SETUP +#line 38 "parser/impossible.l" +{ return T_DMAP; } + YY_BREAK +case 17: +YY_RULE_SETUP +#line 39 "parser/impossible.l" +{ return T_FOLD; } + YY_BREAK +case 18: +YY_RULE_SETUP +#line 40 "parser/impossible.l" +{ return T_CARTESIAN; } + YY_BREAK +case 19: +YY_RULE_SETUP +#line 41 "parser/impossible.l" +{ return T_ITERI; } + YY_BREAK +case 20: +YY_RULE_SETUP +#line 42 "parser/impossible.l" +{ return T_ITER; } + YY_BREAK +case 21: +YY_RULE_SETUP +#line 44 "parser/impossible.l" +{ return T_ANY; } + YY_BREAK +case 22: +YY_RULE_SETUP +#line 45 "parser/impossible.l" +{ return T_EVERY; } + YY_BREAK +case 23: +YY_RULE_SETUP +#line 47 "parser/impossible.l" +{ return T_PLUS_MON; } + YY_BREAK +case 24: +YY_RULE_SETUP +#line 48 "parser/impossible.l" +{ return T_PLUS_DIA; } + YY_BREAK +case 25: +YY_RULE_SETUP +#line 49 "parser/impossible.l" +{ return T_MINUS_MON; } + YY_BREAK +case 26: +YY_RULE_SETUP +#line 50 "parser/impossible.l" +{ return T_MINUS_DIA; } + YY_BREAK +case 27: +YY_RULE_SETUP +#line 51 "parser/impossible.l" +{ return T_TIMES_MON; } + YY_BREAK +case 28: +YY_RULE_SETUP +#line 52 "parser/impossible.l" +{ return T_TIMES_DIA; } + YY_BREAK +case 29: +YY_RULE_SETUP +#line 53 "parser/impossible.l" +{ return T_DIVIDE_MON; } + YY_BREAK +case 30: +YY_RULE_SETUP +#line 54 "parser/impossible.l" +{ return T_DIVIDE_DIA; } + YY_BREAK +case 31: +YY_RULE_SETUP +#line 56 "parser/impossible.l" +{ return T_DDIVIDE; } + YY_BREAK +case 32: +YY_RULE_SETUP +#line 58 "parser/impossible.l" +{ return T_PLUS; } + YY_BREAK +case 33: +YY_RULE_SETUP +#line 59 "parser/impossible.l" +{ return T_MINUS; } + YY_BREAK +case 34: +YY_RULE_SETUP +#line 60 "parser/impossible.l" +{ return T_DIVIDE; } + YY_BREAK +case 35: +YY_RULE_SETUP +#line 61 "parser/impossible.l" +{ return T_TIMES; } + YY_BREAK +case 36: +YY_RULE_SETUP +#line 62 "parser/impossible.l" +{ return T_UNDERSCORE; } + YY_BREAK +case 37: +YY_RULE_SETUP +#line 64 "parser/impossible.l" +{ return T_RSHIFT; } + YY_BREAK +case 38: +YY_RULE_SETUP +#line 65 "parser/impossible.l" +{ return T_LSHIFT; } + YY_BREAK +case 39: +YY_RULE_SETUP +#line 67 "parser/impossible.l" +{ return T_LESSER; } + YY_BREAK +case 40: +YY_RULE_SETUP +#line 68 "parser/impossible.l" +{ return T_GREATER; } + YY_BREAK +case 41: +YY_RULE_SETUP +#line 70 "parser/impossible.l" +{ return T_AND; } + YY_BREAK +case 42: +YY_RULE_SETUP +#line 71 "parser/impossible.l" +{ return T_OR; } + YY_BREAK +case 43: +YY_RULE_SETUP +#line 72 "parser/impossible.l" +{ return T_NOT; } + YY_BREAK +case 44: +YY_RULE_SETUP +#line 74 "parser/impossible.l" +{ return T_AT; } + YY_BREAK +case 45: +YY_RULE_SETUP +#line 75 "parser/impossible.l" +{ return T_HASH; } + YY_BREAK +case 46: +YY_RULE_SETUP +#line 77 "parser/impossible.l" +{ return T_EQUAL; } + YY_BREAK +case 47: +YY_RULE_SETUP +#line 78 "parser/impossible.l" +{ return T_PEEK; } + YY_BREAK +case 48: +YY_RULE_SETUP +#line 80 "parser/impossible.l" +{ return T_LPAREN; } + YY_BREAK +case 49: +YY_RULE_SETUP +#line 81 "parser/impossible.l" +{ return T_RPAREN; } + YY_BREAK +case 50: +YY_RULE_SETUP +#line 82 "parser/impossible.l" +{ return T_LBRACE; } + YY_BREAK +case 51: +YY_RULE_SETUP +#line 83 "parser/impossible.l" +{ return T_RBRACE; } + YY_BREAK +case 52: +YY_RULE_SETUP +#line 84 "parser/impossible.l" +{ return T_LBRACK; } + YY_BREAK +case 53: +YY_RULE_SETUP +#line 85 "parser/impossible.l" +{ return T_RBRACK; } + YY_BREAK +case 54: +YY_RULE_SETUP +#line 87 "parser/impossible.l" +{ return T_BANG; } + YY_BREAK +case 55: +YY_RULE_SETUP +#line 88 "parser/impossible.l" +{ return T_QUESTION; } + YY_BREAK +case 56: +YY_RULE_SETUP +#line 90 "parser/impossible.l" +{ return T_DOLLAR; } + YY_BREAK +case 57: +YY_RULE_SETUP +#line 91 "parser/impossible.l" +{ return T_PERCENT; } + YY_BREAK +case 58: +YY_RULE_SETUP +#line 92 "parser/impossible.l" +{ return T_SEMICOL; } + YY_BREAK +case 59: +YY_RULE_SETUP +#line 93 "parser/impossible.l" +{ return T_COMMA; } + YY_BREAK +case 60: +YY_RULE_SETUP +#line 95 "parser/impossible.l" +{ return T_PERIOD; } + YY_BREAK +case 61: +YY_RULE_SETUP +#line 96 "parser/impossible.l" +{ return T_COLON; } + YY_BREAK +case 62: +YY_RULE_SETUP +#line 98 "parser/impossible.l" +{ yylval.v = new Bool(true); return BOOLEAN; } + YY_BREAK +case 63: +YY_RULE_SETUP +#line 99 "parser/impossible.l" +{ yylval.v = new Bool(false); return BOOLEAN; } + YY_BREAK +case 64: +YY_RULE_SETUP +#line 101 "parser/impossible.l" +{ yylval.op = OP_RAISE_STACK; return T_OPCODE; } + YY_BREAK +case 65: +YY_RULE_SETUP +#line 102 "parser/impossible.l" +{ yylval.op = OP_LOWER_STACK; return T_OPCODE; } + YY_BREAK +case 66: +YY_RULE_SETUP +#line 104 "parser/impossible.l" +{ yylval.op = OP_RAISE_STACKV; return T_OPCODE; } + YY_BREAK +case 67: +YY_RULE_SETUP +#line 105 "parser/impossible.l" +{ yylval.op = OP_LOWER_STACKV; return T_OPCODE; } + YY_BREAK +case 68: +YY_RULE_SETUP +#line 107 "parser/impossible.l" +{ return T_S; } + YY_BREAK +case 69: +YY_RULE_SETUP +#line 109 "parser/impossible.l" +{ return T_I; } + YY_BREAK +case 70: +YY_RULE_SETUP +#line 111 "parser/impossible.l" +{ yylval.v = new Char(yytext[1]); return CHARACTER; } + YY_BREAK +case 71: +YY_RULE_SETUP +#line 113 "parser/impossible.l" +{ + int i = 0; + while (yytext[i] != '.') ++i; + yytext[i] = '\0'; + + yylval.v = new Range(RangeVector(atoi(yytext), atoi(&yytext[i+2]))); + return RANGE; +} + YY_BREAK +case 72: +YY_RULE_SETUP +#line 122 "parser/impossible.l" +{ yylval.v = new Int((int)strtoul(&yytext[1], NULL, 16)); return INTEGER; } + YY_BREAK +case 73: +YY_RULE_SETUP +#line 123 "parser/impossible.l" +{ yylval.v = new Int((int)strtoul(&yytext[1], NULL, 2)); return INTEGER; } + YY_BREAK +case 74: +YY_RULE_SETUP +#line 124 "parser/impossible.l" +{ yylval.v = new Int(atoi(yytext)); return INTEGER;} + YY_BREAK +case 75: +YY_RULE_SETUP +#line 125 "parser/impossible.l" +{ + char *tmp = strdup(yytext); + char *index = strchr(tmp, 'k') - 1; + *index = NULL; + + free(tmp); + yylval.v = new Int(atoi(yytext)*1000); return INTEGER; +} + YY_BREAK +case 76: +YY_RULE_SETUP +#line 134 "parser/impossible.l" +{ + char *tmp = strdup(yytext); + char *index = strstr(tmp, "kk") - 1; + *index = '\0'; + + free(tmp); + yylval.v = new Int(atoi(yytext)*1000000); return INTEGER; +} + YY_BREAK +case 77: +YY_RULE_SETUP +#line 144 "parser/impossible.l" +{ + char *tmp = strdup(yytext); + + char *i1 = strtok(tmp,"e"); + char *i2 = strtok(NULL,"e"); + + int exp = atoi(i2); + int r = 1; + + for (int i = 0; i < exp; ++i) + r *= 10; + + r *= atoi(i1); + + free(tmp); + yylval.v = new Int(r); return INTEGER; +} + YY_BREAK +case 78: +YY_RULE_SETUP +#line 161 "parser/impossible.l" +{ yylval.v = new Float(atof(yytext)); return FLOAT; } + YY_BREAK +case 79: +/* rule 79 can match eol */ +YY_RULE_SETUP +#line 163 "parser/impossible.l" +{ yytext[strlen(yytext)-1] = '\0'; yylval.v = new Value(TYPE_STRING, new String(&yytext[1])); return STRING_LITERAL; } + YY_BREAK +case 80: +YY_RULE_SETUP +#line 165 "parser/impossible.l" +{ /*yylval.str = strdup(yytext);*/ return STRING; } + YY_BREAK +case 81: +/* rule 81 can match eol */ +YY_RULE_SETUP +#line 169 "parser/impossible.l" +{ return T_EOL; } + YY_BREAK +case 82: +YY_RULE_SETUP +#line 170 "parser/impossible.l" +{ /* ignore whitespace */ } + YY_BREAK +case 83: +YY_RULE_SETUP +#line 172 "parser/impossible.l" +{ printf("Mystery character %c\n", *yytext); fflush(stdout); } + YY_BREAK +case 84: +YY_RULE_SETUP +#line 174 "parser/impossible.l" +ECHO; + YY_BREAK +#line 1279 "lex.yy.c" +case YY_STATE_EOF(INITIAL): + yyterminate(); + + case YY_END_OF_BUFFER: + { + /* Amount of text matched not including the EOB char. */ + int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1; + + /* Undo the effects of YY_DO_BEFORE_ACTION. */ + *yy_cp = (yy_hold_char); + YY_RESTORE_YY_MORE_OFFSET + + if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW ) + { + /* We're scanning a new file or input source. It's + * possible that this happened because the user + * just pointed yyin at a new source and called + * yylex(). If so, then we have to assure + * consistency between YY_CURRENT_BUFFER and our + * globals. Here is the right place to do so, because + * this is the first action (other than possibly a + * back-up) that will match for the new input source. + */ + (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; + YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin; + YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL; + } + + /* Note that here we test for yy_c_buf_p "<=" to the position + * of the first EOB in the buffer, since yy_c_buf_p will + * already have been incremented past the NUL character + * (since all states make transitions on EOB to the + * end-of-buffer state). Contrast this with the test + * in input(). + */ + if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) + { /* This was really a NUL. */ + yy_state_type yy_next_state; + + (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text; + + yy_current_state = yy_get_previous_state( ); + + /* Okay, we're now positioned to make the NUL + * transition. We couldn't have + * yy_get_previous_state() go ahead and do it + * for us because it doesn't know how to deal + * with the possibility of jamming (and we don't + * want to build jamming into it because then it + * will run more slowly). + */ + + yy_next_state = yy_try_NUL_trans( yy_current_state ); + + yy_bp = (yytext_ptr) + YY_MORE_ADJ; + + if ( yy_next_state ) + { + /* Consume the NUL. */ + yy_cp = ++(yy_c_buf_p); + yy_current_state = yy_next_state; + goto yy_match; + } + + else + { + yy_cp = (yy_c_buf_p); + goto yy_find_action; + } + } + + else switch ( yy_get_next_buffer( ) ) + { + case EOB_ACT_END_OF_FILE: + { + (yy_did_buffer_switch_on_eof) = 0; + + if ( yywrap( ) ) + { + /* Note: because we've taken care in + * yy_get_next_buffer() to have set up + * yytext, we can now set up + * yy_c_buf_p so that if some total + * hoser (like flex itself) wants to + * call the scanner after we return the + * YY_NULL, it'll still work - another + * YY_NULL will get returned. + */ + (yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ; + + yy_act = YY_STATE_EOF(YY_START); + goto do_action; + } + + else + { + if ( ! (yy_did_buffer_switch_on_eof) ) + YY_NEW_FILE; + } + break; + } + + case EOB_ACT_CONTINUE_SCAN: + (yy_c_buf_p) = + (yytext_ptr) + yy_amount_of_matched_text; + + yy_current_state = yy_get_previous_state( ); + + yy_cp = (yy_c_buf_p); + yy_bp = (yytext_ptr) + YY_MORE_ADJ; + goto yy_match; + + case EOB_ACT_LAST_MATCH: + (yy_c_buf_p) = + &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)]; + + yy_current_state = yy_get_previous_state( ); + + yy_cp = (yy_c_buf_p); + yy_bp = (yytext_ptr) + YY_MORE_ADJ; + goto yy_find_action; + } + break; + } + + default: + YY_FATAL_ERROR( + "fatal flex scanner internal error--no action found" ); + } /* end of action switch */ + } /* end of scanning one token */ +} /* end of yylex */ + +/* yy_get_next_buffer - try to read in a new buffer + * + * Returns a code representing an action: + * EOB_ACT_LAST_MATCH - + * EOB_ACT_CONTINUE_SCAN - continue scanning from current position + * EOB_ACT_END_OF_FILE - end of file + */ +static int yy_get_next_buffer (void) +{ + register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf; + register char *source = (yytext_ptr); + register int number_to_move, i; + int ret_val; + + if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] ) + YY_FATAL_ERROR( + "fatal flex scanner internal error--end of buffer missed" ); + + if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 ) + { /* Don't try to fill the buffer, so this is an EOF. */ + if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 ) + { + /* We matched a single character, the EOB, so + * treat this as a final EOF. + */ + return EOB_ACT_END_OF_FILE; + } + + else + { + /* We matched some text prior to the EOB, first + * process it. + */ + return EOB_ACT_LAST_MATCH; + } + } + + /* Try to read more data. */ + + /* First move last chars to start of buffer. */ + number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr)) - 1; + + for ( i = 0; i < number_to_move; ++i ) + *(dest++) = *(source++); + + if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING ) + /* don't do the read, it's not guaranteed to return an EOF, + * just force an EOF + */ + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0; + + else + { + yy_size_t num_to_read = + YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1; + + while ( num_to_read <= 0 ) + { /* Not enough room in the buffer - grow it. */ + + /* just a shorter name for the current buffer */ + YY_BUFFER_STATE b = YY_CURRENT_BUFFER; + + int yy_c_buf_p_offset = + (int) ((yy_c_buf_p) - b->yy_ch_buf); + + if ( b->yy_is_our_buffer ) + { + yy_size_t new_size = b->yy_buf_size * 2; + + if ( new_size <= 0 ) + b->yy_buf_size += b->yy_buf_size / 8; + else + b->yy_buf_size *= 2; + + b->yy_ch_buf = (char *) + /* Include room in for 2 EOB chars. */ + yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 ); + } + else + /* Can't grow it, we don't own it. */ + b->yy_ch_buf = 0; + + if ( ! b->yy_ch_buf ) + YY_FATAL_ERROR( + "fatal error - scanner input buffer overflow" ); + + (yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset]; + + num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size - + number_to_move - 1; + + } + + if ( num_to_read > YY_READ_BUF_SIZE ) + num_to_read = YY_READ_BUF_SIZE; + + /* Read in more data. */ + YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]), + (yy_n_chars), num_to_read ); + + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); + } + + if ( (yy_n_chars) == 0 ) + { + if ( number_to_move == YY_MORE_ADJ ) + { + ret_val = EOB_ACT_END_OF_FILE; + yyrestart(yyin ); + } + + else + { + ret_val = EOB_ACT_LAST_MATCH; + YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = + YY_BUFFER_EOF_PENDING; + } + } + + else + ret_val = EOB_ACT_CONTINUE_SCAN; + + if ((yy_size_t) ((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) { + /* Extend the array by 50%, plus the number we really need. */ + yy_size_t new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1); + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size ); + if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) + YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" ); + } + + (yy_n_chars) += number_to_move; + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR; + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR; + + (yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0]; + + return ret_val; +} + +/* yy_get_previous_state - get the state just before the EOB char was reached */ + + static yy_state_type yy_get_previous_state (void) +{ + register yy_state_type yy_current_state; + register char *yy_cp; + + yy_current_state = (yy_start); + + for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp ) + { + register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); + if ( yy_accept[yy_current_state] ) + { + (yy_last_accepting_state) = yy_current_state; + (yy_last_accepting_cpos) = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 111 ) + yy_c = yy_meta[(unsigned int) yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; + } + + return yy_current_state; +} + +/* yy_try_NUL_trans - try to make a transition on the NUL character + * + * synopsis + * next_state = yy_try_NUL_trans( current_state ); + */ + static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state ) +{ + register int yy_is_jam; + register char *yy_cp = (yy_c_buf_p); + + register YY_CHAR yy_c = 1; + if ( yy_accept[yy_current_state] ) + { + (yy_last_accepting_state) = yy_current_state; + (yy_last_accepting_cpos) = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 111 ) + yy_c = yy_meta[(unsigned int) yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; + yy_is_jam = (yy_current_state == 110); + + return yy_is_jam ? 0 : yy_current_state; +} + + static void yyunput (int c, register char * yy_bp ) +{ + register char *yy_cp; + + yy_cp = (yy_c_buf_p); + + /* undo effects of setting up yytext */ + *yy_cp = (yy_hold_char); + + if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 ) + { /* need to shift things up to make room */ + /* +2 for EOB chars. */ + register yy_size_t number_to_move = (yy_n_chars) + 2; + register char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[ + YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2]; + register char *source = + &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]; + + while ( source > YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) + *--dest = *--source; + + yy_cp += (int) (dest - source); + yy_bp += (int) (dest - source); + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = + (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_buf_size; + + if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 ) + YY_FATAL_ERROR( "flex scanner push-back overflow" ); + } + + *--yy_cp = (char) c; + + (yytext_ptr) = yy_bp; + (yy_hold_char) = *yy_cp; + (yy_c_buf_p) = yy_cp; +} + +#ifndef YY_NO_INPUT +#ifdef __cplusplus + static int yyinput (void) +#else + static int input (void) +#endif + +{ + int c; + + *(yy_c_buf_p) = (yy_hold_char); + + if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR ) + { + /* yy_c_buf_p now points to the character we want to return. + * If this occurs *before* the EOB characters, then it's a + * valid NUL; if not, then we've hit the end of the buffer. + */ + if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) + /* This was really a NUL. */ + *(yy_c_buf_p) = '\0'; + + else + { /* need more input */ + yy_size_t offset = (yy_c_buf_p) - (yytext_ptr); + ++(yy_c_buf_p); + + switch ( yy_get_next_buffer( ) ) + { + case EOB_ACT_LAST_MATCH: + /* This happens because yy_g_n_b() + * sees that we've accumulated a + * token and flags that we need to + * try matching the token before + * proceeding. But for input(), + * there's no matching to consider. + * So convert the EOB_ACT_LAST_MATCH + * to EOB_ACT_END_OF_FILE. + */ + + /* Reset buffer status. */ + yyrestart(yyin ); + + /*FALLTHROUGH*/ + + case EOB_ACT_END_OF_FILE: + { + if ( yywrap( ) ) + return 0; + + if ( ! (yy_did_buffer_switch_on_eof) ) + YY_NEW_FILE; +#ifdef __cplusplus + return yyinput(); +#else + return input(); +#endif + } + + case EOB_ACT_CONTINUE_SCAN: + (yy_c_buf_p) = (yytext_ptr) + offset; + break; + } + } + } + + c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */ + *(yy_c_buf_p) = '\0'; /* preserve yytext */ + (yy_hold_char) = *++(yy_c_buf_p); + + return c; +} +#endif /* ifndef YY_NO_INPUT */ + +/** Immediately switch to a different input stream. + * @param input_file A readable stream. + * + * @note This function does not reset the start condition to @c INITIAL . + */ + void yyrestart (FILE * input_file ) +{ + + if ( ! YY_CURRENT_BUFFER ){ + yyensure_buffer_stack (); + YY_CURRENT_BUFFER_LVALUE = + yy_create_buffer(yyin,YY_BUF_SIZE ); + } + + yy_init_buffer(YY_CURRENT_BUFFER,input_file ); + yy_load_buffer_state( ); +} + +/** Switch to a different input buffer. + * @param new_buffer The new input buffer. + * + */ + void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ) +{ + + /* TODO. We should be able to replace this entire function body + * with + * yypop_buffer_state(); + * yypush_buffer_state(new_buffer); + */ + yyensure_buffer_stack (); + if ( YY_CURRENT_BUFFER == new_buffer ) + return; + + if ( YY_CURRENT_BUFFER ) + { + /* Flush out information for old buffer. */ + *(yy_c_buf_p) = (yy_hold_char); + YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); + } + + YY_CURRENT_BUFFER_LVALUE = new_buffer; + yy_load_buffer_state( ); + + /* We don't actually know whether we did this switch during + * EOF (yywrap()) processing, but the only time this flag + * is looked at is after yywrap() is called, so it's safe + * to go ahead and always set it. + */ + (yy_did_buffer_switch_on_eof) = 1; +} + +static void yy_load_buffer_state (void) +{ + (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; + (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos; + yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file; + (yy_hold_char) = *(yy_c_buf_p); +} + +/** Allocate and initialize an input buffer state. + * @param file A readable stream. + * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE. + * + * @return the allocated buffer state. + */ + YY_BUFFER_STATE yy_create_buffer (FILE * file, int size ) +{ + YY_BUFFER_STATE b; + + b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) ); + if ( ! b ) + YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); + + b->yy_buf_size = size; + + /* yy_ch_buf has to be 2 characters longer than the size given because + * we need to put in 2 end-of-buffer characters. + */ + b->yy_ch_buf = (char *) yyalloc(b->yy_buf_size + 2 ); + if ( ! b->yy_ch_buf ) + YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); + + b->yy_is_our_buffer = 1; + + yy_init_buffer(b,file ); + + return b; +} + +/** Destroy the buffer. + * @param b a buffer created with yy_create_buffer() + * + */ + void yy_delete_buffer (YY_BUFFER_STATE b ) +{ + + if ( ! b ) + return; + + if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */ + YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0; + + if ( b->yy_is_our_buffer ) + yyfree((void *) b->yy_ch_buf ); + + yyfree((void *) b ); +} + +#ifndef __cplusplus +extern int isatty (int ); +#endif /* __cplusplus */ + +/* Initializes or reinitializes a buffer. + * This function is sometimes called more than once on the same buffer, + * such as during a yyrestart() or at EOF. + */ + static void yy_init_buffer (YY_BUFFER_STATE b, FILE * file ) + +{ + int oerrno = errno; + + yy_flush_buffer(b ); + + b->yy_input_file = file; + b->yy_fill_buffer = 1; + + /* If b is the current buffer, then yy_init_buffer was _probably_ + * called from yyrestart() or through yy_get_next_buffer. + * In that case, we don't want to reset the lineno or column. + */ + if (b != YY_CURRENT_BUFFER){ + b->yy_bs_lineno = 1; + b->yy_bs_column = 0; + } + + b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; + + errno = oerrno; +} + +/** Discard all buffered characters. On the next scan, YY_INPUT will be called. + * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER. + * + */ + void yy_flush_buffer (YY_BUFFER_STATE b ) +{ + if ( ! b ) + return; + + b->yy_n_chars = 0; + + /* We always need two end-of-buffer characters. The first causes + * a transition to the end-of-buffer state. The second causes + * a jam in that state. + */ + b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR; + b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR; + + b->yy_buf_pos = &b->yy_ch_buf[0]; + + b->yy_at_bol = 1; + b->yy_buffer_status = YY_BUFFER_NEW; + + if ( b == YY_CURRENT_BUFFER ) + yy_load_buffer_state( ); +} + +/** Pushes the new state onto the stack. The new state becomes + * the current state. This function will allocate the stack + * if necessary. + * @param new_buffer The new state. + * + */ +void yypush_buffer_state (YY_BUFFER_STATE new_buffer ) +{ + if (new_buffer == NULL) + return; + + yyensure_buffer_stack(); + + /* This block is copied from yy_switch_to_buffer. */ + if ( YY_CURRENT_BUFFER ) + { + /* Flush out information for old buffer. */ + *(yy_c_buf_p) = (yy_hold_char); + YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); + } + + /* Only push if top exists. Otherwise, replace top. */ + if (YY_CURRENT_BUFFER) + (yy_buffer_stack_top)++; + YY_CURRENT_BUFFER_LVALUE = new_buffer; + + /* copied from yy_switch_to_buffer. */ + yy_load_buffer_state( ); + (yy_did_buffer_switch_on_eof) = 1; +} + +/** Removes and deletes the top of the stack, if present. + * The next element becomes the new top. + * + */ +void yypop_buffer_state (void) +{ + if (!YY_CURRENT_BUFFER) + return; + + yy_delete_buffer(YY_CURRENT_BUFFER ); + YY_CURRENT_BUFFER_LVALUE = NULL; + if ((yy_buffer_stack_top) > 0) + --(yy_buffer_stack_top); + + if (YY_CURRENT_BUFFER) { + yy_load_buffer_state( ); + (yy_did_buffer_switch_on_eof) = 1; + } +} + +/* Allocates the stack if it does not exist. + * Guarantees space for at least one push. + */ +static void yyensure_buffer_stack (void) +{ + yy_size_t num_to_alloc; + + if (!(yy_buffer_stack)) { + + /* First allocation is just for 2 elements, since we don't know if this + * scanner will even need a stack. We use 2 instead of 1 to avoid an + * immediate realloc on the next call. + */ + num_to_alloc = 1; + (yy_buffer_stack) = (struct yy_buffer_state**)yyalloc + (num_to_alloc * sizeof(struct yy_buffer_state*) + ); + if ( ! (yy_buffer_stack) ) + YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); + + memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*)); + + (yy_buffer_stack_max) = num_to_alloc; + (yy_buffer_stack_top) = 0; + return; + } + + if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){ + + /* Increase the buffer to prepare for a possible push. */ + int grow_size = 8 /* arbitrary grow size */; + + num_to_alloc = (yy_buffer_stack_max) + grow_size; + (yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc + ((yy_buffer_stack), + num_to_alloc * sizeof(struct yy_buffer_state*) + ); + if ( ! (yy_buffer_stack) ) + YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); + + /* zero only the new slots.*/ + memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*)); + (yy_buffer_stack_max) = num_to_alloc; + } +} + +/** Setup the input buffer state to scan directly from a user-specified character buffer. + * @param base the character buffer + * @param size the size in bytes of the character buffer + * + * @return the newly allocated buffer state object. + */ +YY_BUFFER_STATE yy_scan_buffer (char * base, yy_size_t size ) +{ + YY_BUFFER_STATE b; + + if ( size < 2 || + base[size-2] != YY_END_OF_BUFFER_CHAR || + base[size-1] != YY_END_OF_BUFFER_CHAR ) + /* They forgot to leave room for the EOB's. */ + return 0; + + b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) ); + if ( ! b ) + YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" ); + + b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ + b->yy_buf_pos = b->yy_ch_buf = base; + b->yy_is_our_buffer = 0; + b->yy_input_file = 0; + b->yy_n_chars = b->yy_buf_size; + b->yy_is_interactive = 0; + b->yy_at_bol = 1; + b->yy_fill_buffer = 0; + b->yy_buffer_status = YY_BUFFER_NEW; + + yy_switch_to_buffer(b ); + + return b; +} + +/** Setup the input buffer state to scan a string. The next call to yylex() will + * scan from a @e copy of @a str. + * @param yystr a NUL-terminated string to scan + * + * @return the newly allocated buffer state object. + * @note If you want to scan bytes that may contain NUL values, then use + * yy_scan_bytes() instead. + */ +YY_BUFFER_STATE yy_scan_string (yyconst char * yystr ) +{ + + return yy_scan_bytes(yystr,strlen(yystr) ); +} + +/** Setup the input buffer state to scan the given bytes. The next call to yylex() will + * scan from a @e copy of @a bytes. + * @param bytes the byte buffer to scan + * @param len the number of bytes in the buffer pointed to by @a bytes. + * + * @return the newly allocated buffer state object. + */ +YY_BUFFER_STATE yy_scan_bytes (yyconst char * yybytes, yy_size_t _yybytes_len ) +{ + YY_BUFFER_STATE b; + char *buf; + yy_size_t n, i; + + /* Get memory for full buffer, including space for trailing EOB's. */ + n = _yybytes_len + 2; + buf = (char *) yyalloc(n ); + if ( ! buf ) + YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" ); + + for ( i = 0; i < _yybytes_len; ++i ) + buf[i] = yybytes[i]; + + buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR; + + b = yy_scan_buffer(buf,n ); + if ( ! b ) + YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" ); + + /* It's okay to grow etc. this buffer, and we should throw it + * away when we're done. + */ + b->yy_is_our_buffer = 1; + + return b; +} + +#ifndef YY_EXIT_FAILURE +#define YY_EXIT_FAILURE 2 +#endif + +static void yy_fatal_error (yyconst char* msg ) +{ + (void) fprintf( stderr, "%s\n", msg ); + exit( YY_EXIT_FAILURE ); +} + +/* Redefine yyless() so it works in section 3 code. */ + +#undef yyless +#define yyless(n) \ + do \ + { \ + /* Undo effects of setting up yytext. */ \ + int yyless_macro_arg = (n); \ + YY_LESS_LINENO(yyless_macro_arg);\ + yytext[yyleng] = (yy_hold_char); \ + (yy_c_buf_p) = yytext + yyless_macro_arg; \ + (yy_hold_char) = *(yy_c_buf_p); \ + *(yy_c_buf_p) = '\0'; \ + yyleng = yyless_macro_arg; \ + } \ + while ( 0 ) + +/* Accessor methods (get/set functions) to struct members. */ + +/** Get the current line number. + * + */ +int yyget_lineno (void) +{ + + return yylineno; +} + +/** Get the input stream. + * + */ +FILE *yyget_in (void) +{ + return yyin; +} + +/** Get the output stream. + * + */ +FILE *yyget_out (void) +{ + return yyout; +} + +/** Get the length of the current token. + * + */ +yy_size_t yyget_leng (void) +{ + return yyleng; +} + +/** Get the current token. + * + */ + +char *yyget_text (void) +{ + return yytext; +} + +/** Set the current line number. + * @param line_number + * + */ +void yyset_lineno (int line_number ) +{ + + yylineno = line_number; +} + +/** Set the input stream. This does not discard the current + * input buffer. + * @param in_str A readable stream. + * + * @see yy_switch_to_buffer + */ +void yyset_in (FILE * in_str ) +{ + yyin = in_str ; +} + +void yyset_out (FILE * out_str ) +{ + yyout = out_str ; +} + +int yyget_debug (void) +{ + return yy_flex_debug; +} + +void yyset_debug (int bdebug ) +{ + yy_flex_debug = bdebug ; +} + +static int yy_init_globals (void) +{ + /* Initialization is the same as for the non-reentrant scanner. + * This function is called from yylex_destroy(), so don't allocate here. + */ + + (yy_buffer_stack) = 0; + (yy_buffer_stack_top) = 0; + (yy_buffer_stack_max) = 0; + (yy_c_buf_p) = (char *) 0; + (yy_init) = 0; + (yy_start) = 0; + +/* Defined in main.c */ +#ifdef YY_STDINIT + yyin = stdin; + yyout = stdout; +#else + yyin = (FILE *) 0; + yyout = (FILE *) 0; +#endif + + /* For future reference: Set errno on error, since we are called by + * yylex_init() + */ + return 0; +} + +/* yylex_destroy is for both reentrant and non-reentrant scanners. */ +int yylex_destroy (void) +{ + + /* Pop the buffer stack, destroying each element. */ + while(YY_CURRENT_BUFFER){ + yy_delete_buffer(YY_CURRENT_BUFFER ); + YY_CURRENT_BUFFER_LVALUE = NULL; + yypop_buffer_state(); + } + + /* Destroy the stack itself. */ + yyfree((yy_buffer_stack) ); + (yy_buffer_stack) = NULL; + + /* Reset the globals. This is important in a non-reentrant scanner so the next time + * yylex() is called, initialization will occur. */ + yy_init_globals( ); + + return 0; +} + +/* + * Internal utility routines. + */ + +#ifndef yytext_ptr +static void yy_flex_strncpy (char* s1, yyconst char * s2, int n ) +{ + register int i; + for ( i = 0; i < n; ++i ) + s1[i] = s2[i]; +} +#endif + +#ifdef YY_NEED_STRLEN +static int yy_flex_strlen (yyconst char * s ) +{ + register int n; + for ( n = 0; s[n]; ++n ) + ; + + return n; +} +#endif + +void *yyalloc (yy_size_t size ) +{ + return (void *) malloc( size ); +} + +void *yyrealloc (void * ptr, yy_size_t size ) +{ + /* The cast to (char *) in the following accommodates both + * implementations that use char* generic pointers, and those + * that use void* generic pointers. It works with the latter + * because both ANSI C and C++ allow castless assignment from + * any pointer type to void*, and deal with argument conversions + * as though doing an assignment. + */ + return (void *) realloc( (char *) ptr, size ); +} + +void yyfree (void * ptr ) +{ + free( (char *) ptr ); /* see yyrealloc() for (char *) cast */ +} + +#define YYTABLES_NAME "yytables" + +#line 174 "parser/impossible.l" + + + + diff --git a/src/help.cpp b/src/help.cpp index 80f04a2..8cab8b3 100644 --- a/src/help.cpp +++ b/src/help.cpp @@ -12,224 +12,224 @@ using namespace std; std::multimap Help::operators; -std::multimap Help::constructors; +std::multimap Help::constructors; const char* Help::topicString(Topic topic) { switch (topic) { - case TOPIC_NUMERICS: return "numeric"; - case TOPIC_BITWISE: return "bitwise"; - case TOPIC_STACK: return "stack"; - case TOPIC_COLLECTIONS: return "collections"; - case TOPIC_UTILITY: return "utility"; - case TOPIC_FUNCTIONAL: return "functional"; - case TOPIC_LOGIC: return "logic"; - case TOPIC_TEXT: return "text"; + case Topic::NUMERICS: return "numeric"; + case Topic::BITWISE: return "bitwise"; + case Topic::STACK: return "stack"; + case Topic::COLLECTIONS: return "collections"; + case Topic::UTILITY: return "utility"; + case Topic::FUNCTIONAL: return "functional"; + case Topic::LOGIC: return "logic"; + case Topic::TEXT: return "text"; } } void Help::init() { - addOperator("+", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "sum", TOPIC_NUMERICS, "addition between integers", "2 2 +", "4")); - addOperator("+", OpHelpEntry::binary(TYPE_FLOAT, TYPE_FLOAT, TYPE_FLOAT, "sum", TOPIC_NUMERICS, "addition between floats", "", "")); - addOperator("+", OpHelpEntry::binary(TYPE_CHAR, TYPE_INT, TYPE_CHAR, "shift", TOPIC_TEXT, "shift a char by adding an integer value to its value", "", "")); - addOperator("+", OpHelpEntry::binary(TYPE_CHAR, TYPE_CHAR, TYPE_STRING, "concatenate", TOPIC_TEXT, "concatenate two strings", "", "")); - addOperator("+", OpHelpEntry::binary(TYPE_STRING, TYPE_GENERIC, TYPE_STRING, "append", TOPIC_TEXT, "append string representation of value to string", "", "")); - - addOperator("+:", OpHelpEntry::binary(TYPE_LIST, TYPE_LIST, TYPE_LIST, "diadic sum", TOPIC_COLLECTIONS, "applies + operation between each pair of elements in lists", "", "")); - addOperator("+:", OpHelpEntry::binary(TYPE_ARRAY, TYPE_ARRAY, TYPE_ARRAY, "diadic sum", TOPIC_COLLECTIONS, "applies + operation between each pair of elements in arrays", "", "")); - - addOperator("+.", OpHelpEntry::unary(TYPE_LIST, TYPE_GENERIC, "monadic sum", TOPIC_COLLECTIONS, "applies + operation between each pair of elements in the list", "", "")); - addOperator("+.", OpHelpEntry::unary(TYPE_ARRAY, TYPE_GENERIC, "monadic sum", TOPIC_COLLECTIONS, "applies + operation between each pair of elements in the array", "", "")); - - addOperator("-:", OpHelpEntry::binary(TYPE_LIST, TYPE_LIST, TYPE_LIST, "diadic sub", TOPIC_COLLECTIONS, "applies - operation between each pair of elements in lists", "", "")); - addOperator("-:", OpHelpEntry::binary(TYPE_ARRAY, TYPE_ARRAY, TYPE_ARRAY, "diadic sub", TOPIC_COLLECTIONS, "applies - operation between each pair of elements in arrays", "", "")); + addOperator("+", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "sum", Topic::NUMERICS, "addition between integers", "2 2 +", "4")); + addOperator("+", OpHelpEntry::binary(TYPE_FLOAT, TYPE_FLOAT, TYPE_FLOAT, "sum", Topic::NUMERICS, "addition between floats", "", "")); + addOperator("+", OpHelpEntry::binary(TYPE_CHAR, TYPE_INT, TYPE_CHAR, "shift", Topic::TEXT, "shift a char by adding an integer value to its value", "", "")); + addOperator("+", OpHelpEntry::binary(TYPE_CHAR, TYPE_CHAR, TYPE_STRING, "concatenate", Topic::TEXT, "concatenate two strings", "", "")); + addOperator("+", OpHelpEntry::binary(TYPE_STRING, TYPE_GENERIC, TYPE_STRING, "append", Topic::TEXT, "append string representation of value to string", "", "")); + + addOperator("+:", OpHelpEntry::binary(TYPE_LIST, TYPE_LIST, TYPE_LIST, "diadic sum", Topic::COLLECTIONS, "applies + operation between each pair of elements in lists", "", "")); + addOperator("+:", OpHelpEntry::binary(TYPE_ARRAY, TYPE_ARRAY, TYPE_ARRAY, "diadic sum", Topic::COLLECTIONS, "applies + operation between each pair of elements in arrays", "", "")); + + addOperator("+.", OpHelpEntry::unary(TYPE_LIST, TYPE_GENERIC, "monadic sum", Topic::COLLECTIONS, "applies + operation between each pair of elements in the list", "", "")); + addOperator("+.", OpHelpEntry::unary(TYPE_ARRAY, TYPE_GENERIC, "monadic sum", Topic::COLLECTIONS, "applies + operation between each pair of elements in the array", "", "")); + + addOperator("-:", OpHelpEntry::binary(TYPE_LIST, TYPE_LIST, TYPE_LIST, "diadic sub", Topic::COLLECTIONS, "applies - operation between each pair of elements in lists", "", "")); + addOperator("-:", OpHelpEntry::binary(TYPE_ARRAY, TYPE_ARRAY, TYPE_ARRAY, "diadic sub", Topic::COLLECTIONS, "applies - operation between each pair of elements in arrays", "", "")); - addOperator("-.", OpHelpEntry::unary(TYPE_LIST, TYPE_GENERIC, "monadic sub", TOPIC_COLLECTIONS, "applies - operation between each pair of elements in the list", "", "")); - addOperator("-.", OpHelpEntry::unary(TYPE_ARRAY, TYPE_GENERIC, "monadic sub", TOPIC_COLLECTIONS, "applies - operation between each pair of elements in the array", "", "")); - - addOperator("*:", OpHelpEntry::binary(TYPE_LIST, TYPE_LIST, TYPE_LIST, "diadic times", TOPIC_COLLECTIONS, "applies * operation between each pair of elements in lists", "", "")); - addOperator("*:", OpHelpEntry::binary(TYPE_ARRAY, TYPE_ARRAY, TYPE_ARRAY, "diadic times", TOPIC_COLLECTIONS, "applies * operation between each pair of elements in arrays", "", "")); - - addOperator("*.", OpHelpEntry::unary(TYPE_LIST, TYPE_GENERIC, "monadic times", TOPIC_COLLECTIONS, "applies * operation between each pair of elements in the list", "", "")); - addOperator("*.", OpHelpEntry::unary(TYPE_ARRAY, TYPE_GENERIC, "monadic times", TOPIC_COLLECTIONS, "applies * operation between each pair of elements in the array", "", "")); - - addOperator("/:", OpHelpEntry::binary(TYPE_LIST, TYPE_LIST, TYPE_LIST, "diadic div", TOPIC_COLLECTIONS, "applies / operation between each pair of elements in lists", "", "")); - addOperator("/:", OpHelpEntry::binary(TYPE_ARRAY, TYPE_ARRAY, TYPE_ARRAY, "diadic div", TOPIC_COLLECTIONS, "applies / operation between each pair of elements in arrays", "", "")); - - addOperator("/.", OpHelpEntry::unary(TYPE_LIST, TYPE_GENERIC, "monadic div", TOPIC_COLLECTIONS, "applies / operation between each pair of elements in the list", "", "")); - addOperator("/.", OpHelpEntry::unary(TYPE_ARRAY, TYPE_GENERIC, "monadic div", TOPIC_COLLECTIONS, "applies / operation between each pair of elements in the array", "", "")); - - addOperator("-", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "sub", TOPIC_NUMERICS, "subtraction between integers", "", "")); - addOperator("-", OpHelpEntry::binary(TYPE_FLOAT, TYPE_FLOAT, TYPE_FLOAT, "sub", TOPIC_NUMERICS, "subtraction between floats", "", "")); - addOperator("-", OpHelpEntry::binary(TYPE_CHAR, TYPE_INT, TYPE_CHAR, "shift", TOPIC_TEXT, "shift a char by subtracting an integer value to its value", "", "")); - - addOperator("/", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "div", TOPIC_NUMERICS, "division between integers", "", "")); - addOperator("/", OpHelpEntry::binary(TYPE_FLOAT, TYPE_FLOAT, TYPE_FLOAT, "div", TOPIC_NUMERICS, "division between floats", "", "")); - addOperator("/", OpHelpEntry::binary(TYPE_SET, TYPE_SET, TYPE_SET, "union", TOPIC_COLLECTIONS, "computes set difference", "", "")); - - addOperator("*", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "mul", TOPIC_NUMERICS, "multiplication between integers", "", "")); - addOperator("*", OpHelpEntry::binary(TYPE_FLOAT, TYPE_FLOAT, TYPE_FLOAT, "mul", TOPIC_NUMERICS, "multiplication between floats", "", "")); - - addOperator("_", OpHelpEntry::unary(TYPE_INT, TYPE_INT, "negation", TOPIC_NUMERICS, "negates integer", "", "")); - addOperator("_", OpHelpEntry::unary(TYPE_FLOAT, TYPE_FLOAT, "negation", TOPIC_NUMERICS, "negates float", "", "")); - addOperator("_", OpHelpEntry::unaryO(TYPE_LIST, TYPE_LIST, TYPE_INT, "size", TOPIC_COLLECTIONS, "pushes the size of the list", "", "")); - addOperator("_", OpHelpEntry::unaryO(TYPE_ARRAY, TYPE_ARRAY, TYPE_INT, "size", TOPIC_COLLECTIONS, "pushes the size of the array", "", "")); - addOperator("_", OpHelpEntry::unaryO(TYPE_STACK, TYPE_STACK, TYPE_INT, "size", TOPIC_COLLECTIONS, "pushes the size of the stack", "", "")); - addOperator("_", OpHelpEntry::unaryO(TYPE_QUEUE, TYPE_QUEUE, TYPE_INT, "size", TOPIC_COLLECTIONS, "pushes the size of the queue", "", "")); - addOperator("_", OpHelpEntry::unaryO(TYPE_MAP, TYPE_MAP, TYPE_INT, "size", TOPIC_COLLECTIONS, "pushes the size of the map", "", "")); - addOperator("_", OpHelpEntry::unaryO(TYPE_STRING, TYPE_LIST, TYPE_INT, "length", TOPIC_COLLECTIONS, "pushes the length of the string", "", "")); - addOperator("_", OpHelpEntry::unaryO(TYPE_LAZY_ARRAY, TYPE_LAZY_ARRAY, TYPE_INT, "size", TOPIC_COLLECTIONS, "pushes the size of the generated terms of the lazy array", "", "")); - - addOperator("//", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "mod", TOPIC_NUMERICS, "computes modulo between integers", "", "")); - addOperator("//", OpHelpEntry::unaryO(TYPE_FLOAT, TYPE_FLOAT, TYPE_FLOAT, "modf", TOPIC_NUMERICS, "computes integer and fractional part of a float number", "", "")); - - addOperator("<", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_BOOL, "lesser", TOPIC_NUMERICS, "pushes true on stack if first value is lesser than second", "", "")); - addOperator("<", OpHelpEntry::binary(TYPE_FLOAT, TYPE_FLOAT, TYPE_BOOL, "lesser", TOPIC_NUMERICS, "pushes true on stack if first value is lesser than second", "", "")); - addOperator("<", OpHelpEntry::unaryO(TYPE_LIST, TYPE_LIST, TYPE_GENERIC, "min", TOPIC_COLLECTIONS, "finds minimum element of a list", "", "")); - addOperator("<", OpHelpEntry::unaryO(TYPE_ARRAY, TYPE_ARRAY, TYPE_GENERIC, "min", TOPIC_COLLECTIONS, "finds minimum element of an array", "", "")); + addOperator("-.", OpHelpEntry::unary(TYPE_LIST, TYPE_GENERIC, "monadic sub", Topic::COLLECTIONS, "applies - operation between each pair of elements in the list", "", "")); + addOperator("-.", OpHelpEntry::unary(TYPE_ARRAY, TYPE_GENERIC, "monadic sub", Topic::COLLECTIONS, "applies - operation between each pair of elements in the array", "", "")); + + addOperator("*:", OpHelpEntry::binary(TYPE_LIST, TYPE_LIST, TYPE_LIST, "diadic times", Topic::COLLECTIONS, "applies * operation between each pair of elements in lists", "", "")); + addOperator("*:", OpHelpEntry::binary(TYPE_ARRAY, TYPE_ARRAY, TYPE_ARRAY, "diadic times", Topic::COLLECTIONS, "applies * operation between each pair of elements in arrays", "", "")); + + addOperator("*.", OpHelpEntry::unary(TYPE_LIST, TYPE_GENERIC, "monadic times", Topic::COLLECTIONS, "applies * operation between each pair of elements in the list", "", "")); + addOperator("*.", OpHelpEntry::unary(TYPE_ARRAY, TYPE_GENERIC, "monadic times", Topic::COLLECTIONS, "applies * operation between each pair of elements in the array", "", "")); + + addOperator("/:", OpHelpEntry::binary(TYPE_LIST, TYPE_LIST, TYPE_LIST, "diadic div", Topic::COLLECTIONS, "applies / operation between each pair of elements in lists", "", "")); + addOperator("/:", OpHelpEntry::binary(TYPE_ARRAY, TYPE_ARRAY, TYPE_ARRAY, "diadic div", Topic::COLLECTIONS, "applies / operation between each pair of elements in arrays", "", "")); + + addOperator("/.", OpHelpEntry::unary(TYPE_LIST, TYPE_GENERIC, "monadic div", Topic::COLLECTIONS, "applies / operation between each pair of elements in the list", "", "")); + addOperator("/.", OpHelpEntry::unary(TYPE_ARRAY, TYPE_GENERIC, "monadic div", Topic::COLLECTIONS, "applies / operation between each pair of elements in the array", "", "")); + + addOperator("-", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "sub", Topic::NUMERICS, "subtraction between integers", "", "")); + addOperator("-", OpHelpEntry::binary(TYPE_FLOAT, TYPE_FLOAT, TYPE_FLOAT, "sub", Topic::NUMERICS, "subtraction between floats", "", "")); + addOperator("-", OpHelpEntry::binary(TYPE_CHAR, TYPE_INT, TYPE_CHAR, "shift", Topic::TEXT, "shift a char by subtracting an integer value to its value", "", "")); + + addOperator("/", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "div", Topic::NUMERICS, "division between integers", "", "")); + addOperator("/", OpHelpEntry::binary(TYPE_FLOAT, TYPE_FLOAT, TYPE_FLOAT, "div", Topic::NUMERICS, "division between floats", "", "")); + addOperator("/", OpHelpEntry::binary(TYPE_SET, TYPE_SET, TYPE_SET, "union", Topic::COLLECTIONS, "computes set difference", "", "")); + + addOperator("*", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "mul", Topic::NUMERICS, "multiplication between integers", "", "")); + addOperator("*", OpHelpEntry::binary(TYPE_FLOAT, TYPE_FLOAT, TYPE_FLOAT, "mul", Topic::NUMERICS, "multiplication between floats", "", "")); + + addOperator("_", OpHelpEntry::unary(TYPE_INT, TYPE_INT, "negation", Topic::NUMERICS, "negates integer", "", "")); + addOperator("_", OpHelpEntry::unary(TYPE_FLOAT, TYPE_FLOAT, "negation", Topic::NUMERICS, "negates float", "", "")); + addOperator("_", OpHelpEntry::unaryO(TYPE_LIST, TYPE_LIST, TYPE_INT, "size", Topic::COLLECTIONS, "pushes the size of the list", "", "")); + addOperator("_", OpHelpEntry::unaryO(TYPE_ARRAY, TYPE_ARRAY, TYPE_INT, "size", Topic::COLLECTIONS, "pushes the size of the array", "", "")); + addOperator("_", OpHelpEntry::unaryO(TYPE_STACK, TYPE_STACK, TYPE_INT, "size", Topic::COLLECTIONS, "pushes the size of the stack", "", "")); + addOperator("_", OpHelpEntry::unaryO(TYPE_QUEUE, TYPE_QUEUE, TYPE_INT, "size", Topic::COLLECTIONS, "pushes the size of the queue", "", "")); + addOperator("_", OpHelpEntry::unaryO(TYPE_MAP, TYPE_MAP, TYPE_INT, "size", Topic::COLLECTIONS, "pushes the size of the map", "", "")); + addOperator("_", OpHelpEntry::unaryO(TYPE_STRING, TYPE_LIST, TYPE_INT, "length", Topic::COLLECTIONS, "pushes the length of the string", "", "")); + addOperator("_", OpHelpEntry::unaryO(TYPE_LAZY_ARRAY, TYPE_LAZY_ARRAY, TYPE_INT, "size", Topic::COLLECTIONS, "pushes the size of the generated terms of the lazy array", "", "")); + + addOperator("//", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "mod", Topic::NUMERICS, "computes modulo between integers", "", "")); + addOperator("//", OpHelpEntry::unaryO(TYPE_FLOAT, TYPE_FLOAT, TYPE_FLOAT, "modf", Topic::NUMERICS, "computes integer and fractional part of a float number", "", "")); + + addOperator("<", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_BOOL, "lesser", Topic::NUMERICS, "pushes true on stack if first value is lesser than second", "", "")); + addOperator("<", OpHelpEntry::binary(TYPE_FLOAT, TYPE_FLOAT, TYPE_BOOL, "lesser", Topic::NUMERICS, "pushes true on stack if first value is lesser than second", "", "")); + addOperator("<", OpHelpEntry::unaryO(TYPE_LIST, TYPE_LIST, TYPE_GENERIC, "min", Topic::COLLECTIONS, "finds minimum element of a list", "", "")); + addOperator("<", OpHelpEntry::unaryO(TYPE_ARRAY, TYPE_ARRAY, TYPE_GENERIC, "min", Topic::COLLECTIONS, "finds minimum element of an array", "", "")); - addOperator(">", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_BOOL, "greater", TOPIC_NUMERICS, "pushes true on stack if first value is greater than second", "", "")); - addOperator(">", OpHelpEntry::binary(TYPE_FLOAT, TYPE_FLOAT, TYPE_BOOL, "greater", TOPIC_NUMERICS, "pushes true on stack if first value is greater than second", "", "")); - addOperator(">", OpHelpEntry::unaryO(TYPE_LIST, TYPE_LIST, TYPE_GENERIC, "max", TOPIC_COLLECTIONS, "finds maximum element of a list", "", "")); - addOperator(">", OpHelpEntry::unaryO(TYPE_ARRAY, TYPE_ARRAY, TYPE_GENERIC, "max", TOPIC_COLLECTIONS, "finds maximum element of an array", "", "")); - - addOperator("&", OpHelpEntry::binary(TYPE_BOOL, TYPE_BOOL, TYPE_BOOL, "and", TOPIC_LOGIC, "computes logical and between two booleans", "", "")); - addOperator("&", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "and", TOPIC_BITWISE, "computes bitwise and between two integers", "", "")); - addOperator("&", OpHelpEntry::binary(TYPE_SET, TYPE_SET, TYPE_SET, "intersection", TOPIC_COLLECTIONS, "computes set intersection", "", "")); + addOperator(">", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_BOOL, "greater", Topic::NUMERICS, "pushes true on stack if first value is greater than second", "", "")); + addOperator(">", OpHelpEntry::binary(TYPE_FLOAT, TYPE_FLOAT, TYPE_BOOL, "greater", Topic::NUMERICS, "pushes true on stack if first value is greater than second", "", "")); + addOperator(">", OpHelpEntry::unaryO(TYPE_LIST, TYPE_LIST, TYPE_GENERIC, "max", Topic::COLLECTIONS, "finds maximum element of a list", "", "")); + addOperator(">", OpHelpEntry::unaryO(TYPE_ARRAY, TYPE_ARRAY, TYPE_GENERIC, "max", Topic::COLLECTIONS, "finds maximum element of an array", "", "")); + + addOperator("&", OpHelpEntry::binary(TYPE_BOOL, TYPE_BOOL, TYPE_BOOL, "and", Topic::LOGIC, "computes logical and between two booleans", "", "")); + addOperator("&", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "and", Topic::BITWISE, "computes bitwise and between two integers", "", "")); + addOperator("&", OpHelpEntry::binary(TYPE_SET, TYPE_SET, TYPE_SET, "intersection", Topic::COLLECTIONS, "computes set intersection", "", "")); - addOperator("|", OpHelpEntry::binary(TYPE_BOOL, TYPE_BOOL, TYPE_BOOL, "or", TOPIC_LOGIC, "computes logical or between two booleans", "", "")); - addOperator("|", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "or", TOPIC_BITWISE, "computes bitwise or between two integers", "", "")); - addOperator("|", OpHelpEntry::binary(TYPE_SET, TYPE_SET, TYPE_SET, "union", TOPIC_COLLECTIONS, "computes set union", "", "")); - addOperator("|", OpHelpEntry::binary(TYPE_RANGE, TYPE_RANGE, TYPE_RANGE, "union", TOPIC_NUMERICS, "computes union of ranges", "", "")); - addOperator("|", OpHelpEntry::binary(TYPE_RANGE, TYPE_INT, TYPE_RANGE, "union", TOPIC_NUMERICS, "insert range composed by single integer to range", "", "")); + addOperator("|", OpHelpEntry::binary(TYPE_BOOL, TYPE_BOOL, TYPE_BOOL, "or", Topic::LOGIC, "computes logical or between two booleans", "", "")); + addOperator("|", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "or", Topic::BITWISE, "computes bitwise or between two integers", "", "")); + addOperator("|", OpHelpEntry::binary(TYPE_SET, TYPE_SET, TYPE_SET, "union", Topic::COLLECTIONS, "computes set union", "", "")); + addOperator("|", OpHelpEntry::binary(TYPE_RANGE, TYPE_RANGE, TYPE_RANGE, "union", Topic::NUMERICS, "computes union of ranges", "", "")); + addOperator("|", OpHelpEntry::binary(TYPE_RANGE, TYPE_INT, TYPE_RANGE, "union", Topic::NUMERICS, "insert range composed by single integer to range", "", "")); - addOperator("~", OpHelpEntry::unary(TYPE_BOOL, TYPE_BOOL, "not", TOPIC_LOGIC, "computes logical not of a boolean", "", "")); - addOperator("~", OpHelpEntry::unary(TYPE_INT, TYPE_INT, "not", TOPIC_BITWISE, "computes bitwise not of an integer", "", "")); - addOperator("~", OpHelpEntry::unary(TYPE_FLOAT, TYPE_FLOAT, "reciprocal", TOPIC_NUMERICS, "computes reciprocal (1/n) of float value", "", "")); - addOperator("~", OpHelpEntry::unary(TYPE_LIST, TYPE_LIST, "reverse", TOPIC_COLLECTIONS, "reverses a list", "", "")); - addOperator("~", OpHelpEntry::unary(TYPE_ARRAY, TYPE_ARRAY, "reverse", TOPIC_COLLECTIONS, "reverses an array", "", "")); - addOperator("~", OpHelpEntry::unary(TYPE_STRING, TYPE_STRING, "reverse", TOPIC_TEXT, "reverses a string", "", "")); - addOperator("~", OpHelpEntry::unary(TYPE_RANGE, TYPE_ARRAY, "concretize", TOPIC_COLLECTIONS, "build an explicit integer array from a range", "", "")); - addOperator("~", OpHelpEntry::unary(TYPE_LAZY_ARRAY, TYPE_ARRAY, "concretize", TOPIC_COLLECTIONS, "build a concrete array with all elements already generated in a lazy array", "", "")); - - addOperator(">>", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "right shift", TOPIC_BITWISE, "integer right shift of specified amount", "", "")); - addOperator(">>", OpHelpEntry::binary(TYPE_LIST, TYPE_LAMBDA, TYPE_LIST, "filter", TOPIC_COLLECTIONS, "filter list by keeping only values that satisfy predicate", "", "")); - addOperator(">>", OpHelpEntry::binary(TYPE_ARRAY, TYPE_LAMBDA, TYPE_ARRAY, "filter", TOPIC_COLLECTIONS, "filter array by keeping only values that satisfy predicate", "", "")); - - addOperator("<<", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "left shift", TOPIC_BITWISE, "integer left shift of specified amount", "", "")); + addOperator("~", OpHelpEntry::unary(TYPE_BOOL, TYPE_BOOL, "not", Topic::LOGIC, "computes logical not of a boolean", "", "")); + addOperator("~", OpHelpEntry::unary(TYPE_INT, TYPE_INT, "not", Topic::BITWISE, "computes bitwise not of an integer", "", "")); + addOperator("~", OpHelpEntry::unary(TYPE_FLOAT, TYPE_FLOAT, "reciprocal", Topic::NUMERICS, "computes reciprocal (1/n) of float value", "", "")); + addOperator("~", OpHelpEntry::unary(TYPE_LIST, TYPE_LIST, "reverse", Topic::COLLECTIONS, "reverses a list", "", "")); + addOperator("~", OpHelpEntry::unary(TYPE_ARRAY, TYPE_ARRAY, "reverse", Topic::COLLECTIONS, "reverses an array", "", "")); + addOperator("~", OpHelpEntry::unary(TYPE_STRING, TYPE_STRING, "reverse", Topic::TEXT, "reverses a string", "", "")); + addOperator("~", OpHelpEntry::unary(TYPE_RANGE, TYPE_ARRAY, "concretize", Topic::COLLECTIONS, "build an explicit integer array from a range", "", "")); + addOperator("~", OpHelpEntry::unary(TYPE_LAZY_ARRAY, TYPE_ARRAY, "concretize", Topic::COLLECTIONS, "build a concrete array with all elements already generated in a lazy array", "", "")); + + addOperator(">>", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "right shift", Topic::BITWISE, "integer right shift of specified amount", "", "")); + addOperator(">>", OpHelpEntry::binary(TYPE_LIST, TYPE_LAMBDA, TYPE_LIST, "filter", Topic::COLLECTIONS, "filter list by keeping only values that satisfy predicate", "", "")); + addOperator(">>", OpHelpEntry::binary(TYPE_ARRAY, TYPE_LAMBDA, TYPE_ARRAY, "filter", Topic::COLLECTIONS, "filter array by keeping only values that satisfy predicate", "", "")); + + addOperator("<<", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "left shift", Topic::BITWISE, "integer left shift of specified amount", "", "")); - addOperator("!", OpHelpEntry::unary(TYPE_LAMBDA, TYPE_UNKNOWN, "apply", TOPIC_FUNCTIONAL, "pop first value from stack and executes it as a lambda", "1 [2+] !", "3")); - addOperator("!", OpHelpEntry::unary(TYPE_INT, TYPE_FLOAT, "factorial", TOPIC_NUMERICS, "computes factorial", "", "")); - addOperator("=", OpHelpEntry::binary(TYPE_GENERIC, TYPE_GENERIC, TYPE_BOOL, "eq", TOPIC_LOGIC, "push true on stack if two topmost values are equal", "", "")); + addOperator("!", OpHelpEntry::unary(TYPE_LAMBDA, TYPE_UNKNOWN, "apply", Topic::FUNCTIONAL, "pop first value from stack and executes it as a lambda", "1 [2+] !", "3")); + addOperator("!", OpHelpEntry::unary(TYPE_INT, TYPE_FLOAT, "factorial", Topic::NUMERICS, "computes factorial", "", "")); + addOperator("=", OpHelpEntry::binary(TYPE_GENERIC, TYPE_GENERIC, TYPE_BOOL, "eq", Topic::LOGIC, "push true on stack if two topmost values are equal", "", "")); - addOperator("^", OpHelpEntry::unary(TYPE_GENERIC, "peek", TOPIC_UTILITY, "prints stack topmost value", "", "")); - - addOperator("$", OpHelpEntry::unaryO(TYPE_GENERIC, TYPE_GENERIC, TYPE_GENERIC, "dupe", TOPIC_STACK, "dupe topmost value of stack", "", "")); - addOperator("%", OpHelpEntry::binaryO(TYPE_GENERIC, TYPE_GENERIC2, TYPE_GENERIC2, TYPE_GENERIC, "swap", TOPIC_STACK, "swap two topmost value of stack", "", "")); - addOperator(";", OpHelpEntry::unary(TYPE_GENERIC, "drop", TOPIC_STACK, "discard topmost stack element", "", "")); - addOperator(",", OpHelpEntry::unary(TYPE_INT, TYPE_GENERIC, "pick", TOPIC_STACK, "pick nth element from stack, the index is calculated after popping the integer value", "", "")); - addOperator("(>", OpHelpEntry::ternaryO2(TYPE_GENERIC, TYPE_GENERIC2, TYPE_GENERIC3, TYPE_GENERIC2, TYPE_GENERIC3, TYPE_GENERIC, "rise", TOPIC_STACK, "rise third value on the top of the stack", "", "")); - addOperator("s", OpHelpEntry::unary(TYPE_GENERIC, TYPE_STRING, "string cast", TOPIC_TEXT, "convert the value to string", "", "")); + addOperator("^", OpHelpEntry::unary(TYPE_GENERIC, "peek", Topic::UTILITY, "prints stack topmost value", "", "")); + + addOperator("$", OpHelpEntry::unaryO(TYPE_GENERIC, TYPE_GENERIC, TYPE_GENERIC, "dupe", Topic::STACK, "dupe topmost value of stack", "", "")); + addOperator("%", OpHelpEntry::binaryO(TYPE_GENERIC, TYPE_GENERIC2, TYPE_GENERIC2, TYPE_GENERIC, "swap", Topic::STACK, "swap two topmost value of stack", "", "")); + addOperator(";", OpHelpEntry::unary(TYPE_GENERIC, "drop", Topic::STACK, "discard topmost stack element", "", "")); + addOperator(",", OpHelpEntry::unary(TYPE_INT, TYPE_GENERIC, "pick", Topic::STACK, "pick nth element from stack, the index is calculated after popping the integer value", "", "")); + addOperator("(>", OpHelpEntry::ternaryO2(TYPE_GENERIC, TYPE_GENERIC2, TYPE_GENERIC3, TYPE_GENERIC2, TYPE_GENERIC3, TYPE_GENERIC, "rise", Topic::STACK, "rise third value on the top of the stack", "", "")); + addOperator("s", OpHelpEntry::unary(TYPE_GENERIC, TYPE_STRING, "string cast", Topic::TEXT, "convert the value to string", "", "")); - addOperator("?", OpHelpEntry::binary(TYPE_BOOL, TYPE_LAMBDA, TYPE_UNKNOWN, "if", TOPIC_LOGIC, "executes lambda if boolean value is true", "", "")); - addOperator("?", OpHelpEntry::binaryO(TYPE_LIST, TYPE_GENERIC, TYPE_LIST, TYPE_BOOL, "contains", TOPIC_COLLECTIONS, "pushes true if value is contained in list", "", "")); - addOperator("?", OpHelpEntry::binaryO(TYPE_ARRAY, TYPE_GENERIC, TYPE_ARRAY, TYPE_BOOL, "contains", TOPIC_COLLECTIONS, "pushes true if value is contained in array", "", "")); - addOperator("?", OpHelpEntry::binaryO(TYPE_STACK, TYPE_GENERIC, TYPE_STACK, TYPE_BOOL, "contains", TOPIC_COLLECTIONS, "pushes true if value is contained in stack", "", "")); - addOperator("?", OpHelpEntry::binaryO(TYPE_QUEUE, TYPE_GENERIC, TYPE_QUEUE, TYPE_BOOL, "contains", TOPIC_COLLECTIONS, "pushes true if value is contained in queue", "", "")); - addOperator("?", OpHelpEntry::binaryO(TYPE_SET, TYPE_GENERIC, TYPE_SET, TYPE_BOOL, "contains", TOPIC_COLLECTIONS, "pushes true if value is contained in set", "", "")); - addOperator("?", OpHelpEntry::binaryO(TYPE_MAP, TYPE_GENERIC, TYPE_MAP, TYPE_BOOL, "contains", TOPIC_COLLECTIONS, "pushes true if key is contained in map", "", "")); + addOperator("?", OpHelpEntry::binary(TYPE_BOOL, TYPE_LAMBDA, TYPE_UNKNOWN, "if", Topic::LOGIC, "executes lambda if boolean value is true", "", "")); + addOperator("?", OpHelpEntry::binaryO(TYPE_LIST, TYPE_GENERIC, TYPE_LIST, TYPE_BOOL, "contains", Topic::COLLECTIONS, "pushes true if value is contained in list", "", "")); + addOperator("?", OpHelpEntry::binaryO(TYPE_ARRAY, TYPE_GENERIC, TYPE_ARRAY, TYPE_BOOL, "contains", Topic::COLLECTIONS, "pushes true if value is contained in array", "", "")); + addOperator("?", OpHelpEntry::binaryO(TYPE_STACK, TYPE_GENERIC, TYPE_STACK, TYPE_BOOL, "contains", Topic::COLLECTIONS, "pushes true if value is contained in stack", "", "")); + addOperator("?", OpHelpEntry::binaryO(TYPE_QUEUE, TYPE_GENERIC, TYPE_QUEUE, TYPE_BOOL, "contains", Topic::COLLECTIONS, "pushes true if value is contained in queue", "", "")); + addOperator("?", OpHelpEntry::binaryO(TYPE_SET, TYPE_GENERIC, TYPE_SET, TYPE_BOOL, "contains", Topic::COLLECTIONS, "pushes true if value is contained in set", "", "")); + addOperator("?", OpHelpEntry::binaryO(TYPE_MAP, TYPE_GENERIC, TYPE_MAP, TYPE_BOOL, "contains", Topic::COLLECTIONS, "pushes true if key is contained in map", "", "")); - addOperator("??", OpHelpEntry::ternary(TYPE_BOOL, TYPE_LAMBDA, TYPE_LAMBDA, TYPE_UNKNOWN, "if-else", TOPIC_LOGIC, "executes first lambda if boolean is true, second lambda otherwise", "", "")); + addOperator("??", OpHelpEntry::ternary(TYPE_BOOL, TYPE_LAMBDA, TYPE_LAMBDA, TYPE_UNKNOWN, "if-else", Topic::LOGIC, "executes first lambda if boolean is true, second lambda otherwise", "", "")); - addOperator("@", OpHelpEntry::binaryO(TYPE_ARRAY, TYPE_INT, TYPE_ARRAY, TYPE_GENERIC, "at", TOPIC_COLLECTIONS, "retrieves n-th element from an array", "", "")); - addOperator("@", OpHelpEntry::binaryO(TYPE_ARRAY, TYPE_INT, TYPE_ARRAY, TYPE_ARRAY, "extract", TOPIC_COLLECTIONS, "retrieves all the elements specified by the range into a new array", "", "")); - addOperator("@", OpHelpEntry::unaryO(TYPE_STACK, TYPE_STACK, TYPE_GENERIC, "pop", TOPIC_COLLECTIONS, "pop element from stack", "", "")); - addOperator("@", OpHelpEntry::unaryO(TYPE_QUEUE, TYPE_QUEUE, TYPE_GENERIC, "pop", TOPIC_COLLECTIONS, "pop element from top of the queue", "", "")); - addOperator("@", OpHelpEntry::binaryO(TYPE_MAP, TYPE_GENERIC, TYPE_MAP, TYPE_GENERIC2, "get", TOPIC_COLLECTIONS, "get element specified by key from map, pushes nil if key is not present", "", "")); - addOperator("@", OpHelpEntry::binaryO(TYPE_LAZY_ARRAY, TYPE_INT, TYPE_LAZY_ARRAY, TYPE_GENERIC, "at", TOPIC_COLLECTIONS, "retrieves n-th element from the lazy array, value will be generated if needed", "", "")); - addOperator("@", OpHelpEntry::binaryO(TYPE_LAZY_ARRAY, TYPE_RANGE, TYPE_LAZY_ARRAY, TYPE_ARRAY, "extract", TOPIC_COLLECTIONS, "retrieves all the elements specified by the range from the lazy array", "", "")); + addOperator("@", OpHelpEntry::binaryO(TYPE_ARRAY, TYPE_INT, TYPE_ARRAY, TYPE_GENERIC, "at", Topic::COLLECTIONS, "retrieves n-th element from an array", "", "")); + addOperator("@", OpHelpEntry::binaryO(TYPE_ARRAY, TYPE_INT, TYPE_ARRAY, TYPE_ARRAY, "extract", Topic::COLLECTIONS, "retrieves all the elements specified by the range into a new array", "", "")); + addOperator("@", OpHelpEntry::unaryO(TYPE_STACK, TYPE_STACK, TYPE_GENERIC, "pop", Topic::COLLECTIONS, "pop element from stack", "", "")); + addOperator("@", OpHelpEntry::unaryO(TYPE_QUEUE, TYPE_QUEUE, TYPE_GENERIC, "pop", Topic::COLLECTIONS, "pop element from top of the queue", "", "")); + addOperator("@", OpHelpEntry::binaryO(TYPE_MAP, TYPE_GENERIC, TYPE_MAP, TYPE_GENERIC2, "get", Topic::COLLECTIONS, "get element specified by key from map, pushes nil if key is not present", "", "")); + addOperator("@", OpHelpEntry::binaryO(TYPE_LAZY_ARRAY, TYPE_INT, TYPE_LAZY_ARRAY, TYPE_GENERIC, "at", Topic::COLLECTIONS, "retrieves n-th element from the lazy array, value will be generated if needed", "", "")); + addOperator("@", OpHelpEntry::binaryO(TYPE_LAZY_ARRAY, TYPE_RANGE, TYPE_LAZY_ARRAY, TYPE_ARRAY, "extract", Topic::COLLECTIONS, "retrieves all the elements specified by the range from the lazy array", "", "")); - addOperator("#", OpHelpEntry::ternary(TYPE_ARRAY, TYPE_INT, TYPE_GENERIC, TYPE_ARRAY, "set", TOPIC_COLLECTIONS, "set n-th element specified by integer of array", "", "")); - addOperator("#", OpHelpEntry::ternary(TYPE_MAP, TYPE_GENERIC, TYPE_GENERIC2, TYPE_MAP, "set", TOPIC_COLLECTIONS, "set value for key in map", "", "")); - addOperator("#", OpHelpEntry::binary(TYPE_SET, TYPE_GENERIC, TYPE_SET, "insert", TOPIC_COLLECTIONS, "insert element in set", "", "")); - addOperator("#", OpHelpEntry::binary(TYPE_STACK, TYPE_GENERIC, TYPE_STACK, "push", TOPIC_COLLECTIONS, "push an element on top of the stack", "", "")); - addOperator("#", OpHelpEntry::binary(TYPE_QUEUE, TYPE_GENERIC, TYPE_QUEUE, "push", TOPIC_COLLECTIONS, "push element back in the queue", "", "")); + addOperator("#", OpHelpEntry::ternary(TYPE_ARRAY, TYPE_INT, TYPE_GENERIC, TYPE_ARRAY, "set", Topic::COLLECTIONS, "set n-th element specified by integer of array", "", "")); + addOperator("#", OpHelpEntry::ternary(TYPE_MAP, TYPE_GENERIC, TYPE_GENERIC2, TYPE_MAP, "set", Topic::COLLECTIONS, "set value for key in map", "", "")); + addOperator("#", OpHelpEntry::binary(TYPE_SET, TYPE_GENERIC, TYPE_SET, "insert", Topic::COLLECTIONS, "insert element in set", "", "")); + addOperator("#", OpHelpEntry::binary(TYPE_STACK, TYPE_GENERIC, TYPE_STACK, "push", Topic::COLLECTIONS, "push an element on top of the stack", "", "")); + addOperator("#", OpHelpEntry::binary(TYPE_QUEUE, TYPE_GENERIC, TYPE_QUEUE, "push", Topic::COLLECTIONS, "push element back in the queue", "", "")); - addOperator("<#", OpHelpEntry::binary(TYPE_LIST, TYPE_GENERIC, TYPE_LIST, "push front", TOPIC_COLLECTIONS, "push value on top of the list", "", "")); - addOperator(">#", OpHelpEntry::binary(TYPE_LIST, TYPE_GENERIC, TYPE_LIST, "push back", TOPIC_COLLECTIONS, "push value on back of the list", "", "")); - addOperator("<@", OpHelpEntry::unaryO(TYPE_LIST, TYPE_LIST, TYPE_GENERIC, "pop front", TOPIC_COLLECTIONS, "pop value from top of the list", "", "")); - addOperator(">@", OpHelpEntry::unaryO(TYPE_LIST, TYPE_LIST, TYPE_GENERIC, "pop back", TOPIC_COLLECTIONS, "pop value from back of the list", "", "")); + addOperator("<#", OpHelpEntry::binary(TYPE_LIST, TYPE_GENERIC, TYPE_LIST, "push front", Topic::COLLECTIONS, "push value on top of the list", "", "")); + addOperator(">#", OpHelpEntry::binary(TYPE_LIST, TYPE_GENERIC, TYPE_LIST, "push back", Topic::COLLECTIONS, "push value on back of the list", "", "")); + addOperator("<@", OpHelpEntry::unaryO(TYPE_LIST, TYPE_LIST, TYPE_GENERIC, "pop front", Topic::COLLECTIONS, "pop value from top of the list", "", "")); + addOperator(">@", OpHelpEntry::unaryO(TYPE_LIST, TYPE_LIST, TYPE_GENERIC, "pop back", Topic::COLLECTIONS, "pop value from back of the list", "", "")); - addOperator(".>", OpHelpEntry::binary(TYPE_LIST, TYPE_LAMBDA, TYPE_UNKNOWN, "each", TOPIC_COLLECTIONS, "executes the lambda for each element of the list", "", "")); - addOperator(".>", OpHelpEntry::binary(TYPE_ARRAY, TYPE_LAMBDA, TYPE_UNKNOWN, "each", TOPIC_COLLECTIONS, "executes the lambda for each element of the array", "", "")); - addOperator(".>", OpHelpEntry::binary(TYPE_SET, TYPE_LAMBDA, TYPE_UNKNOWN, "each", TOPIC_COLLECTIONS, "executes the lambda for each element of the set", "", "")); - addOperator(".>", OpHelpEntry::binary(TYPE_STRING, TYPE_LAMBDA, TYPE_UNKNOWN, "each", TOPIC_COLLECTIONS, "executes the lambda for each character of the string", "", "")); - addOperator(".>", OpHelpEntry::binary(TYPE_MAP, TYPE_LAMBDA, TYPE_UNKNOWN, "each", TOPIC_COLLECTIONS, "executes the lambda for each value of the map (keys are not pushed)", "", "")); - addOperator(".>", OpHelpEntry::binary(TYPE_RANGE, TYPE_LAMBDA, TYPE_UNKNOWN, "each", TOPIC_COLLECTIONS, "executes the lambda for each integer contained in range", "", "")); + addOperator(".>", OpHelpEntry::binary(TYPE_LIST, TYPE_LAMBDA, TYPE_UNKNOWN, "each", Topic::COLLECTIONS, "executes the lambda for each element of the list", "", "")); + addOperator(".>", OpHelpEntry::binary(TYPE_ARRAY, TYPE_LAMBDA, TYPE_UNKNOWN, "each", Topic::COLLECTIONS, "executes the lambda for each element of the array", "", "")); + addOperator(".>", OpHelpEntry::binary(TYPE_SET, TYPE_LAMBDA, TYPE_UNKNOWN, "each", Topic::COLLECTIONS, "executes the lambda for each element of the set", "", "")); + addOperator(".>", OpHelpEntry::binary(TYPE_STRING, TYPE_LAMBDA, TYPE_UNKNOWN, "each", Topic::COLLECTIONS, "executes the lambda for each character of the string", "", "")); + addOperator(".>", OpHelpEntry::binary(TYPE_MAP, TYPE_LAMBDA, TYPE_UNKNOWN, "each", Topic::COLLECTIONS, "executes the lambda for each value of the map (keys are not pushed)", "", "")); + addOperator(".>", OpHelpEntry::binary(TYPE_RANGE, TYPE_LAMBDA, TYPE_UNKNOWN, "each", Topic::COLLECTIONS, "executes the lambda for each integer contained in range", "", "")); - addOperator(".>:", OpHelpEntry::binary(TYPE_ARRAY, TYPE_LAMBDA, TYPE_UNKNOWN, "each with index", TOPIC_COLLECTIONS, "executes the lambda for each element of the array by pushing also the index", "", "")); - addOperator(".>:", OpHelpEntry::binary(TYPE_MAP, TYPE_LAMBDA, TYPE_UNKNOWN, "each with key", TOPIC_COLLECTIONS, "executes the lambda for each pair of the map by pushing both key and value", "", "")); + addOperator(".>:", OpHelpEntry::binary(TYPE_ARRAY, TYPE_LAMBDA, TYPE_UNKNOWN, "each with index", Topic::COLLECTIONS, "executes the lambda for each element of the array by pushing also the index", "", "")); + addOperator(".>:", OpHelpEntry::binary(TYPE_MAP, TYPE_LAMBDA, TYPE_UNKNOWN, "each with key", Topic::COLLECTIONS, "executes the lambda for each pair of the map by pushing both key and value", "", "")); - addOperator(".>.", OpHelpEntry::binary(TYPE_LIST, TYPE_LAMBDA, TYPE_LIST, "map", TOPIC_COLLECTIONS, "applies lambda to each element of the list to build a new one", "", "")); - addOperator(".>.", OpHelpEntry::binary(TYPE_ARRAY, TYPE_LAMBDA, TYPE_ARRAY, "map", TOPIC_COLLECTIONS, "applies lambda to each element of the array to build a new one", "", "")); - addOperator(".>.", OpHelpEntry::binary(TYPE_RANGE, TYPE_LAMBDA, TYPE_ARRAY, "map", TOPIC_COLLECTIONS, "applies lambda to each element of the range to build an array", "", "")); - addOperator(".>.", OpHelpEntry::binary(TYPE_STRING, TYPE_LAMBDA, TYPE_STRING, "map", TOPIC_COLLECTIONS, "applies lambda to each character of the string to build a new one", "", "")); - addOperator(".>.", OpHelpEntry::binary(TYPE_SET, TYPE_LAMBDA, TYPE_SET, "map", TOPIC_COLLECTIONS, "applies lambda to each element of the set to build a new one", "", "")); + addOperator(".>.", OpHelpEntry::binary(TYPE_LIST, TYPE_LAMBDA, TYPE_LIST, "map", Topic::COLLECTIONS, "applies lambda to each element of the list to build a new one", "", "")); + addOperator(".>.", OpHelpEntry::binary(TYPE_ARRAY, TYPE_LAMBDA, TYPE_ARRAY, "map", Topic::COLLECTIONS, "applies lambda to each element of the array to build a new one", "", "")); + addOperator(".>.", OpHelpEntry::binary(TYPE_RANGE, TYPE_LAMBDA, TYPE_ARRAY, "map", Topic::COLLECTIONS, "applies lambda to each element of the range to build an array", "", "")); + addOperator(".>.", OpHelpEntry::binary(TYPE_STRING, TYPE_LAMBDA, TYPE_STRING, "map", Topic::COLLECTIONS, "applies lambda to each character of the string to build a new one", "", "")); + addOperator(".>.", OpHelpEntry::binary(TYPE_SET, TYPE_LAMBDA, TYPE_SET, "map", Topic::COLLECTIONS, "applies lambda to each element of the set to build a new one", "", "")); - addOperator(":>:", OpHelpEntry::ternary(TYPE_LIST, TYPE_LIST, TYPE_LAMBDA, TYPE_LIST, "dmap", TOPIC_COLLECTIONS, "applies lambda to each pair of elements from both lists to build a new one", "", "")); - addOperator(":>:", OpHelpEntry::ternary(TYPE_ARRAY, TYPE_ARRAY, TYPE_LAMBDA, TYPE_ARRAY, "dmap", TOPIC_COLLECTIONS, "applies lambda to each pair of elements from both arrays to build a new one", "", "")); + addOperator(":>:", OpHelpEntry::ternary(TYPE_LIST, TYPE_LIST, TYPE_LAMBDA, TYPE_LIST, "dmap", Topic::COLLECTIONS, "applies lambda to each pair of elements from both lists to build a new one", "", "")); + addOperator(":>:", OpHelpEntry::ternary(TYPE_ARRAY, TYPE_ARRAY, TYPE_LAMBDA, TYPE_ARRAY, "dmap", Topic::COLLECTIONS, "applies lambda to each pair of elements from both arrays to build a new one", "", "")); - addOperator(":*.", OpHelpEntry::ternary(TYPE_ARRAY, TYPE_ARRAY, TYPE_LAMBDA, TYPE_ARRAY, "cartesian", TOPIC_COLLECTIONS, "applies lambda to each possible pair of elements from both arrays to build a new one", "", "")); - addOperator(":*.", OpHelpEntry::ternary(TYPE_RANGE, TYPE_RANGE, TYPE_LAMBDA, TYPE_ARRAY, "cartesian", TOPIC_COLLECTIONS, "applies lambda to each possible pair of elements from both ranges to build a new one", "", "")); + addOperator(":*.", OpHelpEntry::ternary(TYPE_ARRAY, TYPE_ARRAY, TYPE_LAMBDA, TYPE_ARRAY, "cartesian", Topic::COLLECTIONS, "applies lambda to each possible pair of elements from both arrays to build a new one", "", "")); + addOperator(":*.", OpHelpEntry::ternary(TYPE_RANGE, TYPE_RANGE, TYPE_LAMBDA, TYPE_ARRAY, "cartesian", Topic::COLLECTIONS, "applies lambda to each possible pair of elements from both ranges to build a new one", "", "")); - addOperator(":>.", OpHelpEntry::ternary(TYPE_ARRAY, TYPE_LAMBDA, TYPE_GENERIC, TYPE_GENERIC, "fold", TOPIC_COLLECTIONS, "folds an array by taking accumulator value and passing it through each element", "", "")); - addOperator(":>.", OpHelpEntry::ternary(TYPE_LIST, TYPE_LAMBDA, TYPE_GENERIC, TYPE_GENERIC, "fold", TOPIC_COLLECTIONS, "folds a list by taking accumulator value and passing it through each element", "", "")); - addOperator(":>.", OpHelpEntry::ternary(TYPE_SET, TYPE_LAMBDA, TYPE_GENERIC, TYPE_GENERIC, "fold", TOPIC_COLLECTIONS, "folds a set by taking accumulator value and passing it through each element", "", "")); + addOperator(":>.", OpHelpEntry::ternary(TYPE_ARRAY, TYPE_LAMBDA, TYPE_GENERIC, TYPE_GENERIC, "fold", Topic::COLLECTIONS, "folds an array by taking accumulator value and passing it through each element", "", "")); + addOperator(":>.", OpHelpEntry::ternary(TYPE_LIST, TYPE_LAMBDA, TYPE_GENERIC, TYPE_GENERIC, "fold", Topic::COLLECTIONS, "folds a list by taking accumulator value and passing it through each element", "", "")); + addOperator(":>.", OpHelpEntry::ternary(TYPE_SET, TYPE_LAMBDA, TYPE_GENERIC, TYPE_GENERIC, "fold", Topic::COLLECTIONS, "folds a set by taking accumulator value and passing it through each element", "", "")); - addOperator(".?", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "min", TOPIC_NUMERICS, "pushes the minimum of two integer numbers", "", "")); - addOperator(".?", OpHelpEntry::binary(TYPE_FLOAT, TYPE_FLOAT, TYPE_FLOAT, "min", TOPIC_NUMERICS, "pushes the minimum of two float numbers", "", "")); - addOperator(".?", OpHelpEntry::binary(TYPE_LIST, TYPE_LAMBDA, TYPE_BOOL, "any", TOPIC_COLLECTIONS, "pushes true on stack if at least one element in the list satisfies the lambda", "", "")); - addOperator(".?", OpHelpEntry::binary(TYPE_ARRAY, TYPE_LAMBDA, TYPE_BOOL, "any", TOPIC_COLLECTIONS, "pushes true on stack if at least one element in the array satisfies the lambda", "", "")); - addOperator(".?", OpHelpEntry::binary(TYPE_SET, TYPE_LAMBDA, TYPE_BOOL, "any", TOPIC_COLLECTIONS, "pushes true on stack if at least one element in the set satisfies the lambda", "", "")); + addOperator(".?", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "min", Topic::NUMERICS, "pushes the minimum of two integer numbers", "", "")); + addOperator(".?", OpHelpEntry::binary(TYPE_FLOAT, TYPE_FLOAT, TYPE_FLOAT, "min", Topic::NUMERICS, "pushes the minimum of two float numbers", "", "")); + addOperator(".?", OpHelpEntry::binary(TYPE_LIST, TYPE_LAMBDA, TYPE_BOOL, "any", Topic::COLLECTIONS, "pushes true on stack if at least one element in the list satisfies the lambda", "", "")); + addOperator(".?", OpHelpEntry::binary(TYPE_ARRAY, TYPE_LAMBDA, TYPE_BOOL, "any", Topic::COLLECTIONS, "pushes true on stack if at least one element in the array satisfies the lambda", "", "")); + addOperator(".?", OpHelpEntry::binary(TYPE_SET, TYPE_LAMBDA, TYPE_BOOL, "any", Topic::COLLECTIONS, "pushes true on stack if at least one element in the set satisfies the lambda", "", "")); - addOperator(":?", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "max", TOPIC_NUMERICS, "pushes the maximum of two integer numbers", "", "")); - addOperator(":?", OpHelpEntry::binary(TYPE_FLOAT, TYPE_FLOAT, TYPE_FLOAT, "max", TOPIC_NUMERICS, "pushes the maximum of two float numbers", "", "")); - addOperator(":?", OpHelpEntry::binary(TYPE_LIST, TYPE_LAMBDA, TYPE_BOOL, "every", TOPIC_COLLECTIONS, "pushes true on stack if all the elements in the list satisfies the lambda", "", "")); - addOperator(":?", OpHelpEntry::binary(TYPE_ARRAY, TYPE_LAMBDA, TYPE_BOOL, "every", TOPIC_COLLECTIONS, "pushes true on stack if all the elements in the array satisfies the lambda", "", "")); - addOperator(":?", OpHelpEntry::binary(TYPE_SET, TYPE_LAMBDA, TYPE_BOOL, "every", TOPIC_COLLECTIONS, "pushes true on stack if all the elements in the set satisfies the lambda", "", "")); + addOperator(":?", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "max", Topic::NUMERICS, "pushes the maximum of two integer numbers", "", "")); + addOperator(":?", OpHelpEntry::binary(TYPE_FLOAT, TYPE_FLOAT, TYPE_FLOAT, "max", Topic::NUMERICS, "pushes the maximum of two float numbers", "", "")); + addOperator(":?", OpHelpEntry::binary(TYPE_LIST, TYPE_LAMBDA, TYPE_BOOL, "every", Topic::COLLECTIONS, "pushes true on stack if all the elements in the list satisfies the lambda", "", "")); + addOperator(":?", OpHelpEntry::binary(TYPE_ARRAY, TYPE_LAMBDA, TYPE_BOOL, "every", Topic::COLLECTIONS, "pushes true on stack if all the elements in the array satisfies the lambda", "", "")); + addOperator(":?", OpHelpEntry::binary(TYPE_SET, TYPE_LAMBDA, TYPE_BOOL, "every", Topic::COLLECTIONS, "pushes true on stack if all the elements in the set satisfies the lambda", "", "")); - addOperator("@>", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "rand", TOPIC_NUMERICS, "generate a random value between two pushed values (not inclusive of upper bound)", "", "")); - addOperator("@>", OpHelpEntry::unary(TYPE_RANGE, TYPE_INT, "rand", TOPIC_NUMERICS, "extracts a random integer from a range (with uniform probability between all values)", "", "")); - addOperator("@>", OpHelpEntry::unary(TYPE_BOOL, TYPE_BOOL, "rand flag", TOPIC_LOGIC, "generate a random truth value (true or false)", "", "")); - addOperator("@>", OpHelpEntry::unary(TYPE_ARRAY, TYPE_GENERIC, "rand get", TOPIC_COLLECTIONS, "extracts a random value from an array", "", "")); - addOperator("@>", OpHelpEntry::unary(TYPE_LIST, TYPE_GENERIC, "rand get", TOPIC_COLLECTIONS, "extracts a random value from a list", "", "")); - addOperator("@>", OpHelpEntry::unary(TYPE_SET, TYPE_GENERIC, "rand get", TOPIC_COLLECTIONS, "extracts a random value from a set", "", "")); + addOperator("@>", OpHelpEntry::binary(TYPE_INT, TYPE_INT, TYPE_INT, "rand", Topic::NUMERICS, "generate a random value between two pushed values (not inclusive of upper bound)", "", "")); + addOperator("@>", OpHelpEntry::unary(TYPE_RANGE, TYPE_INT, "rand", Topic::NUMERICS, "extracts a random integer from a range (with uniform probability between all values)", "", "")); + addOperator("@>", OpHelpEntry::unary(TYPE_BOOL, TYPE_BOOL, "rand flag", Topic::LOGIC, "generate a random truth value (true or false)", "", "")); + addOperator("@>", OpHelpEntry::unary(TYPE_ARRAY, TYPE_GENERIC, "rand get", Topic::COLLECTIONS, "extracts a random value from an array", "", "")); + addOperator("@>", OpHelpEntry::unary(TYPE_LIST, TYPE_GENERIC, "rand get", Topic::COLLECTIONS, "extracts a random value from a list", "", "")); + addOperator("@>", OpHelpEntry::unary(TYPE_SET, TYPE_GENERIC, "rand get", Topic::COLLECTIONS, "extracts a random value from a set", "", "")); - addOperator("#>", OpHelpEntry::unary(TYPE_LIST, TYPE_LIST, "sort", TOPIC_COLLECTIONS, "sorts the specified list", "", "")); - addOperator("#>", OpHelpEntry::unary(TYPE_ARRAY, TYPE_ARRAY, "sort", TOPIC_COLLECTIONS, "sorts the specified array", "", "")); + addOperator("#>", OpHelpEntry::unary(TYPE_LIST, TYPE_LIST, "sort", Topic::COLLECTIONS, "sorts the specified list", "", "")); + addOperator("#>", OpHelpEntry::unary(TYPE_ARRAY, TYPE_ARRAY, "sort", Topic::COLLECTIONS, "sorts the specified array", "", "")); - addOperator("$>", OpHelpEntry::unary(TYPE_LIST, TYPE_LIST, "shuffle", TOPIC_COLLECTIONS, "shuffles the specified list", "", "")); - addOperator("$>", OpHelpEntry::unary(TYPE_ARRAY, TYPE_ARRAY, "shuffle", TOPIC_COLLECTIONS, "shuffles the specified array", "", "")); + addOperator("$>", OpHelpEntry::unary(TYPE_LIST, TYPE_LIST, "shuffle", Topic::COLLECTIONS, "shuffles the specified list", "", "")); + addOperator("$>", OpHelpEntry::unary(TYPE_ARRAY, TYPE_ARRAY, "shuffle", Topic::COLLECTIONS, "shuffles the specified array", "", "")); - addOperator("[#]", OpHelpEntry::nullaryO(TYPE_LAMBDA, "recur", TOPIC_FUNCTIONAL, "pushes lambda in execution on stack", "", "")); + addOperator("[#]", OpHelpEntry::nullaryO(TYPE_LAMBDA, "recur", Topic::FUNCTIONAL, "pushes lambda in execution on stack", "", "")); - addOperator("<>", OpHelpEntry::binary(TYPE_LAMBDA, TYPE_LAMBDA, TYPE_UNKNOWN, "while", TOPIC_FUNCTIONAL, "executes second lambda while first lambda evaluates to true", "", "")); - addOperator("<>", OpHelpEntry::binary(TYPE_INT, TYPE_LAMBDA, TYPE_UNKNOWN, "counter", TOPIC_FUNCTIONAL, "executes second lambda a number of times specified by integer", "", "")); - addOperator("<>", OpHelpEntry::binaryO(TYPE_LIST, TYPE_LAMBDA, TYPE_LIST, TYPE_LIST, "partition", TOPIC_COLLECTIONS, "partition a list according to predicate given by lambda", "", "")); - addOperator("<>", OpHelpEntry::binaryO(TYPE_ARRAY, TYPE_LAMBDA, TYPE_ARRAY, TYPE_ARRAY, "partition", TOPIC_COLLECTIONS, "partition an array according to predicate given by lambda", "", "")); - addOperator("<>", OpHelpEntry::binary(TYPE_LAZY_ARRAY, TYPE_LAMBDA, TYPE_LAZY_ARRAY, "generate", TOPIC_COLLECTIONS, "generates terms from a lazy array until predicate over the value becomes false", "", "")); - addOperator("<>", OpHelpEntry::binary(TYPE_LAZY_ARRAY, TYPE_INT, TYPE_LAZY_ARRAY, "generate", TOPIC_COLLECTIONS, "generates terms until size of the lazy array is equal to specified integer", "", "")); - addOperator("<>", OpHelpEntry::unary(TYPE_INT, TYPE_GENERIC, "inner get", TOPIC_FUNCTIONAL, "(ONLY AVAILABLE INSIDE A LAZY LIST DECLARATION) fetches a previous element from the lazy list", "", "")); + addOperator("<>", OpHelpEntry::binary(TYPE_LAMBDA, TYPE_LAMBDA, TYPE_UNKNOWN, "while", Topic::FUNCTIONAL, "executes second lambda while first lambda evaluates to true", "", "")); + addOperator("<>", OpHelpEntry::binary(TYPE_INT, TYPE_LAMBDA, TYPE_UNKNOWN, "counter", Topic::FUNCTIONAL, "executes second lambda a number of times specified by integer", "", "")); + addOperator("<>", OpHelpEntry::binaryO(TYPE_LIST, TYPE_LAMBDA, TYPE_LIST, TYPE_LIST, "partition", Topic::COLLECTIONS, "partition a list according to predicate given by lambda", "", "")); + addOperator("<>", OpHelpEntry::binaryO(TYPE_ARRAY, TYPE_LAMBDA, TYPE_ARRAY, TYPE_ARRAY, "partition", Topic::COLLECTIONS, "partition an array according to predicate given by lambda", "", "")); + addOperator("<>", OpHelpEntry::binary(TYPE_LAZY_ARRAY, TYPE_LAMBDA, TYPE_LAZY_ARRAY, "generate", Topic::COLLECTIONS, "generates terms from a lazy array until predicate over the value becomes false", "", "")); + addOperator("<>", OpHelpEntry::binary(TYPE_LAZY_ARRAY, TYPE_INT, TYPE_LAZY_ARRAY, "generate", Topic::COLLECTIONS, "generates terms until size of the lazy array is equal to specified integer", "", "")); + addOperator("<>", OpHelpEntry::unary(TYPE_INT, TYPE_GENERIC, "inner get", Topic::FUNCTIONAL, "(ONLY AVAILABLE INSIDE A LAZY LIST DECLARATION) fetches a previous element from the lazy list", "", "")); @@ -296,12 +296,12 @@ void Help::printHelpSummary() void Help::addConstructor(Type type, TypeConstructor constructor) { - constructors.insert(pair(type, constructor)); + constructors.emplace(std::make_pair(type, constructor)); } void Help::addOperator(string op, OpHelpEntry entry) { - operators.insert(pair(op, entry)); + operators.insert(std::make_pair(op, entry)); } void Help::printOperator(string op, OpHelpEntry o) @@ -381,15 +381,15 @@ bool Help::printHelpForType(const std::string& stype) if (type != TYPE_INVALID) { - pair::iterator,multimap::iterator> rit = constructors.equal_range(type); - multimap::iterator fit; + auto rit = constructors.equal_range(type); + decltype(rit.first) fit; if (rit.first != rit.second) cout << "available constructors:" << endl; for (fit = rit.first; fit != rit.second; ++fit) { - TypeConstructor &c = fit->second; + const TypeConstructor& c = fit->second; cout << " " << c.code << " : " << c.desc << endl; } @@ -400,7 +400,7 @@ bool Help::printHelpForType(const std::string& stype) for (it = operators.begin(); it != operators.end(); ++it) { - OpHelpEntry &o = it->second; + const OpHelpEntry& o = it->second; if (o.i[0] == type) printOperator(it->first, o); diff --git a/src/help.h b/src/help.h index f04edeb..ba895c3 100644 --- a/src/help.h +++ b/src/help.h @@ -11,22 +11,23 @@ #include "defines.h" #include "value.h" #include "collection.h" +#include "semantics.h" #include #include #include #include -enum Topic +enum class Topic { - TOPIC_NUMERICS, - TOPIC_BITWISE, - TOPIC_COLLECTIONS, - TOPIC_STACK, - TOPIC_FUNCTIONAL, - TOPIC_UTILITY, - TOPIC_LOGIC, - TOPIC_TEXT + NUMERICS, + BITWISE, + COLLECTIONS, + STACK, + FUNCTIONAL, + UTILITY, + LOGIC, + TEXT }; struct TypeConstructor @@ -48,9 +49,9 @@ struct OpHelpEntry using string = std::string; u32 io, oo; - Type i[3]; - Type o[3]; - + Arguments i; + Arguments o; + string desc; string ident; Topic topic; @@ -197,7 +198,7 @@ class Help { private: static std::multimap operators; - static std::multimap constructors; + static std::multimap constructors; static void addConstructor(Type type, TypeConstructor constructor); static void addOperator(std::string op, OpHelpEntry entry); diff --git a/src/instruction.cpp b/src/instruction.cpp index cc952e9..5140ea9 100644 --- a/src/instruction.cpp +++ b/src/instruction.cpp @@ -154,55 +154,6 @@ void filter(VM* vm, const T* collection, Code* predicate) vm->push(new T(ot)); } -#include "semantics.h" - -MicroCode microCode; - - -namespace math -{ - template struct plus { public: R operator()(T t, U u) { return t + u;} }; - template struct minus { public: R operator()(T t, U u) { return t - u;} }; - template struct times { public: R operator()(T t, U u) { return t * u;} }; - template struct divide { public: R operator()(T t, U u) { return t / u;} }; - - template struct lesser { public: R operator()(T t, U u) { return t < u;} }; - template struct greater { public: R operator()(T t, U u) { return t > u;} }; - -} - - -void registerFunctions() -{ - auto& mc = microCode; - - mc.registerNumeric(OP_PLUS); - mc.registerNumeric(OP_MINUS); - mc.registerNumeric(OP_TIMES); - mc.registerNumeric(OP_DIVIDE); - - mc.registerNumeric(OP_LESSER); - mc.registerNumeric(OP_GREATER); - - - mc.registerUnary({ OP_DUPE, TYPE_GENERIC }, { TYPE_GENERIC, TYPE_GENERIC }, [] (VM* vm, const Value& v1) { vm->push(v1); vm->push(v1); }); - - mc.registerUnary({ OP_NEG, TYPE_COLLECTION }, TYPE_COLLECTION, [] (VM* vm, const Value& v1) { vm->push(v1.collection()->size()); }); - - - const auto& v = mc.vocabulary(); - - string_joiner argsJoiner("", "", ", ", [] (const auto& t) { return t.name(); }, [] (const auto& t) { return t == TYPE_NONE; }); - - for (const auto& term : v) - { - std::cout << Instruction(term.opcode).svalue() << " " << argsJoiner.join(term.input.t) << " -> " << argsJoiner.join(term.output.t) << std::endl; - } - - std::cout << "Registered " << mc.data().size() << " terms." << std::endl; -} - - std::string Instruction::svalue() const { if (_value.type != TYPE_OPCODE) @@ -284,17 +235,8 @@ std::string Instruction::svalue() const void Instruction::execute(VM *vm) const { - if (_value.type != TYPE_OPCODE) - { - vm->push(_value); - return; - } - Value v1, v2, v3; - - if (microCode.execute(vm, _value.opcode())) - return; - + switch (_value.opcode()) { case OP_SWAP: diff --git a/src/instruction.h b/src/instruction.h index ca559a7..308d0c9 100644 --- a/src/instruction.h +++ b/src/instruction.h @@ -31,6 +31,8 @@ class Instruction final void execute(VM *vm) const; std::string svalue() const; + bool isValue() const { return _value.type != TYPE_OPCODE; } + Opcode opcode() const { return _value.opcode(); } const Value& value() const { return _value; } diff --git a/src/main.cpp b/src/main.cpp index 0453e71..8bf0913 100644 --- a/src/main.cpp +++ b/src/main.cpp @@ -10,6 +10,7 @@ #include "vm.h" #include "instruction.h" +#include "semantics.h" #include "help.h" @@ -22,14 +23,15 @@ using namespace std; -extern void registerFunctions(); int main (int argc, const char * argv[]) { - registerFunctions(); - Help::init(); + MicroCode mc; + mc.registerDefault(); - VM vm; + Help::init(); + + VM vm(mc); string input; bool finished = false; @@ -108,3 +110,25 @@ int main (int argc, const char * argv[]) } } +#include "semantics.h" + +void registerUnary(Topic topic, const std::string& name, const std::string& desc, + const std::vector>& examples, + Signature signature, Arguments retn, + const decltype(VariantFunction::unary)&& functor) +{ + +} + +void registerFunctions() +{ + registerUnary( + Topic::COLLECTIONS, "size", "returns size of the collection", + {{"(1 2 3)_", "3"}, {"{}_", "0"}}, + { OP_NEG, TYPE_COLLECTION }, TYPE_COLLECTION, + [] (VM* vm, const Value& v1) { vm->push(v1.collection()->size()); }); + + + +} + diff --git a/src/semantics.cpp b/src/semantics.cpp index 3af592a..0b74c10 100644 --- a/src/semantics.cpp +++ b/src/semantics.cpp @@ -1,7 +1,7 @@ #include "semantics.h" #include "vm.h" -bool MicroCode::execute(VM* vm, Opcode opcode) +bool MicroCode::execute(VM* vm, Opcode opcode) const { const size_t stackSize = vm->stackSize(); @@ -79,3 +79,44 @@ bool MicroCode::execute(VM* vm, Opcode opcode) return false; } + + +namespace math +{ + template struct plus { public: R operator()(T t, U u) { return t + u;} }; + template struct minus { public: R operator()(T t, U u) { return t - u;} }; + template struct times { public: R operator()(T t, U u) { return t * u;} }; + template struct divide { public: R operator()(T t, U u) { return t / u;} }; + + template struct lesser { public: R operator()(T t, U u) { return t < u;} }; + template struct greater { public: R operator()(T t, U u) { return t > u;} }; + +} + +void MicroCode::registerDefault() +{ + registerNumeric(OP_PLUS); + registerNumeric(OP_MINUS); + registerNumeric(OP_TIMES); + registerNumeric(OP_DIVIDE); + + registerNumeric(OP_LESSER); + registerNumeric(OP_GREATER); + + + registerUnary({ OP_DUPE, TYPE_GENERIC }, { TYPE_GENERIC, TYPE_GENERIC }, [] (VM* vm, const Value& v1) { vm->push(v1); vm->push(v1); }); + + registerUnary({ OP_NEG, TYPE_COLLECTION }, TYPE_COLLECTION, [] (VM* vm, const Value& v1) { vm->push(v1.collection()->size()); }); + + + const auto& v = vocabulary(); + + string_joiner argsJoiner("", "", ", ", [] (const auto& t) { return t.name(); }, [] (const auto& t) { return t == TYPE_NONE; }); + + for (const auto& term : v) + { + std::cout << Instruction(term.opcode).svalue() << " " << argsJoiner.join(term.input.t) << " -> " << argsJoiner.join(term.output.t) << std::endl; + } + + std::cout << "Registered " << vocabulary().size() << " terms." << std::endl; +} diff --git a/src/semantics.h b/src/semantics.h index 560370d..09d6463 100644 --- a/src/semantics.h +++ b/src/semantics.h @@ -28,6 +28,9 @@ struct Arguments (t[1] == o.t[1] || (t[1] == TYPE_GENERIC && o.t[1] != TYPE_NONE)) && (t[2] == o.t[2] || (t[2] == TYPE_GENERIC && o.t[2] != TYPE_NONE)); } + + TypeInfo& operator[](size_t index) { return t[index]; } + const TypeInfo& operator[](size_t index) const { return t[index]; } }; struct Signature @@ -142,6 +145,7 @@ class Vocabulary terms.push_back(Term(signature.opcode, signature.args, Arguments(returnType))); } + size_t size() const { return terms.size(); } decltype(terms)::const_iterator begin() const { return terms.begin(); } decltype(terms)::const_iterator end() const { return terms.end(); } }; @@ -150,7 +154,7 @@ void registerFunctions(); class MicroCode { private: - std::unordered_map microCode; + std::unordered_map table; struct OpcodeData { @@ -163,11 +167,11 @@ class MicroCode std::array opcodeData; - const VariantFunction* findBestOverload(Signature s) + const VariantFunction* findBestOverload(Signature s) const { /* search for perfect match first */ - auto it = microCode.find(s); - if (it != microCode.end()) return &it->second; + auto it = table.find(s); + if (it != table.end()) return &it->second; /* then try replacing collection types with generic */ s = Signature( @@ -177,8 +181,8 @@ class MicroCode s.args.t[2].isCollection() ? TypeInfo(TYPE_COLLECTION) : s.args.t[2] ); - it = microCode.find(s); - if (it != microCode.end()) return &it->second; + it = table.find(s); + if (it != table.end()) return &it->second; /* then try with generic types */ s = Signature( @@ -187,18 +191,18 @@ class MicroCode s.args.t[1] != TYPE_NONE ? TYPE_GENERIC : TYPE_NONE, s.args.t[2] != TYPE_NONE ? TYPE_GENERIC : TYPE_NONE ); - it = microCode.find(s); - if (it != microCode.end()) return &it->second; + it = table.find(s); + if (it != table.end()) return &it->second; return nullptr; } void emplace(const Signature& signature, VariantFunction&& function) { - if (microCode.find(signature) != microCode.end()) + if (table.find(signature) != table.end()) assert(false); - microCode.emplace(std::make_pair(signature, function)); + table.emplace(std::make_pair(signature, function)); } Vocabulary _vocabulary; @@ -210,8 +214,6 @@ class MicroCode } const Vocabulary& vocabulary() { return _vocabulary; } - const decltype(microCode)& data() { return microCode; } - size_t size() { return microCode.size(); } void registerUnary(Signature signature, Arguments retn, const decltype(VariantFunction::unary)&& function) { @@ -249,5 +251,7 @@ class MicroCode registerNumericTemplate, OP>(opcode); } - bool execute(VM* vm, Opcode opcode); + bool execute(VM* vm, Opcode opcode) const; + + void registerDefault(); }; diff --git a/src/vm.cpp b/src/vm.cpp index 5d1fe73..5b192c7 100644 --- a/src/vm.cpp +++ b/src/vm.cpp @@ -7,6 +7,7 @@ #include "vm.h" +#include "semantics.h" #include "instruction.h" void VM::execute(Code *code) @@ -31,10 +32,19 @@ void VM::run() { while (exec.pc < exec.code->size() && running) { - const Instruction &i = exec.code->at(exec.pc); + const Instruction& i = exec.code->at(exec.pc); - i.execute(this); + if (i.isValue()) + push(i.value()); + else + { + if (microcode.execute(this, i.opcode())) + return; + + i.execute(this); + + } - exec.pc++; + ++exec.pc; } } diff --git a/src/vm.h b/src/vm.h index 48fbdeb..4193534 100644 --- a/src/vm.h +++ b/src/vm.h @@ -19,6 +19,7 @@ #include "instruction.h" class Instruction; +class MicroCode; struct ActivationRecord { @@ -46,8 +47,11 @@ class VM bool running; bool stackPreserve; + const MicroCode& microcode; + public: - VM() : valueStack(new stack_t()), exec(ActivationRecord(nullptr)), running(false), stackPreserve(false), lazy(NULL), memory() + VM(MicroCode& microcode) : valueStack(new stack_t()), exec(ActivationRecord(nullptr)), running(false), stackPreserve(false), lazy(NULL), memory(), + microcode(microcode) { }