1 /** @file ginsh_parser.yy
3 * Input grammar definition for ginsh.
4 * This file must be processed with yacc/bison. */
7 * GiNaC Copyright (C) 1999-2003 Johannes Gutenberg University Mainz, Germany
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, write to the Free Software
21 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
32 #include <sys/resource.h>
35 #include <sys/types.h>
43 #define YYERROR_VERBOSE 1
45 // Original readline settings
46 static int orig_completion_append_character;
47 #if (GINAC_RL_VERSION_MAJOR < 4) || (GINAC_RL_VERSION_MAJOR == 4 && GINAC_RL_VERSION_MINOR < 2)
48 static char *orig_basic_word_break_characters;
50 static const char *orig_basic_word_break_characters;
53 // Expression stack for %, %% and %%%
54 static void push(const ex &e);
57 // Start and end time for the time() function
58 static struct rusage start_time, end_time;
60 // Table of functions (a multimap, because one function may appear with different
61 // numbers of parameters)
62 typedef ex (*fcnp)(const exprseq &e);
63 typedef ex (*fcnp2)(const exprseq &e, int serial);
66 fcn_desc() : p(NULL), num_params(0), is_ginac(false), serial(0) {}
67 fcn_desc(fcnp func, int num) : p(func), num_params(num), is_ginac(false), serial(0) {}
68 fcn_desc(fcnp2 func, int num, int ser) : p((fcnp)func), num_params(num), is_ginac(true), serial(ser) {}
70 fcnp p; // Pointer to function
71 int num_params; // Number of parameters (0 = arbitrary)
72 bool is_ginac; // Flag: function is GiNaC function
73 int serial; // GiNaC function serial number (if is_ginac == true)
76 typedef multimap<string, fcn_desc> fcn_tab;
79 static fcn_tab::const_iterator find_function(const ex &sym, int req_params);
81 // Table to map help topics to help strings
82 typedef multimap<string, string> help_tab;
85 static void insert_fcn_help(const char *name, const char *str);
86 static void print_help(const string &topic);
87 static void print_help_topics(void);
90 /* Tokens (T_LITERAL means a literal value returned by the parser, but not
91 of class numeric or symbol (e.g. a constant or the FAIL object)) */
92 %token T_NUMBER T_SYMBOL T_LITERAL T_DIGITS T_QUOTE T_QUOTE2 T_QUOTE3
93 %token T_EQUAL T_NOTEQ T_LESSEQ T_GREATEREQ
95 %token T_QUIT T_WARRANTY T_PRINT T_IPRINT T_PRINTLATEX T_PRINTCSRC T_TIME
96 %token T_XYZZY T_INVENTORY T_LOOK T_SCORE
98 /* Operator precedence and associativity */
100 %left T_EQUAL T_NOTEQ
101 %left '<' '>' T_LESSEQ T_GREATEREQ
125 } catch (exception &e) {
126 cerr << e.what() << endl;
133 } catch (exception &e) {
134 std::cerr << e.what() << endl;
138 | T_PRINT '(' exp ')' ';' {
140 $3.print(print_tree(std::cout));
141 } catch (exception &e) {
142 std::cerr << e.what() << endl;
146 | T_IPRINT '(' exp ')' ';' {
149 if (!e.info(info_flags::integer))
150 throw (std::invalid_argument("argument to iprint() must be an integer"));
151 long i = ex_to<numeric>(e).to_long();
153 cout << "#o" << oct << i << endl;
154 cout << "#x" << hex << i << dec << endl;
155 } catch (exception &e) {
156 cerr << e.what() << endl;
160 | T_PRINTLATEX '(' exp ')' ';' {
162 $3.print(print_latex(std::cout)); cout << endl;
163 } catch (exception &e) {
164 std::cerr << e.what() << endl;
168 | T_PRINTCSRC '(' exp ')' ';' {
170 $3.print(print_csrc_double(std::cout)); cout << endl;
171 } catch (exception &e) {
172 std::cerr << e.what() << endl;
176 | '?' T_SYMBOL {print_help(ex_to<symbol>($2).get_name());}
177 | '?' T_TIME {print_help("time");}
178 | '?' T_PRINT {print_help("print");}
179 | '?' T_IPRINT {print_help("iprint");}
180 | '?' T_PRINTLATEX {print_help("print_latex");}
181 | '?' T_PRINTCSRC {print_help("print_csrc");}
182 | '?' '?' {print_help_topics();}
185 cout << "This program is free software; you can redistribute it and/or modify it under\n";
186 cout << "the terms of the GNU General Public License as published by the Free Software\n";
187 cout << "Foundation; either version 2 of the License, or (at your option) any later\n";
188 cout << "version.\n";
189 cout << "This program is distributed in the hope that it will be useful, but WITHOUT\n";
190 cout << "ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n";
191 cout << "FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n";
192 cout << "details.\n";
193 cout << "You should have received a copy of the GNU General Public License along with\n";
194 cout << "this program. If not, write to the Free Software Foundation, 675 Mass Ave,\n";
195 cout << "Cambridge, MA 02139, USA.\n";
197 | T_XYZZY {cout << "Nothing happens.\n";}
198 | T_INVENTORY {cout << "You're not carrying anything.\n";}
199 | T_LOOK {cout << "You're in a twisty little maze of passages, all alike.\n";}
201 cout << "If you were to quit now, you would score ";
202 cout << (syms.size() > 350 ? 350 : syms.size());
203 cout << " out of a possible 350.\n";
205 | T_TIME {getrusage(RUSAGE_SELF, &start_time);} '(' exp ')' {
206 getrusage(RUSAGE_SELF, &end_time);
207 cout << (end_time.ru_utime.tv_sec - start_time.ru_utime.tv_sec) +
208 (end_time.ru_stime.tv_sec - start_time.ru_stime.tv_sec) +
209 double(end_time.ru_utime.tv_usec - start_time.ru_utime.tv_usec) / 1e6 +
210 double(end_time.ru_stime.tv_usec - start_time.ru_stime.tv_usec) / 1e6 << 's' << endl;
212 | error ';' {yyclearin; yyerrok;}
213 | error ':' {yyclearin; yyerrok;}
216 exp : T_NUMBER {$$ = $1;}
217 | T_SYMBOL {$$ = $1.eval();}
218 | '\'' T_SYMBOL '\'' {$$ = $2;}
219 | T_LITERAL {$$ = $1;}
220 | T_DIGITS {$$ = $1;}
221 | T_QUOTE {$$ = exstack[0];}
222 | T_QUOTE2 {$$ = exstack[1];}
223 | T_QUOTE3 {$$ = exstack[2];}
224 | T_SYMBOL '(' exprseq ')' {
225 fcn_tab::const_iterator i = find_function($1, $3.nops());
226 if (i->second.is_ginac) {
227 $$ = ((fcnp2)(i->second.p))(ex_to<exprseq>($3), i->second.serial);
229 $$ = (i->second.p)(ex_to<exprseq>($3));
232 | T_DIGITS '=' T_NUMBER {$$ = $3; Digits = ex_to<numeric>($3).to_int();}
233 | T_SYMBOL '=' exp {$$ = $3; const_cast<symbol&>(ex_to<symbol>($1)).assign($3);}
234 | exp T_EQUAL exp {$$ = $1 == $3;}
235 | exp T_NOTEQ exp {$$ = $1 != $3;}
236 | exp '<' exp {$$ = $1 < $3;}
237 | exp T_LESSEQ exp {$$ = $1 <= $3;}
238 | exp '>' exp {$$ = $1 > $3;}
239 | exp T_GREATEREQ exp {$$ = $1 >= $3;}
240 | exp '+' exp {$$ = $1 + $3;}
241 | exp '-' exp {$$ = $1 - $3;}
242 | exp '*' exp {$$ = $1 * $3;}
243 | exp '/' exp {$$ = $1 / $3;}
244 | '-' exp %prec NEG {$$ = -$2;}
245 | '+' exp %prec NEG {$$ = $2;}
246 | exp '^' exp {$$ = power($1, $3);}
247 | exp '!' {$$ = factorial($1);}
248 | '(' exp ')' {$$ = $2;}
249 | '{' list_or_empty '}' {$$ = $2;}
250 | '[' matrix ']' {$$ = lst_to_matrix(ex_to<lst>($2));}
253 exprseq : exp {$$ = exprseq($1);}
254 | exprseq ',' exp {exprseq es(ex_to<exprseq>($1)); $$ = es.append($3);}
257 list_or_empty: /* empty */ {$$ = *new lst;}
261 list : exp {$$ = lst($1);}
262 | list ',' exp {lst l(ex_to<lst>($1)); $$ = l.append($3);}
265 matrix : '[' row ']' {$$ = lst($2);}
266 | matrix ',' '[' row ']' {lst l(ex_to<lst>($1)); $$ = l.append($4);}
269 row : exp {$$ = lst($1);}
270 | row ',' exp {lst l(ex_to<lst>($1)); $$ = l.append($3);}
279 // Error print routine
282 cerr << s << " at " << yytext << endl;
286 // Push expression "e" onto the expression stack (for ", "" and """)
287 static void push(const ex &e)
289 exstack[2] = exstack[1];
290 exstack[1] = exstack[0];
299 static ex f_collect(const exprseq &e) {return e[0].collect(e[1]);}
300 static ex f_collect_distributed(const exprseq &e) {return e[0].collect(e[1], true);}
301 static ex f_collect_common_factors(const exprseq &e) {return collect_common_factors(e[0]);}
302 static ex f_degree(const exprseq &e) {return e[0].degree(e[1]);}
303 static ex f_denom(const exprseq &e) {return e[0].denom();}
304 static ex f_eval1(const exprseq &e) {return e[0].eval();}
305 static ex f_evalf1(const exprseq &e) {return e[0].evalf();}
306 static ex f_evalm(const exprseq &e) {return e[0].evalm();}
307 static ex f_expand(const exprseq &e) {return e[0].expand();}
308 static ex f_gcd(const exprseq &e) {return gcd(e[0], e[1]);}
309 static ex f_has(const exprseq &e) {return e[0].has(e[1]) ? ex(1) : ex(0);}
310 static ex f_lcm(const exprseq &e) {return lcm(e[0], e[1]);}
311 static ex f_lcoeff(const exprseq &e) {return e[0].lcoeff(e[1]);}
312 static ex f_ldegree(const exprseq &e) {return e[0].ldegree(e[1]);}
313 static ex f_lsolve(const exprseq &e) {return lsolve(e[0], e[1]);}
314 static ex f_nops(const exprseq &e) {return e[0].nops();}
315 static ex f_normal1(const exprseq &e) {return e[0].normal();}
316 static ex f_numer(const exprseq &e) {return e[0].numer();}
317 static ex f_numer_denom(const exprseq &e) {return e[0].numer_denom();}
318 static ex f_pow(const exprseq &e) {return pow(e[0], e[1]);}
319 static ex f_sqrt(const exprseq &e) {return sqrt(e[0]);}
320 static ex f_sqrfree1(const exprseq &e) {return sqrfree(e[0]);}
321 static ex f_subs2(const exprseq &e) {return e[0].subs(e[1]);}
322 static ex f_tcoeff(const exprseq &e) {return e[0].tcoeff(e[1]);}
324 #define CHECK_ARG(num, type, fcn) if (!is_a<type>(e[num])) throw(std::invalid_argument("argument " #num " to " #fcn "() must be a " #type))
326 static ex f_charpoly(const exprseq &e)
328 CHECK_ARG(0, matrix, charpoly);
329 CHECK_ARG(1, symbol, charpoly);
330 return ex_to<matrix>(e[0]).charpoly(ex_to<symbol>(e[1]));
333 static ex f_coeff(const exprseq &e)
335 CHECK_ARG(2, numeric, coeff);
336 return e[0].coeff(e[1], ex_to<numeric>(e[2]).to_int());
339 static ex f_content(const exprseq &e)
341 CHECK_ARG(1, symbol, content);
342 return e[0].content(ex_to<symbol>(e[1]));
345 static ex f_decomp_rational(const exprseq &e)
347 CHECK_ARG(1, symbol, decomp_rational);
348 return decomp_rational(e[0], ex_to<symbol>(e[1]));
351 static ex f_determinant(const exprseq &e)
353 CHECK_ARG(0, matrix, determinant);
354 return ex_to<matrix>(e[0]).determinant();
357 static ex f_diag(const exprseq &e)
359 size_t dim = e.nops();
360 matrix &m = *new matrix(dim, dim);
361 for (size_t i=0; i<dim; i++)
362 m.set(i, i, e.op(i));
366 static ex f_diff2(const exprseq &e)
368 CHECK_ARG(1, symbol, diff);
369 return e[0].diff(ex_to<symbol>(e[1]));
372 static ex f_diff3(const exprseq &e)
374 CHECK_ARG(1, symbol, diff);
375 CHECK_ARG(2, numeric, diff);
376 return e[0].diff(ex_to<symbol>(e[1]), ex_to<numeric>(e[2]).to_int());
379 static ex f_divide(const exprseq &e)
382 if (divide(e[0], e[1], q))
388 static ex f_eval2(const exprseq &e)
390 CHECK_ARG(1, numeric, eval);
391 return e[0].eval(ex_to<numeric>(e[1]).to_int());
394 static ex f_evalf2(const exprseq &e)
396 CHECK_ARG(1, numeric, evalf);
397 return e[0].evalf(ex_to<numeric>(e[1]).to_int());
400 static ex f_find(const exprseq &e)
403 e[0].find(e[1], found);
407 static ex f_inverse(const exprseq &e)
409 CHECK_ARG(0, matrix, inverse);
410 return ex_to<matrix>(e[0]).inverse();
413 static ex f_is(const exprseq &e)
415 CHECK_ARG(0, relational, is);
416 return (bool)ex_to<relational>(e[0]) ? ex(1) : ex(0);
419 class apply_map_function : public map_function {
422 apply_map_function(const ex & a) : apply(a) {}
423 virtual ~apply_map_function() {}
424 ex operator()(const ex & e) { return apply.subs(wild() == e, true); }
427 static ex f_map(const exprseq &e)
429 apply_map_function fcn(e[1]);
430 return e[0].map(fcn);
433 static ex f_match(const exprseq &e)
436 if (e[0].match(e[1], repl_lst))
442 static ex f_normal2(const exprseq &e)
444 CHECK_ARG(1, numeric, normal);
445 return e[0].normal(ex_to<numeric>(e[1]).to_int());
448 static ex f_op(const exprseq &e)
450 CHECK_ARG(1, numeric, op);
451 int n = ex_to<numeric>(e[1]).to_int();
452 if (n < 0 || n >= (int)e[0].nops())
453 throw(std::out_of_range("second argument to op() is out of range"));
457 static ex f_prem(const exprseq &e)
459 CHECK_ARG(2, symbol, prem);
460 return prem(e[0], e[1], ex_to<symbol>(e[2]));
463 static ex f_primpart(const exprseq &e)
465 CHECK_ARG(1, symbol, primpart);
466 return e[0].primpart(ex_to<symbol>(e[1]));
469 static ex f_quo(const exprseq &e)
471 CHECK_ARG(2, symbol, quo);
472 return quo(e[0], e[1], ex_to<symbol>(e[2]));
475 static ex f_rem(const exprseq &e)
477 CHECK_ARG(2, symbol, rem);
478 return rem(e[0], e[1], ex_to<symbol>(e[2]));
481 static ex f_series(const exprseq &e)
483 CHECK_ARG(2, numeric, series);
484 return e[0].series(e[1], ex_to<numeric>(e[2]).to_int());
487 static ex f_sprem(const exprseq &e)
489 CHECK_ARG(2, symbol, sprem);
490 return sprem(e[0], e[1], ex_to<symbol>(e[2]));
493 static ex f_sqrfree2(const exprseq &e)
495 CHECK_ARG(1, lst, sqrfree);
496 return sqrfree(e[0], ex_to<lst>(e[1]));
499 static ex f_subs3(const exprseq &e)
501 CHECK_ARG(1, lst, subs);
502 CHECK_ARG(2, lst, subs);
503 return e[0].subs(ex_to<lst>(e[1]), ex_to<lst>(e[2]));
506 static ex f_trace(const exprseq &e)
508 CHECK_ARG(0, matrix, trace);
509 return ex_to<matrix>(e[0]).trace();
512 static ex f_transpose(const exprseq &e)
514 CHECK_ARG(0, matrix, transpose);
515 return ex_to<matrix>(e[0]).transpose();
518 static ex f_unassign(const exprseq &e)
520 CHECK_ARG(0, symbol, unassign);
521 const_cast<symbol&>(ex_to<symbol>(e[0])).unassign();
525 static ex f_unit(const exprseq &e)
527 CHECK_ARG(1, symbol, unit);
528 return e[0].unit(ex_to<symbol>(e[1]));
531 static ex f_dummy(const exprseq &e)
533 throw(std::logic_error("dummy function called (shouldn't happen)"));
536 // Tables for initializing the "fcns" map and the function help topics
543 static const fcn_init builtin_fcns[] = {
544 {"charpoly", f_charpoly, 2},
545 {"coeff", f_coeff, 3},
546 {"collect", f_collect, 2},
547 {"collect_common_factors", f_collect_common_factors, 1},
548 {"collect_distributed", f_collect_distributed, 2},
549 {"content", f_content, 2},
550 {"decomp_rational", f_decomp_rational, 2},
551 {"degree", f_degree, 2},
552 {"denom", f_denom, 1},
553 {"determinant", f_determinant, 1},
555 {"diff", f_diff2, 2},
556 {"diff", f_diff3, 3},
557 {"divide", f_divide, 2},
558 {"eval", f_eval1, 1},
559 {"eval", f_eval2, 2},
560 {"evalf", f_evalf1, 1},
561 {"evalf", f_evalf2, 2},
562 {"evalm", f_evalm, 1},
563 {"expand", f_expand, 1},
567 {"inverse", f_inverse, 1},
568 {"iprint", f_dummy, 0}, // for Tab-completion
571 {"lcoeff", f_lcoeff, 2},
572 {"ldegree", f_ldegree, 2},
573 {"lsolve", f_lsolve, 2},
575 {"match", f_match, 2},
577 {"normal", f_normal1, 1},
578 {"normal", f_normal2, 2},
579 {"numer", f_numer, 1},
580 {"numer_denom", f_numer_denom, 1},
584 {"primpart", f_primpart, 2},
585 {"print", f_dummy, 0}, // for Tab-completion
586 {"print_csrc", f_dummy, 0}, // for Tab-completion
587 {"print_latex", f_dummy, 0}, // for Tab-completion
590 {"series", f_series, 3},
591 {"sprem", f_sprem, 3},
592 {"sqrfree", f_sqrfree1, 1},
593 {"sqrfree", f_sqrfree2, 2},
595 {"subs", f_subs2, 2},
596 {"subs", f_subs3, 3},
597 {"tcoeff", f_tcoeff, 2},
598 {"time", f_dummy, 0}, // for Tab-completion
599 {"trace", f_trace, 1},
600 {"transpose", f_transpose, 1},
601 {"unassign", f_unassign, 1},
603 {NULL, f_dummy, 0} // End marker
606 struct fcn_help_init {
611 static const fcn_help_init builtin_help[] = {
612 {"acos", "inverse cosine function"},
613 {"acosh", "inverse hyperbolic cosine function"},
614 {"asin", "inverse sine function"},
615 {"asinh", "inverse hyperbolic sine function"},
616 {"atan", "inverse tangent function"},
617 {"atan2", "inverse tangent function with two arguments"},
618 {"atanh", "inverse hyperbolic tangent function"},
619 {"beta", "Beta function"},
620 {"binomial", "binomial function"},
621 {"cos", "cosine function"},
622 {"cosh", "hyperbolic cosine function"},
623 {"exp", "exponential function"},
624 {"factorial", "factorial function"},
625 {"lgamma", "natural logarithm of Gamma function"},
626 {"tgamma", "Gamma function"},
627 {"log", "natural logarithm"},
628 {"psi", "psi function\npsi(x) is the digamma function, psi(n,x) the nth polygamma function"},
629 {"sin", "sine function"},
630 {"sinh", "hyperbolic sine function"},
631 {"tan", "tangent function"},
632 {"tanh", "hyperbolic tangent function"},
633 {"zeta", "zeta function\nzeta(x) is Riemann's zeta function, zeta(n,x) its nth derivative"},
634 {"Li2", "dilogarithm"},
635 {"Li3", "trilogarithm"},
636 {"Order", "order term function (for truncated power series)"},
637 {"Derivative", "inert differential operator"},
638 {NULL, NULL} // End marker
641 #include "ginsh_extensions.h"
645 * Add functions to ginsh
648 // Functions from fcn_init array
649 static void insert_fcns(const fcn_init *p)
652 fcns.insert(make_pair(string(p->name), fcn_desc(p->p, p->num_params)));
657 static ex f_ginac_function(const exprseq &es, int serial)
659 return function(serial, es).eval(1);
662 // All registered GiNaC functions
663 void GiNaC::ginsh_get_ginac_functions(void)
665 vector<function_options>::const_iterator i = function::registered_functions().begin(), end = function::registered_functions().end();
668 fcns.insert(make_pair(i->get_name(), fcn_desc(f_ginac_function, i->get_nparams(), serial)));
676 * Find a function given a name and number of parameters. Throw exceptions on error.
679 static fcn_tab::const_iterator find_function(const ex &sym, int req_params)
681 const string &name = ex_to<symbol>(sym).get_name();
682 typedef fcn_tab::const_iterator I;
683 pair<I, I> b = fcns.equal_range(name);
684 if (b.first == b.second)
685 throw(std::logic_error("unknown function '" + name + "'"));
687 for (I i=b.first; i!=b.second; i++)
688 if ((i->second.num_params == 0) || (i->second.num_params == req_params))
691 throw(std::logic_error("invalid number of arguments to " + name + "()"));
696 * Insert help strings
699 // Normal help string
700 static void insert_help(const char *topic, const char *str)
702 help.insert(make_pair(string(topic), string(str)));
705 // Help string for functions, automatically generates synopsis
706 static void insert_fcn_help(const char *name, const char *str)
708 typedef fcn_tab::const_iterator I;
709 pair<I, I> b = fcns.equal_range(name);
710 if (b.first != b.second) {
711 string help_str = string(name) + "(";
712 for (int i=0; i<b.first->second.num_params; i++) {
715 help_str += "expression";
719 help.insert(make_pair(string(name), help_str));
723 // Help strings for functions from fcn_help_init array
724 static void insert_help(const fcn_help_init *p)
727 insert_fcn_help(p->name, p->help);
737 // Help for a given topic
738 static void print_help(const string &topic)
740 typedef help_tab::const_iterator I;
741 pair<I, I> b = help.equal_range(topic);
742 if (b.first == b.second)
743 cout << "no help for '" << topic << "'\n";
745 for (I i=b.first; i!=b.second; i++)
746 cout << i->second << endl;
750 // List of help topics
751 static void print_help_topics(void)
753 cout << "Available help topics:\n";
754 help_tab::const_iterator i;
755 string last_name = string("*");
757 for (i=help.begin(); i!=help.end(); i++) {
758 // Don't print duplicates
759 if (i->first != last_name) {
764 last_name = i->first;
767 cout << "\nTo get help for a certain topic, type ?topic\n";
772 * Function name completion functions for readline
775 static char *fcn_generator(const char *text, int state)
777 static int len; // Length of word to complete
778 static fcn_tab::const_iterator index; // Iterator to function being currently considered
780 // If this is a new word to complete, initialize now
782 index = fcns.begin();
786 // Return the next function which partially matches
787 while (index != fcns.end()) {
788 const char *fcn_name = index->first.c_str();
790 if (strncmp(fcn_name, text, len) == 0)
791 return strdup(fcn_name);
796 static char **fcn_completion(const char *text, int start, int end)
798 if (rl_line_buffer[0] == '!') {
799 // For shell commands, revert back to filename completion
800 rl_completion_append_character = orig_completion_append_character;
801 rl_basic_word_break_characters = orig_basic_word_break_characters;
802 rl_completer_word_break_characters = rl_basic_word_break_characters;
803 #if (GINAC_RL_VERSION_MAJOR < 4) || (GINAC_RL_VERSION_MAJOR == 4 && GINAC_RL_VERSION_MINOR < 2)
804 return completion_matches(const_cast<char *>(text), (CPFunction *)filename_completion_function);
806 return rl_completion_matches(text, rl_filename_completion_function);
809 // Otherwise, complete function names
810 rl_completion_append_character = '(';
811 rl_basic_word_break_characters = " \t\n\"#$%&'()*+,-./:;<=>?@[\\]^`{|}~";
812 rl_completer_word_break_characters = rl_basic_word_break_characters;
813 #if (GINAC_RL_VERSION_MAJOR < 4) || (GINAC_RL_VERSION_MAJOR == 4 && GINAC_RL_VERSION_MINOR < 2)
814 return completion_matches(const_cast<char *>(text), (CPFunction *)fcn_generator);
816 return rl_completion_matches(text, fcn_generator);
823 cout << "ginsh - GiNaC Interactive Shell (" << PACKAGE << " V" << VERSION << ")" << endl;
824 cout << " __, _______ Copyright (C) 1999-2003 Johannes Gutenberg University Mainz,\n"
825 << " (__) * | Germany. This is free software with ABSOLUTELY NO WARRANTY.\n"
826 << " ._) i N a C | You are welcome to redistribute it under certain conditions.\n"
827 << "<-------------' For details type `warranty;'.\n" << endl;
828 cout << "Type ?? for a list of help topics." << endl;
835 int main(int argc, char **argv)
837 // Print banner in interactive mode
841 // Init function table
842 insert_fcns(builtin_fcns);
843 insert_fcns(extended_fcns);
844 ginsh_get_ginac_functions();
846 // Init help for operators (automatically generated from man page)
847 insert_help("operators", "Operators in falling order of precedence:");
848 #include "ginsh_op_help.h"
850 // Init help for built-in functions (automatically generated from man page)
851 #include "ginsh_fcn_help.h"
853 // Help for GiNaC functions is added manually
854 insert_help(builtin_help);
855 insert_help(extended_help);
857 // Help for other keywords
858 insert_help("print", "print(expression) - dumps the internal structure of the given expression (for debugging)");
859 insert_help("iprint", "iprint(expression) - prints the given integer expression in decimal, octal, and hexadecimal bases");
860 insert_help("print_latex", "print_latex(expression) - prints a LaTeX representation of the given expression");
861 insert_help("print_csrc", "print_csrc(expression) - prints a C source code representation of the given expression");
863 // Init readline completer
864 rl_readline_name = argv[0];
865 #if (GINAC_RL_VERSION_MAJOR < 4) || (GINAC_RL_VERSION_MAJOR == 4 && GINAC_RL_VERSION_MINOR < 2)
866 rl_attempted_completion_function = (CPPFunction *)fcn_completion;
868 rl_attempted_completion_function = fcn_completion;
870 orig_completion_append_character = rl_completion_append_character;
871 orig_basic_word_break_characters = rl_basic_word_break_characters;
873 // Init input file list, open first file
874 num_files = argc - 1;
875 file_list = argv + 1;
877 yyin = fopen(*file_list, "r");
879 cerr << "Can't open " << *file_list << endl;
886 // Parse input, catch all remaining exceptions
890 } catch (exception &e) {
891 cerr << e.what() << endl;