X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=ginsh%2Fginsh_parser.yy;h=6b2c93764a9c14286d2c24a6bea7259d7aa1f00a;hp=00aaea3e277eca841256471db8ae153835a5386f;hb=c7d9b624cb4bd5658a36fbcac2f73dbdb99edd5f;hpb=c030e24444ef604e7343bda6e88b79bbfbfe6138 diff --git a/ginsh/ginsh_parser.yy b/ginsh/ginsh_parser.yy index 00aaea3e..6b2c9376 100644 --- a/ginsh/ginsh_parser.yy +++ b/ginsh/ginsh_parser.yy @@ -4,7 +4,7 @@ * This file must be processed with yacc/bison. */ /* - * GiNaC Copyright (C) 1999-2004 Johannes Gutenberg University Mainz, Germany + * GiNaC Copyright (C) 1999-2008 Johannes Gutenberg University Mainz, Germany * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by @@ -18,7 +18,7 @@ * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software - * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA */ @@ -28,8 +28,11 @@ %{ #include "config.h" - +#ifdef HAVE_RUSAGE #include +#else +#include +#endif #if HAVE_UNISTD_H #include @@ -42,20 +45,42 @@ #define YYERROR_VERBOSE 1 +#ifdef HAVE_LIBREADLINE // Original readline settings static int orig_completion_append_character; -#if (GINAC_RL_VERSION_MAJOR < 4) || (GINAC_RL_VERSION_MAJOR == 4 && GINAC_RL_VERSION_MINOR < 2) -static char *orig_basic_word_break_characters; -#else static const char *orig_basic_word_break_characters; + +#if (RL_VERSION_MAJOR >= 5) +#define GINAC_RL_COMPLETER_CAST(a) const_cast((a)) +#else +#define GINAC_RL_COMPLETER_CAST(a) (a) #endif +#endif // HAVE_LIBREADLINE // Expression stack for %, %% and %%% static void push(const ex &e); static ex exstack[3]; +// Assigned symbols +static exmap assigned_symbol_table; // Start and end time for the time() function +#ifdef HAVE_RUSAGE static struct rusage start_time, end_time; +#define START_TIMER getrusage(RUSAGE_SELF, &start_time); +#define STOP_TIMER getrusage(RUSAGE_SELF, &end_time); +#define PRINT_TIME_USED cout << \ + (end_time.ru_utime.tv_sec - start_time.ru_utime.tv_sec) + \ + (end_time.ru_stime.tv_sec - start_time.ru_stime.tv_sec) + \ + double(end_time.ru_utime.tv_usec - start_time.ru_utime.tv_usec) / 1e6 + \ + double(end_time.ru_stime.tv_usec - start_time.ru_stime.tv_usec) / 1e6 \ + << 's' << endl; +#else +static std::clock_t start_time, end_time; +#define START_TIMER start_time = std::clock(); +#define STOP_TIMER end_time = std::clock(); +#define PRINT_TIME_USED \ + cout << double(end_time - start_time)/CLOCKS_PER_SEC << 's' << endl; +#endif // Table of functions (a multimap, because one function may appear with different // numbers of parameters) @@ -202,21 +227,21 @@ line : ';' cout << (syms.size() > 350 ? 350 : syms.size()); cout << " out of a possible 350.\n"; } - | T_REAL_SYMBOLS { symboltype = symbol_options::real; } - | T_COMPLEX_SYMBOLS { symboltype = symbol_options::complex; } - | T_TIME {getrusage(RUSAGE_SELF, &start_time);} '(' exp ')' { - getrusage(RUSAGE_SELF, &end_time); - cout << (end_time.ru_utime.tv_sec - start_time.ru_utime.tv_sec) + - (end_time.ru_stime.tv_sec - start_time.ru_stime.tv_sec) + - double(end_time.ru_utime.tv_usec - start_time.ru_utime.tv_usec) / 1e6 + - double(end_time.ru_stime.tv_usec - start_time.ru_stime.tv_usec) / 1e6 << 's' << endl; - } + | T_REAL_SYMBOLS { symboltype = domain::real; } + | T_COMPLEX_SYMBOLS { symboltype = domain::complex; } + | T_TIME { START_TIMER } '(' exp ')' { STOP_TIMER PRINT_TIME_USED } | error ';' {yyclearin; yyerrok;} | error ':' {yyclearin; yyerrok;} ; exp : T_NUMBER {$$ = $1;} - | T_SYMBOL {$$ = $1.eval();} + | T_SYMBOL { + exmap::const_iterator i = assigned_symbol_table.find($1); + if (i == assigned_symbol_table.end()) + $$ = $1; + else + $$ = i->second.eval(); + } | '\'' T_SYMBOL '\'' {$$ = $2;} | T_LITERAL {$$ = $1;} | T_DIGITS {$$ = $1;} @@ -232,7 +257,7 @@ exp : T_NUMBER {$$ = $1;} } } | T_DIGITS '=' T_NUMBER {$$ = $3; Digits = ex_to($3).to_int();} - | T_SYMBOL '=' exp {$$ = $3; const_cast(ex_to($1)).assign($3);} + | T_SYMBOL '=' exp {$$ = $3; assigned_symbol_table[$1] = $3; } | exp T_EQUAL exp {$$ = $1 == $3;} | exp T_NOTEQ exp {$$ = $1 != $3;} | exp '<' exp {$$ = $1 < $3;} @@ -307,7 +332,9 @@ static ex f_denom(const exprseq &e) {return e[0].denom();} static ex f_eval1(const exprseq &e) {return e[0].eval();} static ex f_evalf1(const exprseq &e) {return e[0].evalf();} static ex f_evalm(const exprseq &e) {return e[0].evalm();} +static ex f_eval_integ(const exprseq &e) {return e[0].eval_integ();} static ex f_expand(const exprseq &e) {return e[0].expand();} +static ex f_factor(const exprseq &e) {return factor(e[0]);} static ex f_gcd(const exprseq &e) {return gcd(e[0], e[1]);} static ex f_has(const exprseq &e) {return e[0].has(e[1]) ? ex(1) : ex(0);} static ex f_lcm(const exprseq &e) {return lcm(e[0], e[1]);} @@ -399,9 +426,31 @@ static ex f_evalf2(const exprseq &e) static ex f_find(const exprseq &e) { - lst found; + exset found; e[0].find(e[1], found); - return found; + lst l; + for (exset::const_iterator i = found.begin(); i != found.end(); ++i) + l.append(*i); + return l; +} + +static ex f_fsolve(const exprseq &e) +{ + CHECK_ARG(1, symbol, fsolve); + CHECK_ARG(2, numeric, fsolve); + CHECK_ARG(3, numeric, fsolve); + return fsolve(e[0], ex_to(e[1]), ex_to(e[2]), ex_to(e[3])); +} + +static ex f_integer_content(const exprseq &e) +{ + return e[0].expand().integer_content(); +} + +static ex f_integral(const exprseq &e) +{ + CHECK_ARG(0, symbol, integral); + return integral(e[0], e[1], e[2], e[3]); } static ex f_inverse(const exprseq &e) @@ -432,11 +481,14 @@ static ex f_map(const exprseq &e) static ex f_match(const exprseq &e) { - lst repl_lst; - if (e[0].match(e[1], repl_lst)) + exmap repls; + if (e[0].match(e[1], repls)) { + lst repl_lst; + for (exmap::const_iterator i = repls.begin(); i != repls.end(); ++i) + repl_lst.append(relational(i->first, i->second, relational::equal)); return repl_lst; - else - return fail(); + } + throw std::runtime_error("FAIL"); } static ex f_normal2(const exprseq &e) @@ -469,11 +521,23 @@ static ex f_quo(const exprseq &e) return quo(e[0], e[1], e[2]); } +static ex f_rank(const exprseq &e) +{ + CHECK_ARG(0, matrix, rank); + return ex_to(e[0]).rank(); +} + static ex f_rem(const exprseq &e) { return rem(e[0], e[1], e[2]); } +static ex f_resultant(const exprseq &e) +{ + CHECK_ARG(2, symbol, resultant); + return resultant(e[0], e[1], ex_to(e[2])); +} + static ex f_series(const exprseq &e) { CHECK_ARG(2, numeric, series); @@ -513,7 +577,9 @@ static ex f_transpose(const exprseq &e) static ex f_unassign(const exprseq &e) { CHECK_ARG(0, symbol, unassign); - const_cast(ex_to(e[0])).unassign(); + exmap::iterator i = assigned_symbol_table.find(e[0]); + if (i != assigned_symbol_table.end()) + assigned_symbol_table.erase(i); return e[0]; } @@ -555,10 +621,15 @@ static const fcn_init builtin_fcns[] = { {"evalf", f_evalf1, 1}, {"evalf", f_evalf2, 2}, {"evalm", f_evalm, 1}, + {"eval_integ", f_eval_integ, 1}, {"expand", f_expand, 1}, + {"factor", f_factor, 1}, {"find", f_find, 2}, + {"fsolve", f_fsolve, 4}, {"gcd", f_gcd, 2}, {"has", f_has, 2}, + {"integer_content", f_integer_content, 1}, + {"integral", f_integral, 4}, {"inverse", f_inverse, 1}, {"iprint", f_dummy, 0}, // for Tab-completion {"is", f_is, 1}, @@ -581,7 +652,9 @@ static const fcn_init builtin_fcns[] = { {"print_csrc", f_dummy, 0}, // for Tab-completion {"print_latex", f_dummy, 0}, // for Tab-completion {"quo", f_quo, 3}, + {"rank", f_rank, 1}, {"rem", f_rem, 3}, + {"resultant", f_resultant, 3}, {"series", f_series, 3}, {"sprem", f_sprem, 3}, {"sqrfree", f_sqrfree1, 1}, @@ -658,7 +731,8 @@ static ex f_ginac_function(const exprseq &es, int serial) } // All registered GiNaC functions -void GiNaC::ginsh_get_ginac_functions(void) +namespace GiNaC { +void ginsh_get_ginac_functions(void) { vector::const_iterator i = function::registered_functions().begin(), end = function::registered_functions().end(); unsigned serial = 0; @@ -668,6 +742,7 @@ void GiNaC::ginsh_get_ginac_functions(void) serial++; } } +} /* @@ -791,35 +866,40 @@ static char *fcn_generator(const char *text, int state) return NULL; } +#ifdef HAVE_LIBREADLINE static char **fcn_completion(const char *text, int start, int end) { if (rl_line_buffer[0] == '!') { // For shell commands, revert back to filename completion rl_completion_append_character = orig_completion_append_character; rl_basic_word_break_characters = orig_basic_word_break_characters; - rl_completer_word_break_characters = rl_basic_word_break_characters; -#if (GINAC_RL_VERSION_MAJOR < 4) || (GINAC_RL_VERSION_MAJOR == 4 && GINAC_RL_VERSION_MINOR < 2) - return completion_matches(const_cast(text), (CPFunction *)filename_completion_function); -#else + rl_completer_word_break_characters = GINAC_RL_COMPLETER_CAST(rl_basic_word_break_characters); return rl_completion_matches(text, rl_filename_completion_function); -#endif } else { // Otherwise, complete function names rl_completion_append_character = '('; rl_basic_word_break_characters = " \t\n\"#$%&'()*+,-./:;<=>?@[\\]^`{|}~"; - rl_completer_word_break_characters = rl_basic_word_break_characters; -#if (GINAC_RL_VERSION_MAJOR < 4) || (GINAC_RL_VERSION_MAJOR == 4 && GINAC_RL_VERSION_MINOR < 2) - return completion_matches(const_cast(text), (CPFunction *)fcn_generator); -#else + rl_completer_word_break_characters = GINAC_RL_COMPLETER_CAST(rl_basic_word_break_characters); return rl_completion_matches(text, fcn_generator); -#endif } } +#endif // HAVE_LIBREADLINE + +static void ginsh_readline_init(char* name) +{ +#ifdef HAVE_LIBREADLINE + // Init readline completer + rl_readline_name = name; + rl_attempted_completion_function = fcn_completion; + orig_completion_append_character = rl_completion_append_character; + orig_basic_word_break_characters = rl_basic_word_break_characters; +#endif // HAVE_LIBREADLINE +} void greeting(void) { cout << "ginsh - GiNaC Interactive Shell (" << PACKAGE << " V" << VERSION << ")" << endl; - cout << " __, _______ Copyright (C) 1999-2004 Johannes Gutenberg University Mainz,\n" + cout << " __, _______ Copyright (C) 1999-2008 Johannes Gutenberg University Mainz,\n" << " (__) * | Germany. This is free software with ABSOLUTELY NO WARRANTY.\n" << " ._) i N a C | You are welcome to redistribute it under certain conditions.\n" << "<-------------' For details type `warranty;'.\n" << endl; @@ -835,6 +915,7 @@ int main(int argc, char **argv) // Print banner in interactive mode if (isatty(0)) greeting(); + assigned_symbol_table = exmap(); // Init function table insert_fcns(builtin_fcns); @@ -858,15 +939,7 @@ int main(int argc, char **argv) insert_help("print_latex", "print_latex(expression) - prints a LaTeX representation of the given expression"); insert_help("print_csrc", "print_csrc(expression) - prints a C source code representation of the given expression"); - // Init readline completer - rl_readline_name = argv[0]; -#if (GINAC_RL_VERSION_MAJOR < 4) || (GINAC_RL_VERSION_MAJOR == 4 && GINAC_RL_VERSION_MINOR < 2) - rl_attempted_completion_function = (CPPFunction *)fcn_completion; -#else - rl_attempted_completion_function = fcn_completion; -#endif - orig_completion_append_character = rl_completion_append_character; - orig_basic_word_break_characters = rl_basic_word_break_characters; + ginsh_readline_init(argv[0]); // Init input file list, open first file num_files = argc - 1;