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";
156 | T_XYZZY {cout << "Nothing happens.\n";}
157 | T_INVENTORY {cout << "You're not carrying anything.\n";}
158 | T_LOOK {cout << "You're in a twisty little maze of passages, all alike.\n";}
160 cout << "If you were to quit now, you would score ";
161 cout << (syms.size() > 350 ? 350 : syms.size());
162 cout << " out of a possible 350.\n";
164 | error ';' {yyclearin; yyerrok;}
165 | error ':' {yyclearin; yyerrok;}
168 exp : T_NUMBER {$$ = $1;}
169 | T_SYMBOL {$$ = $1.eval();}
170 | '\'' T_SYMBOL '\'' {$$ = $2;}
171 | T_LITERAL {$$ = $1;}
172 | T_DIGITS {$$ = $1;}
173 | T_QUOTE {$$ = exstack[0];}
174 | T_QUOTE2 {$$ = exstack[1];}
175 | T_QUOTE3 {$$ = exstack[2];}
176 | T_TIME {getrusage(RUSAGE_SELF, &start_time);} '(' exp ')' {
177 getrusage(RUSAGE_SELF, &end_time);
178 $$ = (end_time.ru_utime.tv_sec - start_time.ru_utime.tv_sec) +
179 (end_time.ru_stime.tv_sec - start_time.ru_stime.tv_sec) +
180 double(end_time.ru_utime.tv_usec - start_time.ru_utime.tv_usec) / 1e6 +
181 double(end_time.ru_stime.tv_usec - start_time.ru_stime.tv_usec) / 1e6;
183 | T_SYMBOL '(' exprseq ')' {
184 fcn_tab::const_iterator i = find_function($1, $3.nops());
185 if (i->second.is_ginac) {
186 $$ = ((fcnp2)(i->second.p))(static_cast<const exprseq &>(*($3.bp)), i->second.serial);
188 $$ = (i->second.p)(static_cast<const exprseq &>(*($3.bp)));
191 | T_DIGITS '=' T_NUMBER {$$ = $3; Digits = ex_to_numeric($3).to_int();}
192 | T_SYMBOL '=' exp {$$ = $3; const_cast<symbol *>(&ex_to_symbol($1))->assign($3);}
193 | exp T_EQUAL exp {$$ = $1 == $3;}
194 | exp T_NOTEQ exp {$$ = $1 != $3;}
195 | exp '<' exp {$$ = $1 < $3;}
196 | exp T_LESSEQ exp {$$ = $1 <= $3;}
197 | exp '>' exp {$$ = $1 > $3;}
198 | exp T_GREATEREQ 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 '%' exp {$$ = $1 % $3;}
204 | '-' exp %prec NEG {$$ = -$2;}
205 | '+' exp %prec NEG {$$ = $2;}
206 | exp '^' exp {$$ = power($1, $3);}
207 | exp '!' {$$ = factorial($1);}
208 | '(' exp ')' {$$ = $2;}
209 | '[' list_or_empty ']' {$$ = $2;}
210 | T_MATRIX_BEGIN matrix T_MATRIX_END {$$ = lst2matrix($2);}
213 exprseq : exp {$$ = exprseq($1);}
214 | exprseq ',' exp {exprseq es(static_cast<exprseq &>(*($1.bp))); $$ = es.append($3);}
217 list_or_empty: /* empty */ {$$ = *new lst;}
221 list : exp {$$ = lst($1);}
222 | list ',' exp {lst l(static_cast<lst &>(*($1.bp))); $$ = l.append($3);}
225 matrix : T_MATRIX_BEGIN row T_MATRIX_END {$$ = lst($2);}
226 | matrix ',' T_MATRIX_BEGIN row T_MATRIX_END {lst l(static_cast<lst &>(*($1.bp))); $$ = l.append($4);}
229 row : exp {$$ = lst($1);}
230 | row ',' exp {lst l(static_cast<lst &>(*($1.bp))); $$ = l.append($3);}
239 // Error print routine
242 cerr << s << " at " << yytext << endl;
246 // Push expression "e" onto the expression stack (for ", "" and """)
247 static void push(const ex &e)
249 exstack[2] = exstack[1];
250 exstack[1] = exstack[0];
259 static ex f_denom(const exprseq &e) {return e[0].denom();}
260 static ex f_eval1(const exprseq &e) {return e[0].eval();}
261 static ex f_evalf1(const exprseq &e) {return e[0].evalf();}
262 static ex f_expand(const exprseq &e) {return e[0].expand();}
263 static ex f_gcd(const exprseq &e) {return gcd(e[0], e[1]);}
264 static ex f_lcm(const exprseq &e) {return lcm(e[0], e[1]);}
265 static ex f_lsolve(const exprseq &e) {return lsolve(e[0], e[1]);}
266 static ex f_nops(const exprseq &e) {return e[0].nops();}
267 static ex f_normal1(const exprseq &e) {return e[0].normal();}
268 static ex f_numer(const exprseq &e) {return e[0].numer();}
269 static ex f_pow(const exprseq &e) {return pow(e[0], e[1]);}
270 static ex f_sqrt(const exprseq &e) {return sqrt(e[0]);}
271 static ex f_subs2(const exprseq &e) {return e[0].subs(e[1]);}
273 #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))
275 static ex f_charpoly(const exprseq &e)
277 CHECK_ARG(0, matrix, charpoly);
278 CHECK_ARG(1, symbol, charpoly);
279 return ex_to_matrix(e[0]).charpoly(ex_to_symbol(e[1]));
282 static ex f_coeff(const exprseq &e)
284 CHECK_ARG(1, symbol, coeff);
285 CHECK_ARG(2, numeric, coeff);
286 return e[0].coeff(ex_to_symbol(e[1]), ex_to_numeric(e[2]).to_int());
289 static ex f_collect(const exprseq &e)
291 CHECK_ARG(1, symbol, collect);
292 return e[0].collect(ex_to_symbol(e[1]));
295 static ex f_content(const exprseq &e)
297 CHECK_ARG(1, symbol, content);
298 return e[0].content(ex_to_symbol(e[1]));
301 static ex f_degree(const exprseq &e)
303 CHECK_ARG(1, symbol, degree);
304 return e[0].degree(ex_to_symbol(e[1]));
307 static ex f_determinant(const exprseq &e)
309 CHECK_ARG(0, matrix, determinant);
310 return ex_to_matrix(e[0]).determinant();
313 static ex f_diag(const exprseq &e)
315 unsigned dim = e.nops();
316 matrix &m = *new matrix(dim, dim);
317 for (unsigned i=0; i<dim; i++)
318 m.set(i, i, e.op(i));
322 static ex f_diff2(const exprseq &e)
324 CHECK_ARG(1, symbol, diff);
325 return e[0].diff(ex_to_symbol(e[1]));
328 static ex f_diff3(const exprseq &e)
330 CHECK_ARG(1, symbol, diff);
331 CHECK_ARG(2, numeric, diff);
332 return e[0].diff(ex_to_symbol(e[1]), ex_to_numeric(e[2]).to_int());
335 static ex f_divide(const exprseq &e)
338 if (divide(e[0], e[1], q))
344 static ex f_eval2(const exprseq &e)
346 CHECK_ARG(1, numeric, eval);
347 return e[0].eval(ex_to_numeric(e[1]).to_int());
350 static ex f_evalf2(const exprseq &e)
352 CHECK_ARG(1, numeric, evalf);
353 return e[0].evalf(ex_to_numeric(e[1]).to_int());
356 static ex f_has(const exprseq &e)
358 return e[0].has(e[1]) ? ex(1) : ex(0);
361 static ex f_inverse(const exprseq &e)
363 CHECK_ARG(0, matrix, inverse);
364 return ex_to_matrix(e[0]).inverse();
367 static ex f_is(const exprseq &e)
369 CHECK_ARG(0, relational, is);
370 return (bool)ex_to_relational(e[0]) ? ex(1) : ex(0);
373 static ex f_lcoeff(const exprseq &e)
375 CHECK_ARG(1, symbol, lcoeff);
376 return e[0].lcoeff(ex_to_symbol(e[1]));
379 static ex f_ldegree(const exprseq &e)
381 CHECK_ARG(1, symbol, ldegree);
382 return e[0].ldegree(ex_to_symbol(e[1]));
385 static ex f_normal2(const exprseq &e)
387 CHECK_ARG(1, numeric, normal);
388 return e[0].normal(ex_to_numeric(e[1]).to_int());
391 static ex f_op(const exprseq &e)
393 CHECK_ARG(1, numeric, op);
394 int n = ex_to_numeric(e[1]).to_int();
395 if (n < 0 || n >= (int)e[0].nops())
396 throw(std::out_of_range("second argument to op() is out of range"));
400 static ex f_prem(const exprseq &e)
402 CHECK_ARG(2, symbol, prem);
403 return prem(e[0], e[1], ex_to_symbol(e[2]));
406 static ex f_primpart(const exprseq &e)
408 CHECK_ARG(1, symbol, primpart);
409 return e[0].primpart(ex_to_symbol(e[1]));
412 static ex f_quo(const exprseq &e)
414 CHECK_ARG(2, symbol, quo);
415 return quo(e[0], e[1], ex_to_symbol(e[2]));
418 static ex f_rem(const exprseq &e)
420 CHECK_ARG(2, symbol, rem);
421 return rem(e[0], e[1], ex_to_symbol(e[2]));
424 static ex f_series2(const exprseq &e)
426 CHECK_ARG(1, symbol, series);
427 return e[0].series(ex_to_symbol(e[1]), ex(0));
430 static ex f_series3(const exprseq &e)
432 CHECK_ARG(1, symbol, series);
433 return e[0].series(ex_to_symbol(e[1]), e[2]);
436 static ex f_series4(const exprseq &e)
438 CHECK_ARG(1, symbol, series);
439 CHECK_ARG(3, numeric, series);
440 return e[0].series(ex_to_symbol(e[1]), e[2], ex_to_numeric(e[3]).to_int());
443 static ex f_sqrfree(const exprseq &e)
445 CHECK_ARG(1, symbol, sqrfree);
446 return sqrfree(e[0], ex_to_symbol(e[1]));
449 static ex f_subs3(const exprseq &e)
451 CHECK_ARG(1, lst, subs);
452 CHECK_ARG(2, lst, subs);
453 return e[0].subs(ex_to_lst(e[1]), ex_to_lst(e[2]));
456 static ex f_tcoeff(const exprseq &e)
458 CHECK_ARG(1, symbol, tcoeff);
459 return e[0].tcoeff(ex_to_symbol(e[1]));
462 static ex f_trace(const exprseq &e)
464 CHECK_ARG(0, matrix, trace);
465 return ex_to_matrix(e[0]).trace();
468 static ex f_transpose(const exprseq &e)
470 CHECK_ARG(0, matrix, transpose);
471 return ex_to_matrix(e[0]).transpose();
474 static ex f_unassign(const exprseq &e)
476 CHECK_ARG(0, symbol, unassign);
477 (const_cast<symbol *>(&ex_to_symbol(e[0])))->unassign();
481 static ex f_unit(const exprseq &e)
483 CHECK_ARG(1, symbol, unit);
484 return e[0].unit(ex_to_symbol(e[1]));
487 static ex f_dummy(const exprseq &e)
489 throw(std::logic_error("dummy function called (shouldn't happen)"));
492 // Table for initializing the "fcns" map
498 static const fcn_init builtin_fcns[] = {
499 {"charpoly", fcn_desc(f_charpoly, 2)},
500 {"coeff", fcn_desc(f_coeff, 3)},
501 {"collect", fcn_desc(f_collect, 2)},
502 {"content", fcn_desc(f_content, 2)},
503 {"degree", fcn_desc(f_degree, 2)},
504 {"denom", fcn_desc(f_denom, 1)},
505 {"determinant", fcn_desc(f_determinant, 1)},
506 {"diag", fcn_desc(f_diag, 0)},
507 {"diff", fcn_desc(f_diff2, 2)},
508 {"diff", fcn_desc(f_diff3, 3)},
509 {"divide", fcn_desc(f_divide, 2)},
510 {"eval", fcn_desc(f_eval1, 1)},
511 {"eval", fcn_desc(f_eval2, 2)},
512 {"evalf", fcn_desc(f_evalf1, 1)},
513 {"evalf", fcn_desc(f_evalf2, 2)},
514 {"expand", fcn_desc(f_expand, 1)},
515 {"gcd", fcn_desc(f_gcd, 2)},
516 {"has", fcn_desc(f_has, 2)},
517 {"inverse", fcn_desc(f_inverse, 1)},
518 {"is", fcn_desc(f_is, 1)},
519 {"lcm", fcn_desc(f_lcm, 2)},
520 {"lcoeff", fcn_desc(f_lcoeff, 2)},
521 {"ldegree", fcn_desc(f_ldegree, 2)},
522 {"lsolve", fcn_desc(f_lsolve, 2)},
523 {"nops", fcn_desc(f_nops, 1)},
524 {"normal", fcn_desc(f_normal1, 1)},
525 {"normal", fcn_desc(f_normal2, 2)},
526 {"numer", fcn_desc(f_numer, 1)},
527 {"op", fcn_desc(f_op, 2)},
528 {"pow", fcn_desc(f_pow, 2)},
529 {"prem", fcn_desc(f_prem, 3)},
530 {"primpart", fcn_desc(f_primpart, 2)},
531 {"quo", fcn_desc(f_quo, 3)},
532 {"rem", fcn_desc(f_rem, 3)},
533 {"series", fcn_desc(f_series2, 2)},
534 {"series", fcn_desc(f_series3, 3)},
535 {"series", fcn_desc(f_series4, 4)},
536 {"sqrfree", fcn_desc(f_sqrfree, 2)},
537 {"sqrt", fcn_desc(f_sqrt, 1)},
538 {"subs", fcn_desc(f_subs2, 2)},
539 {"subs", fcn_desc(f_subs3, 3)},
540 {"tcoeff", fcn_desc(f_tcoeff, 2)},
541 {"time", fcn_desc(f_dummy, 0)},
542 {"trace", fcn_desc(f_trace, 1)},
543 {"transpose", fcn_desc(f_transpose, 1)},
544 {"unassign", fcn_desc(f_unassign, 1)},
545 {"unit", fcn_desc(f_unit, 2)},
546 {NULL, fcn_desc(f_dummy, 0)} // End marker
551 * Add functions to ginsh
554 // Functions from fcn_init array
555 static void insert_fcns(const fcn_init *p)
558 fcns.insert(make_pair(string(p->name), p->desc));
563 static ex f_ginac_function(const exprseq &es, int serial)
565 return function(serial, es).eval(1);
568 // All registered GiNaC functions
569 #ifndef NO_NAMESPACE_GINAC
570 void GiNaC::ginsh_get_ginac_functions(void)
571 #else // ndef NO_NAMESPACE_GINAC
572 void ginsh_get_ginac_functions(void)
573 #endif // ndef NO_NAMESPACE_GINAC
575 vector<function_options>::const_iterator i = function::registered_functions().begin(), end = function::registered_functions().end();
578 fcns.insert(make_pair(i->get_name(), fcn_desc(f_ginac_function, i->get_nparams(), serial)));
586 * Find a function given a name and number of parameters. Throw exceptions on error.
589 static fcn_tab::const_iterator find_function(const ex &sym, int req_params)
591 const string &name = ex_to_symbol(sym).getname();
592 typedef fcn_tab::const_iterator I;
593 pair<I, I> b = fcns.equal_range(name);
594 if (b.first == b.second)
595 throw(std::logic_error("unknown function '" + name + "'"));
597 for (I i=b.first; i!=b.second; i++)
598 if ((i->second.num_params == 0) || (i->second.num_params == req_params))
601 throw(std::logic_error("invalid number of arguments to " + name + "()"));
606 * Insert help strings
609 // Normal help string
610 static void insert_help(const char *topic, const char *str)
612 help.insert(make_pair(string(topic), string(str)));
615 // Help string for functions, automatically generates synopsis
616 static void insert_fcn_help(const char *name, const char *str)
618 typedef fcn_tab::const_iterator I;
619 pair<I, I> b = fcns.equal_range(name);
620 if (b.first != b.second) {
621 string help_str = string(name) + "(";
622 for (int i=0; i<b.first->second.num_params; i++) {
625 help_str += "expression";
629 help.insert(make_pair(string(name), help_str));
638 // Help for a given topic
639 static void print_help(const string &topic)
641 typedef help_tab::const_iterator I;
642 pair<I, I> b = help.equal_range(topic);
643 if (b.first == b.second)
644 cout << "no help for '" << topic << "'\n";
646 for (I i=b.first; i!=b.second; i++)
647 cout << i->second << endl;
651 // List of help topics
652 static void print_help_topics(void)
654 cout << "Available help topics:\n";
655 help_tab::const_iterator i;
656 string last_name = string("*");
658 for (i=help.begin(); i!=help.end(); i++) {
659 // Don't print duplicates
660 if (i->first != last_name) {
665 last_name = i->first;
668 cout << "\nTo get help for a certain topic, type ?topic\n";
673 * Convert list of lists to matrix
676 static ex lst2matrix(const ex &l)
678 if (!is_ex_of_type(l, lst))
679 throw(std::logic_error("internal error: argument to lst2matrix() is not a list"));
681 // Find number of rows and columns
682 unsigned rows = l.nops(), cols = 0, i, j;
683 for (i=0; i<rows; i++)
684 if (l.op(i).nops() > cols)
685 cols = l.op(i).nops();
687 // Allocate and fill matrix
688 matrix &m = *new matrix(rows, cols);
689 for (i=0; i<rows; i++)
690 for (j=0; j<cols; j++)
691 if (l.op(i).nops() > j)
692 m.set(i, j, l.op(i).op(j));
700 * Function name completion functions for readline
703 static char *fcn_generator(char *text, int state)
705 static int len; // Length of word to complete
706 static fcn_tab::const_iterator index; // Iterator to function being currently considered
708 // If this is a new word to complete, initialize now
710 index = fcns.begin();
714 // Return the next function which partially matches
715 while (index != fcns.end()) {
716 const char *fcn_name = index->first.c_str();
718 if (strncmp(fcn_name, text, len) == 0)
719 return strdup(fcn_name);
724 static char **fcn_completion(char *text, int start, int end)
726 if (rl_line_buffer[0] == '!') {
727 // For shell commands, revert back to filename completion
728 rl_completion_append_character = orig_completion_append_character;
729 rl_basic_word_break_characters = orig_basic_word_break_characters;
730 return completion_matches(text, (CPFunction *)filename_completion_function);
732 // Otherwise, complete function names
733 rl_completion_append_character = '(';
734 rl_basic_word_break_characters = " \t\n\"#$%&'()*+,-./:;<=>?@[\\]^`{|}~";
735 return completion_matches(text, (CPFunction *)fcn_generator);
741 cout << "ginsh - GiNaC Interactive Shell (" << PACKAGE << " V" << VERSION << ")" << endl;
742 cout << " __, _______ Copyright (C) 1999-2000 Johannes Gutenberg University Mainz,\n"
743 << " (__) * | Germany. This is free software with ABSOLUTELY NO WARRANTY.\n"
744 << " ._) i N a C | You are welcome to redistribute it under certain conditions;\n"
745 << "<-------------' see the file COPYING for details.\n" << endl;
746 cout << "Type ?? for a list of help topics." << endl;
752 int main(int argc, char **argv)
754 // Print banner in interactive mode
758 // Init function table
759 insert_fcns(builtin_fcns);
760 ginsh_get_ginac_functions();
762 // Init help for operators (automatically generated from man page)
763 insert_help("operators", "Operators in falling order of precedence:");
764 #include "ginsh_op_help.c"
766 // Init help for built-in functions (automatically generated from man page)
767 #include "ginsh_fcn_help.c"
769 // Help for GiNaC functions is added manually
770 insert_fcn_help("acos", "inverse cosine function");
771 insert_fcn_help("acosh", "inverse hyperbolic cosine function");
772 insert_fcn_help("asin", "inverse sine function");
773 insert_fcn_help("asinh", "inverse hyperbolic sine function");
774 insert_fcn_help("atan", "inverse tangent function");
775 insert_fcn_help("atan2", "inverse tangent function with two arguments");
776 insert_fcn_help("atanh", "inverse hyperbolic tangent function");
777 insert_fcn_help("beta", "beta function");
778 insert_fcn_help("binomial", "binomial function");
779 insert_fcn_help("cos", "cosine function");
780 insert_fcn_help("cosh", "hyperbolic cosine function");
781 insert_fcn_help("exp", "exponential function");
782 insert_fcn_help("factorial", "factorial function");
783 insert_fcn_help("gamma", "gamma function");
784 insert_fcn_help("log", "natural logarithm");
785 insert_fcn_help("psi", "psi function\npsi(x) is the digamma function, psi(n,x) the nth polygamma function");
786 insert_fcn_help("sin", "sine function");
787 insert_fcn_help("sinh", "hyperbolic sine function");
788 insert_fcn_help("tan", "tangent function");
789 insert_fcn_help("tanh", "hyperbolic tangent function");
790 insert_fcn_help("zeta", "zeta function\nzeta(x) is Riemann's zeta function, zeta(n,x) its nth derivative");
791 insert_fcn_help("Li2", "dilogarithm");
792 insert_fcn_help("Li3", "trilogarithm");
793 insert_fcn_help("Order", "order term function (for truncated power series)");
795 // Init readline completer
796 rl_readline_name = argv[0];
797 rl_attempted_completion_function = (CPPFunction *)fcn_completion;
798 orig_completion_append_character = rl_completion_append_character;
799 orig_basic_word_break_characters = rl_basic_word_break_characters;
801 // Init input file list, open first file
802 num_files = argc - 1;
803 file_list = argv + 1;
805 yyin = fopen(*file_list, "r");
807 cerr << "Can't open " << *file_list << endl;
814 // Parse input, catch all remaining exceptions
818 } catch (exception &e) {
819 cerr << e.what() << endl;