1 /** @file ginsh_parser.yy
3 * Input grammar definition for ginsh.
4 * This file must be processed with yacc/bison.
6 * GiNaC Copyright (C) 1999-2000 Johannes Gutenberg University Mainz, Germany
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
31 #include <sys/resource.h>
34 #include <sys/types.h>
42 // Original readline settings
43 static int orig_completion_append_character;
44 static char *orig_basic_word_break_characters;
46 // Expression stack for ", "" and """
47 static void push(const ex &e);
50 // Start and end time for the time() function
51 static struct rusage start_time, end_time;
53 // Table of functions (a multimap, because one function may appear with different
54 // numbers of parameters)
55 typedef ex (*fcnp)(const exprseq &e);
56 typedef ex (*fcnp2)(const exprseq &e, int serial);
59 fcn_desc() : p(NULL), num_params(0) {}
60 fcn_desc(fcnp func, int num) : p(func), num_params(num), is_ginac(false) {}
61 fcn_desc(fcnp2 func, int num, int ser) : p((fcnp)func), num_params(num), is_ginac(true), serial(ser) {}
63 fcnp p; // Pointer to function
64 int num_params; // Number of parameters (0 = arbitrary)
65 bool is_ginac; // Flag: function is GiNaC function
66 int serial; // GiNaC function serial number (if is_ginac == true)
69 typedef multimap<string, fcn_desc> fcn_tab;
72 static fcn_tab::const_iterator find_function(const ex &sym, int req_params);
74 // Table to map help topics to help strings
75 typedef multimap<string, string> help_tab;
78 static void print_help(const string &topic);
79 static void print_help_topics(void);
81 static ex lst2matrix(const ex &l);
84 /* Tokens (T_LITERAL means a literal value returned by the parser, but not
85 of class numeric or symbol (e.g. a constant or the FAIL object)) */
86 %token T_NUMBER T_SYMBOL T_LITERAL T_DIGITS T_QUOTE T_QUOTE2 T_QUOTE3
87 %token T_EQUAL T_NOTEQ T_LESSEQ T_GREATEREQ T_MATRIX_BEGIN T_MATRIX_END
89 %token T_QUIT T_WARRANTY T_PRINT T_READ T_WRITE T_TIME T_XYZZY T_INVENTORY T_LOOK T_SCORE
91 /* Operator precedence and associativity */
94 %left '<' '>' T_LESSEQ T_GREATEREQ
118 } catch (exception &e) {
119 cerr << e.what() << endl;
126 } catch (exception &e) {
127 cerr << e.what() << endl;
131 | T_PRINT '(' exp ')' ';' {
134 } catch (exception &e) {
135 cerr << e.what() << endl;
139 | '?' T_SYMBOL {print_help(ex_to_symbol($2).getname());}
140 | '?' '?' {print_help_topics();}
143 cout << "This program is free software; you can redistribute it and/or modify it under\n";
144 cout << "the terms of the GNU General Public License as published by the Free Software\n";
145 cout << "Foundation; either version 2 of the License, or (at your option) any later\n";
146 cout << "version.\n";
147 cout << "This program is distributed in the hope that it will be useful, but WITHOUT\n";
148 cout << "ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n";
149 cout << "FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n";
150 cout << "details.\n";
151 cout << "You should have received a copy of the GNU General Public License along with\n";
152 cout << "this program. If not, write to the Free Software Foundation, 675 Mass Ave,\n";
153 cout << "Cambridge, MA 02139, USA.\n";
155 | T_XYZZY {cout << "Nothing happens.\n";}
156 | T_INVENTORY {cout << "You're not carrying anything.\n";}
157 | T_LOOK {cout << "You're in a twisty little maze of passages, all alike.\n";}
159 cout << "If you were to quit now, you would score ";
160 cout << (syms.size() > 350 ? 350 : syms.size());
161 cout << " out of a possible 350.\n";
163 | error ';' {yyclearin; yyerrok;}
164 | error ':' {yyclearin; yyerrok;}
167 exp : T_NUMBER {$$ = $1;}
168 | T_SYMBOL {$$ = $1.eval();}
169 | '\'' T_SYMBOL '\'' {$$ = $2;}
170 | T_LITERAL {$$ = $1;}
171 | T_DIGITS {$$ = $1;}
172 | T_QUOTE {$$ = exstack[0];}
173 | T_QUOTE2 {$$ = exstack[1];}
174 | T_QUOTE3 {$$ = exstack[2];}
175 | T_TIME {getrusage(RUSAGE_SELF, &start_time);} '(' exp ')' {
176 getrusage(RUSAGE_SELF, &end_time);
177 $$ = (end_time.ru_utime.tv_sec - start_time.ru_utime.tv_sec) +
178 (end_time.ru_stime.tv_sec - start_time.ru_stime.tv_sec) +
179 double(end_time.ru_utime.tv_usec - start_time.ru_utime.tv_usec) / 1e6 +
180 double(end_time.ru_stime.tv_usec - start_time.ru_stime.tv_usec) / 1e6;
182 | T_SYMBOL '(' exprseq ')' {
183 fcn_tab::const_iterator i = find_function($1, $3.nops());
184 if (i->second.is_ginac) {
185 $$ = ((fcnp2)(i->second.p))(static_cast<const exprseq &>(*($3.bp)), i->second.serial);
187 $$ = (i->second.p)(static_cast<const exprseq &>(*($3.bp)));
190 | T_DIGITS '=' T_NUMBER {$$ = $3; Digits = ex_to_numeric($3).to_int();}
191 | T_SYMBOL '=' exp {$$ = $3; const_cast<symbol *>(&ex_to_symbol($1))->assign($3);}
192 | exp T_EQUAL exp {$$ = $1 == $3;}
193 | exp T_NOTEQ exp {$$ = $1 != $3;}
194 | exp '<' exp {$$ = $1 < $3;}
195 | exp T_LESSEQ exp {$$ = $1 <= $3;}
196 | exp '>' exp {$$ = $1 > $3;}
197 | exp T_GREATEREQ exp {$$ = $1 >= $3;}
198 | exp '+' exp {$$ = $1 + $3;}
199 | exp '-' exp {$$ = $1 - $3;}
200 | exp '*' exp {$$ = $1 * $3;}
201 | exp '/' exp {$$ = $1 / $3;}
202 | exp '%' exp {$$ = $1 % $3;}
203 | '-' exp %prec NEG {$$ = -$2;}
204 | '+' exp %prec NEG {$$ = $2;}
205 | exp '^' exp {$$ = power($1, $3);}
206 | exp '!' {$$ = factorial($1);}
207 | '(' exp ')' {$$ = $2;}
208 | '[' list_or_empty ']' {$$ = $2;}
209 | T_MATRIX_BEGIN matrix T_MATRIX_END {$$ = lst2matrix($2);}
212 exprseq : exp {$$ = exprseq($1);}
213 | exprseq ',' exp {exprseq es(static_cast<exprseq &>(*($1.bp))); $$ = es.append($3);}
216 list_or_empty: /* empty */ {$$ = *new lst;}
220 list : exp {$$ = lst($1);}
221 | list ',' exp {lst l(static_cast<lst &>(*($1.bp))); $$ = l.append($3);}
224 matrix : T_MATRIX_BEGIN row T_MATRIX_END {$$ = lst($2);}
225 | matrix ',' T_MATRIX_BEGIN row T_MATRIX_END {lst l(static_cast<lst &>(*($1.bp))); $$ = l.append($4);}
228 row : exp {$$ = lst($1);}
229 | row ',' exp {lst l(static_cast<lst &>(*($1.bp))); $$ = l.append($3);}
238 // Error print routine
241 cerr << s << " at " << yytext << endl;
245 // Push expression "e" onto the expression stack (for ", "" and """)
246 static void push(const ex &e)
248 exstack[2] = exstack[1];
249 exstack[1] = exstack[0];
258 static ex f_denom(const exprseq &e) {return e[0].denom();}
259 static ex f_eval1(const exprseq &e) {return e[0].eval();}
260 static ex f_evalf1(const exprseq &e) {return e[0].evalf();}
261 static ex f_expand(const exprseq &e) {return e[0].expand();}
262 static ex f_gcd(const exprseq &e) {return gcd(e[0], e[1]);}
263 static ex f_lcm(const exprseq &e) {return lcm(e[0], e[1]);}
264 static ex f_lsolve(const exprseq &e) {return lsolve(e[0], e[1]);}
265 static ex f_nops(const exprseq &e) {return e[0].nops();}
266 static ex f_normal1(const exprseq &e) {return e[0].normal();}
267 static ex f_numer(const exprseq &e) {return e[0].numer();}
268 static ex f_pow(const exprseq &e) {return pow(e[0], e[1]);}
269 static ex f_sqrt(const exprseq &e) {return sqrt(e[0]);}
270 static ex f_subs2(const exprseq &e) {return e[0].subs(e[1]);}
272 #define CHECK_ARG(num, type, fcn) if (!is_ex_of_type(e[num], type)) throw(std::invalid_argument("argument " #num " to " #fcn " must be a " #type))
274 static ex f_charpoly(const exprseq &e)
276 CHECK_ARG(0, matrix, charpoly);
277 CHECK_ARG(1, symbol, charpoly);
278 return ex_to_matrix(e[0]).charpoly(ex_to_symbol(e[1]));
281 static ex f_coeff(const exprseq &e)
283 CHECK_ARG(1, symbol, coeff);
284 CHECK_ARG(2, numeric, coeff);
285 return e[0].coeff(ex_to_symbol(e[1]), ex_to_numeric(e[2]).to_int());
288 static ex f_collect(const exprseq &e)
290 CHECK_ARG(1, symbol, collect);
291 return e[0].collect(ex_to_symbol(e[1]));
294 static ex f_content(const exprseq &e)
296 CHECK_ARG(1, symbol, content);
297 return e[0].content(ex_to_symbol(e[1]));
300 static ex f_degree(const exprseq &e)
302 CHECK_ARG(1, symbol, degree);
303 return e[0].degree(ex_to_symbol(e[1]));
306 static ex f_determinant(const exprseq &e)
308 CHECK_ARG(0, matrix, determinant);
309 return ex_to_matrix(e[0]).determinant();
312 static ex f_diag(const exprseq &e)
314 unsigned dim = e.nops();
315 matrix &m = *new matrix(dim, dim);
316 for (unsigned i=0; i<dim; i++)
317 m.set(i, i, e.op(i));
321 static ex f_diff2(const exprseq &e)
323 CHECK_ARG(1, symbol, diff);
324 return e[0].diff(ex_to_symbol(e[1]));
327 static ex f_diff3(const exprseq &e)
329 CHECK_ARG(1, symbol, diff);
330 CHECK_ARG(2, numeric, diff);
331 return e[0].diff(ex_to_symbol(e[1]), ex_to_numeric(e[2]).to_int());
334 static ex f_divide(const exprseq &e)
337 if (divide(e[0], e[1], q))
343 static ex f_eval2(const exprseq &e)
345 CHECK_ARG(1, numeric, eval);
346 return e[0].eval(ex_to_numeric(e[1]).to_int());
349 static ex f_evalf2(const exprseq &e)
351 CHECK_ARG(1, numeric, evalf);
352 return e[0].evalf(ex_to_numeric(e[1]).to_int());
355 static ex f_has(const exprseq &e)
357 return e[0].has(e[1]) ? ex(1) : ex(0);
360 static ex f_inverse(const exprseq &e)
362 CHECK_ARG(0, matrix, inverse);
363 return ex_to_matrix(e[0]).inverse();
366 static ex f_is(const exprseq &e)
368 CHECK_ARG(0, relational, is);
369 return (bool)ex_to_relational(e[0]) ? ex(1) : ex(0);
372 static ex f_lcoeff(const exprseq &e)
374 CHECK_ARG(1, symbol, lcoeff);
375 return e[0].lcoeff(ex_to_symbol(e[1]));
378 static ex f_ldegree(const exprseq &e)
380 CHECK_ARG(1, symbol, ldegree);
381 return e[0].ldegree(ex_to_symbol(e[1]));
384 static ex f_normal2(const exprseq &e)
386 CHECK_ARG(1, numeric, normal);
387 return e[0].normal(ex_to_numeric(e[1]).to_int());
390 static ex f_op(const exprseq &e)
392 CHECK_ARG(1, numeric, op);
393 int n = ex_to_numeric(e[1]).to_int();
394 if (n < 0 || n >= (int)e[0].nops())
395 throw(std::out_of_range("second argument to op() is out of range"));
399 static ex f_prem(const exprseq &e)
401 CHECK_ARG(2, symbol, prem);
402 return prem(e[0], e[1], ex_to_symbol(e[2]));
405 static ex f_primpart(const exprseq &e)
407 CHECK_ARG(1, symbol, primpart);
408 return e[0].primpart(ex_to_symbol(e[1]));
411 static ex f_quo(const exprseq &e)
413 CHECK_ARG(2, symbol, quo);
414 return quo(e[0], e[1], ex_to_symbol(e[2]));
417 static ex f_rem(const exprseq &e)
419 CHECK_ARG(2, symbol, rem);
420 return rem(e[0], e[1], ex_to_symbol(e[2]));
423 static ex f_series2(const exprseq &e)
425 CHECK_ARG(1, symbol, series);
426 return e[0].series(ex_to_symbol(e[1]), ex(0));
429 static ex f_series3(const exprseq &e)
431 CHECK_ARG(1, symbol, series);
432 return e[0].series(ex_to_symbol(e[1]), e[2]);
435 static ex f_series4(const exprseq &e)
437 CHECK_ARG(1, symbol, series);
438 CHECK_ARG(3, numeric, series);
439 return e[0].series(ex_to_symbol(e[1]), e[2], ex_to_numeric(e[3]).to_int());
442 static ex f_sqrfree(const exprseq &e)
444 CHECK_ARG(1, symbol, sqrfree);
445 return sqrfree(e[0], ex_to_symbol(e[1]));
448 static ex f_subs3(const exprseq &e)
450 CHECK_ARG(1, lst, subs);
451 CHECK_ARG(2, lst, subs);
452 return e[0].subs(ex_to_lst(e[1]), ex_to_lst(e[2]));
455 static ex f_tcoeff(const exprseq &e)
457 CHECK_ARG(1, symbol, tcoeff);
458 return e[0].tcoeff(ex_to_symbol(e[1]));
461 static ex f_trace(const exprseq &e)
463 CHECK_ARG(0, matrix, trace);
464 return ex_to_matrix(e[0]).trace();
467 static ex f_transpose(const exprseq &e)
469 CHECK_ARG(0, matrix, transpose);
470 return ex_to_matrix(e[0]).transpose();
473 static ex f_unassign(const exprseq &e)
475 CHECK_ARG(0, symbol, unassign);
476 (const_cast<symbol *>(&ex_to_symbol(e[0])))->unassign();
480 static ex f_unit(const exprseq &e)
482 CHECK_ARG(1, symbol, unit);
483 return e[0].unit(ex_to_symbol(e[1]));
486 static ex f_dummy(const exprseq &e)
488 throw(std::logic_error("dummy function called (shouldn't happen)"));
491 // Table for initializing the "fcns" map
497 static const fcn_init builtin_fcns[] = {
498 {"charpoly", fcn_desc(f_charpoly, 2)},
499 {"coeff", fcn_desc(f_coeff, 3)},
500 {"collect", fcn_desc(f_collect, 2)},
501 {"content", fcn_desc(f_content, 2)},
502 {"degree", fcn_desc(f_degree, 2)},
503 {"denom", fcn_desc(f_denom, 1)},
504 {"determinant", fcn_desc(f_determinant, 1)},
505 {"diag", fcn_desc(f_diag, 0)},
506 {"diff", fcn_desc(f_diff2, 2)},
507 {"diff", fcn_desc(f_diff3, 3)},
508 {"divide", fcn_desc(f_divide, 2)},
509 {"eval", fcn_desc(f_eval1, 1)},
510 {"eval", fcn_desc(f_eval2, 2)},
511 {"evalf", fcn_desc(f_evalf1, 1)},
512 {"evalf", fcn_desc(f_evalf2, 2)},
513 {"expand", fcn_desc(f_expand, 1)},
514 {"gcd", fcn_desc(f_gcd, 2)},
515 {"has", fcn_desc(f_has, 2)},
516 {"inverse", fcn_desc(f_inverse, 1)},
517 {"is", fcn_desc(f_is, 1)},
518 {"lcm", fcn_desc(f_lcm, 2)},
519 {"lcoeff", fcn_desc(f_lcoeff, 2)},
520 {"ldegree", fcn_desc(f_ldegree, 2)},
521 {"lsolve", fcn_desc(f_lsolve, 2)},
522 {"nops", fcn_desc(f_nops, 1)},
523 {"normal", fcn_desc(f_normal1, 1)},
524 {"normal", fcn_desc(f_normal2, 2)},
525 {"numer", fcn_desc(f_numer, 1)},
526 {"op", fcn_desc(f_op, 2)},
527 {"pow", fcn_desc(f_pow, 2)},
528 {"prem", fcn_desc(f_prem, 3)},
529 {"primpart", fcn_desc(f_primpart, 2)},
530 {"quo", fcn_desc(f_quo, 3)},
531 {"rem", fcn_desc(f_rem, 3)},
532 {"series", fcn_desc(f_series2, 2)},
533 {"series", fcn_desc(f_series3, 3)},
534 {"series", fcn_desc(f_series4, 4)},
535 {"sqrfree", fcn_desc(f_sqrfree, 2)},
536 {"sqrt", fcn_desc(f_sqrt, 1)},
537 {"subs", fcn_desc(f_subs2, 2)},
538 {"subs", fcn_desc(f_subs3, 3)},
539 {"tcoeff", fcn_desc(f_tcoeff, 2)},
540 {"time", fcn_desc(f_dummy, 0)},
541 {"trace", fcn_desc(f_trace, 1)},
542 {"transpose", fcn_desc(f_transpose, 1)},
543 {"unassign", fcn_desc(f_unassign, 1)},
544 {"unit", fcn_desc(f_unit, 2)},
545 {NULL, fcn_desc(f_dummy, 0)} // End marker
550 * Add functions to ginsh
553 // Functions from fcn_init array
554 static void insert_fcns(const fcn_init *p)
557 fcns.insert(make_pair(string(p->name), p->desc));
562 static ex f_ginac_function(const exprseq &es, int serial)
564 return function(serial, es).eval(1);
567 // All registered GiNaC functions
568 #ifndef NO_NAMESPACE_GINAC
569 void GiNaC::ginsh_get_ginac_functions(void)
570 #else // ndef NO_NAMESPACE_GINAC
571 void ginsh_get_ginac_functions(void)
572 #endif // ndef NO_NAMESPACE_GINAC
574 vector<function_options>::const_iterator i = function::registered_functions().begin(), end = function::registered_functions().end();
577 fcns.insert(make_pair(i->get_name(), fcn_desc(f_ginac_function, i->get_nparams(), serial)));
585 * Find a function given a name and number of parameters. Throw exceptions on error.
588 static fcn_tab::const_iterator find_function(const ex &sym, int req_params)
590 const string &name = ex_to_symbol(sym).getname();
591 typedef fcn_tab::const_iterator I;
592 pair<I, I> b = fcns.equal_range(name);
593 if (b.first == b.second)
594 throw(std::logic_error("unknown function '" + name + "'"));
596 for (I i=b.first; i!=b.second; i++)
597 if ((i->second.num_params == 0) || (i->second.num_params == req_params))
600 throw(std::logic_error("invalid number of arguments to " + name + "()"));
605 * Insert help strings
608 // Normal help string
609 static void insert_help(const char *topic, const char *str)
611 help.insert(make_pair(string(topic), string(str)));
614 // Help string for functions, automatically generates synopsis
615 static void insert_fcn_help(const char *name, const char *str)
617 typedef fcn_tab::const_iterator I;
618 pair<I, I> b = fcns.equal_range(name);
619 if (b.first != b.second) {
620 string help_str = string(name) + "(";
621 for (int i=0; i<b.first->second.num_params; i++) {
624 help_str += "expression";
628 help.insert(make_pair(string(name), help_str));
637 // Help for a given topic
638 static void print_help(const string &topic)
640 typedef help_tab::const_iterator I;
641 pair<I, I> b = help.equal_range(topic);
642 if (b.first == b.second)
643 cout << "no help for '" << topic << "'\n";
645 for (I i=b.first; i!=b.second; i++)
646 cout << i->second << endl;
650 // List of help topics
651 static void print_help_topics(void)
653 cout << "Available help topics:\n";
654 help_tab::const_iterator i;
655 string last_name = string("*");
657 for (i=help.begin(); i!=help.end(); i++) {
658 // Don't print duplicates
659 if (i->first != last_name) {
664 last_name = i->first;
667 cout << "\nTo get help for a certain topic, type ?topic\n";
672 * Convert list of lists to matrix
675 static ex lst2matrix(const ex &l)
677 if (!is_ex_of_type(l, lst))
678 throw(std::logic_error("internal error: argument to lst2matrix() is not a list"));
680 // Find number of rows and columns
681 unsigned rows = l.nops(), cols = 0, i, j;
682 for (i=0; i<rows; i++)
683 if (l.op(i).nops() > cols)
684 cols = l.op(i).nops();
686 // Allocate and fill matrix
687 matrix &m = *new matrix(rows, cols);
688 for (i=0; i<rows; i++)
689 for (j=0; j<cols; j++)
690 if (l.op(i).nops() > j)
691 m.set(i, j, l.op(i).op(j));
699 * Function name completion functions for readline
702 static char *fcn_generator(char *text, int state)
704 static int len; // Length of word to complete
705 static fcn_tab::const_iterator index; // Iterator to function being currently considered
707 // If this is a new word to complete, initialize now
709 index = fcns.begin();
713 // Return the next function which partially matches
714 while (index != fcns.end()) {
715 const char *fcn_name = index->first.c_str();
717 if (strncmp(fcn_name, text, len) == 0)
718 return strdup(fcn_name);
723 static char **fcn_completion(char *text, int start, int end)
725 if (rl_line_buffer[0] == '!') {
726 // For shell commands, revert back to filename completion
727 rl_completion_append_character = orig_completion_append_character;
728 rl_basic_word_break_characters = orig_basic_word_break_characters;
729 return completion_matches(text, (CPFunction *)filename_completion_function);
731 // Otherwise, complete function names
732 rl_completion_append_character = '(';
733 rl_basic_word_break_characters = " \t\n\"#$%&'()*+,-./:;<=>?@[\\]^`{|}~";
734 return completion_matches(text, (CPFunction *)fcn_generator);
740 cout << "ginsh - GiNaC Interactive Shell (" << PACKAGE << " V" << VERSION << ")" << endl;
741 cout << " __, _______ Copyright (C) 1999-2000 Johannes Gutenberg University Mainz,\n"
742 << " (__) * | Germany. This is free software with ABSOLUTELY NO WARRANTY.\n"
743 << " ._) i N a C | You are welcome to redistribute it under certain conditions.\n"
744 << "<-------------' For details type `warranty;'.\n" << endl;
745 cout << "Type ?? for a list of help topics." << endl;
751 int main(int argc, char **argv)
753 // Print banner in interactive mode
757 // Init function table
758 insert_fcns(builtin_fcns);
759 ginsh_get_ginac_functions();
761 // Init help for operators (automatically generated from man page)
762 insert_help("operators", "Operators in falling order of precedence:");
763 #include "ginsh_op_help.c"
765 // Init help for built-in functions (automatically generated from man page)
766 #include "ginsh_fcn_help.c"
768 // Help for GiNaC functions is added manually
769 insert_fcn_help("acos", "inverse cosine function");
770 insert_fcn_help("acosh", "inverse hyperbolic cosine function");
771 insert_fcn_help("asin", "inverse sine function");
772 insert_fcn_help("asinh", "inverse hyperbolic sine function");
773 insert_fcn_help("atan", "inverse tangent function");
774 insert_fcn_help("atan2", "inverse tangent function with two arguments");
775 insert_fcn_help("atanh", "inverse hyperbolic tangent function");
776 insert_fcn_help("beta", "beta function");
777 insert_fcn_help("binomial", "binomial function");
778 insert_fcn_help("cos", "cosine function");
779 insert_fcn_help("cosh", "hyperbolic cosine function");
780 insert_fcn_help("exp", "exponential function");
781 insert_fcn_help("factorial", "factorial function");
782 insert_fcn_help("gamma", "gamma function");
783 insert_fcn_help("log", "natural logarithm");
784 insert_fcn_help("psi", "psi function\npsi(x) is the digamma function, psi(n,x) the nth polygamma function");
785 insert_fcn_help("sin", "sine function");
786 insert_fcn_help("sinh", "hyperbolic sine function");
787 insert_fcn_help("tan", "tangent function");
788 insert_fcn_help("tanh", "hyperbolic tangent function");
789 insert_fcn_help("zeta", "zeta function\nzeta(x) is Riemann's zeta function, zeta(n,x) its nth derivative");
790 insert_fcn_help("Li2", "dilogarithm");
791 insert_fcn_help("Li3", "trilogarithm");
792 insert_fcn_help("Order", "order term function (for truncated power series)");
794 // Init readline completer
795 rl_readline_name = argv[0];
796 rl_attempted_completion_function = (CPPFunction *)fcn_completion;
797 orig_completion_append_character = rl_completion_append_character;
798 orig_basic_word_break_characters = rl_basic_word_break_characters;
800 // Init input file list, open first file
801 num_files = argc - 1;
802 file_list = argv + 1;
804 yyin = fopen(*file_list, "r");
806 cerr << "Can't open " << *file_list << endl;
813 // Parse input, catch all remaining exceptions
817 } catch (exception &e) {
818 cerr << e.what() << endl;