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 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_PRINT 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();}
142 | T_XYZZY {cout << "Nothing happens.\n";}
143 | T_INVENTORY {cout << "You're not carrying anything.\n";}
144 | T_LOOK {cout << "You're in a twisty little maze of passages, all alike.\n";}
146 cout << "If you were to quit now, you would score ";
147 cout << (syms.size() > 350 ? 350 : syms.size());
148 cout << " out of a possible 350.\n";
150 | error ';' {yyclearin; yyerrok;}
151 | error ':' {yyclearin; yyerrok;}
154 exp : T_NUMBER {$$ = $1;}
155 | T_SYMBOL {$$ = $1.eval();}
156 | '\'' T_SYMBOL '\'' {$$ = $2;}
157 | T_LITERAL {$$ = $1;}
158 | T_DIGITS {$$ = $1;}
159 | T_QUOTE {$$ = exstack[0];}
160 | T_QUOTE2 {$$ = exstack[1];}
161 | T_QUOTE3 {$$ = exstack[2];}
162 | T_TIME {getrusage(RUSAGE_SELF, &start_time);} '(' exp ')' {
163 getrusage(RUSAGE_SELF, &end_time);
164 $$ = (end_time.ru_utime.tv_sec - start_time.ru_utime.tv_sec) +
165 (end_time.ru_stime.tv_sec - start_time.ru_stime.tv_sec) +
166 double(end_time.ru_utime.tv_usec - start_time.ru_utime.tv_usec) / 1e6 +
167 double(end_time.ru_stime.tv_usec - start_time.ru_stime.tv_usec) / 1e6;
169 | T_SYMBOL '(' exprseq ')' {
170 fcn_tab::const_iterator i = find_function($1, $3.nops());
171 if (i->second.is_ginac) {
172 $$ = ((fcnp2)(i->second.p))(static_cast<const exprseq &>(*($3.bp)), i->second.serial);
174 $$ = (i->second.p)(static_cast<const exprseq &>(*($3.bp)));
177 | T_DIGITS '=' T_NUMBER {$$ = $3; Digits = ex_to_numeric($3).to_int();}
178 | T_SYMBOL '=' exp {$$ = $3; const_cast<symbol *>(&ex_to_symbol($1))->assign($3);}
179 | exp T_EQUAL exp {$$ = $1 == $3;}
180 | exp T_NOTEQ exp {$$ = $1 != $3;}
181 | exp '<' exp {$$ = $1 < $3;}
182 | exp T_LESSEQ exp {$$ = $1 <= $3;}
183 | exp '>' exp {$$ = $1 > $3;}
184 | exp T_GREATEREQ exp {$$ = $1 >= $3;}
185 | exp '+' exp {$$ = $1 + $3;}
186 | exp '-' exp {$$ = $1 - $3;}
187 | exp '*' exp {$$ = $1 * $3;}
188 | exp '/' exp {$$ = $1 / $3;}
189 | exp '%' exp {$$ = $1 % $3;}
190 | '-' exp %prec NEG {$$ = -$2;}
191 | '+' exp %prec NEG {$$ = $2;}
192 | exp '^' exp {$$ = power($1, $3);}
193 | exp '!' {$$ = factorial($1);}
194 | '(' exp ')' {$$ = $2;}
195 | '[' list_or_empty ']' {$$ = $2;}
196 | T_MATRIX_BEGIN matrix T_MATRIX_END {$$ = lst2matrix($2);}
199 exprseq : exp {$$ = exprseq($1);}
200 | exprseq ',' exp {exprseq es(static_cast<exprseq &>(*($1.bp))); $$ = es.append($3);}
203 list_or_empty: /* empty */ {$$ = *new lst;}
207 list : exp {$$ = lst($1);}
208 | list ',' exp {lst l(static_cast<lst &>(*($1.bp))); $$ = l.append($3);}
211 matrix : T_MATRIX_BEGIN row T_MATRIX_END {$$ = lst($2);}
212 | matrix ',' T_MATRIX_BEGIN row T_MATRIX_END {lst l(static_cast<lst &>(*($1.bp))); $$ = l.append($4);}
215 row : exp {$$ = lst($1);}
216 | row ',' exp {lst l(static_cast<lst &>(*($1.bp))); $$ = l.append($3);}
225 // Error print routine
228 cerr << s << " at " << yytext << endl;
232 // Push expression "e" onto the expression stack (for ", "" and """)
233 static void push(const ex &e)
235 exstack[2] = exstack[1];
236 exstack[1] = exstack[0];
245 static ex f_denom(const exprseq &e) {return e[0].denom();}
246 static ex f_eval1(const exprseq &e) {return e[0].eval();}
247 static ex f_evalf1(const exprseq &e) {return e[0].evalf();}
248 static ex f_expand(const exprseq &e) {return e[0].expand();}
249 static ex f_gcd(const exprseq &e) {return gcd(e[0], e[1]);}
250 static ex f_lcm(const exprseq &e) {return lcm(e[0], e[1]);}
251 static ex f_lsolve(const exprseq &e) {return lsolve(e[0], e[1]);}
252 static ex f_nops(const exprseq &e) {return e[0].nops();}
253 static ex f_normal1(const exprseq &e) {return e[0].normal();}
254 static ex f_numer(const exprseq &e) {return e[0].numer();}
255 static ex f_power(const exprseq &e) {return power(e[0], e[1]);}
256 static ex f_sqrt(const exprseq &e) {return sqrt(e[0]);}
257 static ex f_subs2(const exprseq &e) {return e[0].subs(e[1]);}
259 #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))
261 static ex f_charpoly(const exprseq &e)
263 CHECK_ARG(0, matrix, charpoly);
264 CHECK_ARG(1, symbol, charpoly);
265 return ex_to_matrix(e[0]).charpoly(ex_to_symbol(e[1]));
268 static ex f_coeff(const exprseq &e)
270 CHECK_ARG(1, symbol, coeff);
271 CHECK_ARG(2, numeric, coeff);
272 return e[0].coeff(ex_to_symbol(e[1]), ex_to_numeric(e[2]).to_int());
275 static ex f_collect(const exprseq &e)
277 CHECK_ARG(1, symbol, collect);
278 return e[0].collect(ex_to_symbol(e[1]));
281 static ex f_content(const exprseq &e)
283 CHECK_ARG(1, symbol, content);
284 return e[0].content(ex_to_symbol(e[1]));
287 static ex f_degree(const exprseq &e)
289 CHECK_ARG(1, symbol, degree);
290 return e[0].degree(ex_to_symbol(e[1]));
293 static ex f_determinant(const exprseq &e)
295 CHECK_ARG(0, matrix, determinant);
296 return ex_to_matrix(e[0]).determinant();
299 static ex f_diag(const exprseq &e)
302 matrix &m = *new matrix(dim, dim);
303 for (int i=0; i<dim; i++)
304 m.set(i, i, e.op(i));
308 static ex f_diff2(const exprseq &e)
310 CHECK_ARG(1, symbol, diff);
311 return e[0].diff(ex_to_symbol(e[1]));
314 static ex f_diff3(const exprseq &e)
316 CHECK_ARG(1, symbol, diff);
317 CHECK_ARG(2, numeric, diff);
318 return e[0].diff(ex_to_symbol(e[1]), ex_to_numeric(e[2]).to_int());
321 static ex f_divide(const exprseq &e)
324 if (divide(e[0], e[1], q))
330 static ex f_eval2(const exprseq &e)
332 CHECK_ARG(1, numeric, eval);
333 return e[0].eval(ex_to_numeric(e[1]).to_int());
336 static ex f_evalf2(const exprseq &e)
338 CHECK_ARG(1, numeric, evalf);
339 return e[0].evalf(ex_to_numeric(e[1]).to_int());
342 static ex f_has(const exprseq &e)
344 return e[0].has(e[1]) ? ex(1) : ex(0);
347 static ex f_inverse(const exprseq &e)
349 CHECK_ARG(0, matrix, inverse);
350 return ex_to_matrix(e[0]).inverse();
353 static ex f_is(const exprseq &e)
355 CHECK_ARG(0, relational, is);
356 return (bool)ex_to_relational(e[0]) ? ex(1) : ex(0);
359 static ex f_lcoeff(const exprseq &e)
361 CHECK_ARG(1, symbol, lcoeff);
362 return e[0].lcoeff(ex_to_symbol(e[1]));
365 static ex f_ldegree(const exprseq &e)
367 CHECK_ARG(1, symbol, ldegree);
368 return e[0].ldegree(ex_to_symbol(e[1]));
371 static ex f_normal2(const exprseq &e)
373 CHECK_ARG(1, numeric, normal);
374 return e[0].normal(ex_to_numeric(e[1]).to_int());
377 static ex f_op(const exprseq &e)
379 CHECK_ARG(1, numeric, op);
380 int n = ex_to_numeric(e[1]).to_int();
381 if (n < 0 || n >= e[0].nops())
382 throw(std::out_of_range("second argument to op() is out of range"));
386 static ex f_prem(const exprseq &e)
388 CHECK_ARG(2, symbol, prem);
389 return prem(e[0], e[1], ex_to_symbol(e[2]));
392 static ex f_primpart(const exprseq &e)
394 CHECK_ARG(1, symbol, primpart);
395 return e[0].primpart(ex_to_symbol(e[1]));
398 static ex f_quo(const exprseq &e)
400 CHECK_ARG(2, symbol, quo);
401 return quo(e[0], e[1], ex_to_symbol(e[2]));
404 static ex f_rem(const exprseq &e)
406 CHECK_ARG(2, symbol, rem);
407 return rem(e[0], e[1], ex_to_symbol(e[2]));
410 static ex f_series2(const exprseq &e)
412 CHECK_ARG(1, symbol, series);
413 return e[0].series(ex_to_symbol(e[1]), ex(0));
416 static ex f_series3(const exprseq &e)
418 CHECK_ARG(1, symbol, series);
419 return e[0].series(ex_to_symbol(e[1]), e[2]);
422 static ex f_series4(const exprseq &e)
424 CHECK_ARG(1, symbol, series);
425 CHECK_ARG(3, numeric, series);
426 return e[0].series(ex_to_symbol(e[1]), e[2], ex_to_numeric(e[3]).to_int());
429 static ex f_sqrfree(const exprseq &e)
431 CHECK_ARG(1, symbol, sqrfree);
432 return sqrfree(e[0], ex_to_symbol(e[1]));
435 static ex f_subs3(const exprseq &e)
437 CHECK_ARG(1, lst, subs);
438 CHECK_ARG(2, lst, subs);
439 return e[0].subs(ex_to_lst(e[1]), ex_to_lst(e[2]));
442 static ex f_tcoeff(const exprseq &e)
444 CHECK_ARG(1, symbol, tcoeff);
445 return e[0].tcoeff(ex_to_symbol(e[1]));
448 static ex f_trace(const exprseq &e)
450 CHECK_ARG(0, matrix, trace);
451 return ex_to_matrix(e[0]).trace();
454 static ex f_transpose(const exprseq &e)
456 CHECK_ARG(0, matrix, transpose);
457 return ex_to_matrix(e[0]).transpose();
460 static ex f_unassign(const exprseq &e)
462 CHECK_ARG(0, symbol, unassign);
463 (const_cast<symbol *>(&ex_to_symbol(e[0])))->unassign();
467 static ex f_unit(const exprseq &e)
469 CHECK_ARG(1, symbol, unit);
470 return e[0].unit(ex_to_symbol(e[1]));
473 static ex f_dummy(const exprseq &e)
475 throw(std::logic_error("dummy function called (shouldn't happen)"));
478 // Table for initializing the "fcns" map
484 static const fcn_init builtin_fcns[] = {
485 {"charpoly", fcn_desc(f_charpoly, 2)},
486 {"coeff", fcn_desc(f_coeff, 3)},
487 {"collect", fcn_desc(f_collect, 2)},
488 {"content", fcn_desc(f_content, 2)},
489 {"degree", fcn_desc(f_degree, 2)},
490 {"denom", fcn_desc(f_denom, 1)},
491 {"determinant", fcn_desc(f_determinant, 1)},
492 {"diag", fcn_desc(f_diag, 0)},
493 {"diff", fcn_desc(f_diff2, 2)},
494 {"diff", fcn_desc(f_diff3, 3)},
495 {"divide", fcn_desc(f_divide, 2)},
496 {"eval", fcn_desc(f_eval1, 1)},
497 {"eval", fcn_desc(f_eval2, 2)},
498 {"evalf", fcn_desc(f_evalf1, 1)},
499 {"evalf", fcn_desc(f_evalf2, 2)},
500 {"expand", fcn_desc(f_expand, 1)},
501 {"gcd", fcn_desc(f_gcd, 2)},
502 {"has", fcn_desc(f_has, 2)},
503 {"inverse", fcn_desc(f_inverse, 1)},
504 {"is", fcn_desc(f_is, 1)},
505 {"lcm", fcn_desc(f_lcm, 2)},
506 {"lcoeff", fcn_desc(f_lcoeff, 2)},
507 {"ldegree", fcn_desc(f_ldegree, 2)},
508 {"lsolve", fcn_desc(f_lsolve, 2)},
509 {"nops", fcn_desc(f_nops, 1)},
510 {"normal", fcn_desc(f_normal1, 1)},
511 {"normal", fcn_desc(f_normal2, 2)},
512 {"numer", fcn_desc(f_numer, 1)},
513 {"op", fcn_desc(f_op, 2)},
514 {"power", fcn_desc(f_power, 2)},
515 {"prem", fcn_desc(f_prem, 3)},
516 {"primpart", fcn_desc(f_primpart, 2)},
517 {"quo", fcn_desc(f_quo, 3)},
518 {"rem", fcn_desc(f_rem, 3)},
519 {"series", fcn_desc(f_series2, 2)},
520 {"series", fcn_desc(f_series3, 3)},
521 {"series", fcn_desc(f_series4, 4)},
522 {"sqrfree", fcn_desc(f_sqrfree, 2)},
523 {"sqrt", fcn_desc(f_sqrt, 1)},
524 {"subs", fcn_desc(f_subs2, 2)},
525 {"subs", fcn_desc(f_subs3, 3)},
526 {"tcoeff", fcn_desc(f_tcoeff, 2)},
527 {"time", fcn_desc(f_dummy, 0)},
528 {"trace", fcn_desc(f_trace, 1)},
529 {"transpose", fcn_desc(f_transpose, 1)},
530 {"unassign", fcn_desc(f_unassign, 1)},
531 {"unit", fcn_desc(f_unit, 2)},
532 {NULL, fcn_desc(f_dummy, 0)} // End marker
537 * Add functions to ginsh
540 // Functions from fcn_init array
541 static void insert_fcns(const fcn_init *p)
544 fcns.insert(make_pair(string(p->name), p->desc));
549 static ex f_ginac_function(const exprseq &es, int serial)
551 return function(serial, es).eval(1);
554 // All registered GiNaC functions
555 #ifndef NO_GINAC_NAMESPACE
556 void GiNaC::ginsh_get_ginac_functions(void)
557 #else // ndef NO_GINAC_NAMESPACE
558 void ginsh_get_ginac_functions(void)
559 #endif // ndef NO_GINAC_NAMESPACE
561 vector<registered_function_info>::const_iterator i = function::registered_functions().begin(), end = function::registered_functions().end();
564 fcns.insert(make_pair(i->name, fcn_desc(f_ginac_function, i->nparams, serial)));
572 * Find a function given a name and number of parameters. Throw exceptions on error.
575 static fcn_tab::const_iterator find_function(const ex &sym, int req_params)
577 const string &name = ex_to_symbol(sym).getname();
578 typedef fcn_tab::const_iterator I;
579 pair<I, I> b = fcns.equal_range(name);
580 if (b.first == b.second)
581 throw(std::logic_error("unknown function '" + name + "'"));
583 for (I i=b.first; i!=b.second; i++)
584 if ((i->second.num_params == 0) || (i->second.num_params == req_params))
587 throw(std::logic_error("invalid number of arguments to " + name + "()"));
592 * Insert help strings
595 // Normal help string
596 static void insert_help(const char *topic, const char *str)
598 help.insert(make_pair(string(topic), string(str)));
601 // Help string for functions, automatically generates synopsis
602 static void insert_fcn_help(const char *name, const char *str)
604 typedef fcn_tab::const_iterator I;
605 pair<I, I> b = fcns.equal_range(name);
606 if (b.first != b.second) {
607 string help_str = string(name) + "(";
608 for (int i=0; i<b.first->second.num_params; i++) {
611 help_str += "expression";
615 help.insert(make_pair(string(name), help_str));
624 // Help for a given topic
625 static void print_help(const string &topic)
627 typedef help_tab::const_iterator I;
628 pair<I, I> b = help.equal_range(topic);
629 if (b.first == b.second)
630 cout << "no help for '" << topic << "'\n";
632 for (I i=b.first; i!=b.second; i++)
633 cout << i->second << endl;
637 // List of help topics
638 static void print_help_topics(void)
640 cout << "Available help topics:\n";
641 help_tab::const_iterator i;
642 string last_name = string("*");
644 for (i=help.begin(); i!=help.end(); i++) {
645 // Don't print duplicates
646 if (i->first != last_name) {
651 last_name = i->first;
654 cout << "\nTo get help for a certain topic, type ?topic\n";
659 * Convert list of lists to matrix
662 static ex lst2matrix(const ex &l)
664 if (!is_ex_of_type(l, lst))
665 throw(std::logic_error("internal error: argument to lst2matrix() is not a list"));
667 // Find number of rows and columns
668 int rows = l.nops(), cols = 0, i, j;
669 for (i=0; i<rows; i++)
670 if (l.op(i).nops() > cols)
671 cols = l.op(i).nops();
673 // Allocate and fill matrix
674 matrix &m = *new matrix(rows, cols);
675 for (i=0; i<rows; i++)
676 for (j=0; j<cols; j++)
677 if (l.op(i).nops() > j)
678 m.set(i, j, l.op(i).op(j));
686 * Function name completion functions for readline
689 static char *fcn_generator(char *text, int state)
691 static int len; // Length of word to complete
692 static fcn_tab::const_iterator index; // Iterator to function being currently considered
694 // If this is a new word to complete, initialize now
696 index = fcns.begin();
700 // Return the next function which partially matches
701 while (index != fcns.end()) {
702 const char *fcn_name = index->first.c_str();
704 if (strncmp(fcn_name, text, len) == 0)
705 return strdup(fcn_name);
710 static char **fcn_completion(char *text, int start, int end)
712 if (rl_line_buffer[0] == '!') {
713 // For shell commands, revert back to filename completion
714 rl_completion_append_character = orig_completion_append_character;
715 rl_basic_word_break_characters = orig_basic_word_break_characters;
716 return completion_matches(text, (CPFunction *)filename_completion_function);
718 // Otherwise, complete function names
719 rl_completion_append_character = '(';
720 rl_basic_word_break_characters = " \t\n\"#$%&'()*+,-./:;<=>?@[\\]^`{|}~";
721 return completion_matches(text, (CPFunction *)fcn_generator);
730 int main(int argc, char **argv)
732 // Print banner in interactive mode
734 cout << "ginsh - GiNaC Interactive Shell (" << PACKAGE << " " << VERSION << ")\n";
735 cout << "Copyright (C) 1999 Johannes Gutenberg Universitaet Mainz, Germany\n";
736 cout << "This is free software, and you are welcome to redistribute it\n";
737 cout << "under certain conditions; see the file COPYING for details.\n";
738 cout << "Type ?? for a list of help topics.\n";
741 // Init function table
742 insert_fcns(builtin_fcns);
743 ginsh_get_ginac_functions();
745 // Init help for operators (automatically generated from man page)
746 insert_help("operators", "Operators in falling order of precedence:");
747 #include "ginsh_op_help.c"
749 // Init help for built-in functions (automatically generated from man page)
750 #include "ginsh_fcn_help.c"
752 // Help for GiNaC functions is added manually
753 insert_fcn_help("acos", "inverse cosine function");
754 insert_fcn_help("acosh", "inverse hyperbolic cosine function");
755 insert_fcn_help("asin", "inverse sine function");
756 insert_fcn_help("asinh", "inverse hyperbolic sine function");
757 insert_fcn_help("atan", "inverse tangent function");
758 insert_fcn_help("atan2", "inverse tangent function with two arguments");
759 insert_fcn_help("atanh", "inverse hyperbolic tangent function");
760 insert_fcn_help("beta", "beta function");
761 insert_fcn_help("cos", "cosine function");
762 insert_fcn_help("cosh", "hyperbolic cosine function");
763 insert_fcn_help("psi", "polygamma function");
764 insert_fcn_help("sin", "sine function");
765 insert_fcn_help("sinh", "hyperbolic sine function");
766 insert_fcn_help("tan", "tangent function");
767 insert_fcn_help("tanh", "hyperbolic tangent function");
768 insert_fcn_help("exp", "exponential function");
769 insert_fcn_help("log", "natural logarithm");
770 insert_fcn_help("Li2", "dilogarithm");
771 insert_fcn_help("Li3", "trilogarithm");
772 insert_fcn_help("binomial", "binomial function");
773 insert_fcn_help("factorial", "factorial function");
774 insert_fcn_help("gamma", "gamma function");
775 insert_fcn_help("Order", "order term function (for truncated power series)");
777 // Init readline completer
778 rl_readline_name = argv[0];
779 rl_attempted_completion_function = (CPPFunction *)fcn_completion;
780 orig_completion_append_character = rl_completion_append_character;
781 orig_basic_word_break_characters = rl_basic_word_break_characters;
783 // Init input file list, open first file
784 num_files = argc - 1;
785 file_list = argv + 1;
787 yyin = fopen(*file_list, "r");
789 cerr << "Can't open " << *file_list << endl;
796 // Parse input, catch all remaining exceptions
800 } catch (exception &e) {
801 cerr << e.what() << endl;