3 * Implementation of GiNaC's parser. */
6 * GiNaC Copyright (C) 1999-2009 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
35 /// identifier_expr: identifier | identifier '(' expression* ')'
36 ex parser::parse_identifier_expr()
38 std::string name = scanner->str;
39 get_next_tok(); // eat identifier.
41 if (token != '(') // symbol
42 return find_or_insert_symbol(name, syms, strict);
44 // function/ctor call.
45 get_next_tok(); // eat (
49 ex e = parse_expression();
56 Parse_error("expected ')' or ',' in argument list");
63 prototype the_prototype = make_pair(name, args.size());
64 prototype_table::const_iterator reader = funcs.find(the_prototype);
65 if (reader == funcs.end()) {
66 Parse_error_("no function \"" << name << "\" with " <<
67 args.size() << " arguments");
69 // dirty hack to distinguish between serial numbers of functions and real
73 ret = GiNaC::function(reinterpret_cast<unsigned>(reader->second), args);
75 catch ( std::runtime_error ) {
76 ret = reader->second(args);
81 /// paren_expr: '(' expression ')'
82 ex parser::parse_paren_expr()
84 get_next_tok(); // eat (.
85 ex e = parse_expression();
88 Parse_error("expected ')'");
89 get_next_tok(); // eat ).
93 extern numeric* _num_1_p;
96 /// unary_expr: [+-] expression
97 ex parser::parse_unary_expr()
99 // Unlike most other parse_* method this one does NOT consume
100 // current token so parse_binop_rhs() knows what kind of operator
103 // There are different kinds of expressions which need to be handled:
108 // Delegete the work to parse_binop_rhs(), otherwise we end up
109 // duplicating it here.
110 ex lhs = _ex0; // silly trick
111 ex e = parse_binop_rhs(0, lhs);
115 /// primary: identifier_expr | number_expr | paren_expr | unary_expr
116 ex parser::parse_primary()
119 case lexer::token_type::identifier:
120 return parse_identifier_expr();
121 case lexer::token_type::number:
122 return parse_number_expr();
124 return parse_paren_expr();
127 return parse_unary_expr();
128 case lexer::token_type::literal:
129 return parse_literal_expr();
130 case lexer::token_type::eof:
132 Parse_error("unexpected token");
136 /// expression ::= primary binoprhs
137 ex parser::parse_expression()
139 ex lhs = parse_primary();
140 ex res = parse_binop_rhs(0, lhs);
144 /// number_expr: number
145 ex parser::parse_number_expr()
147 ex n = numeric(scanner->str.c_str());
148 get_next_tok(); // consume the number
152 /// literal_expr: 'I' | 'Pi' | 'Euler' | 'Catalan'
153 ex parser::parse_literal_expr()
155 get_next_tok(); // consume the literal
156 if (scanner->str == "I")
158 else if (scanner->str == "Pi")
160 else if (scanner->str == "Euler")
162 else if (scanner->str == "Catalan")
164 bug("unknown literal: \"" << scanner->str << "\"");
167 ex parser::operator()(std::istream& input)
169 scanner->switch_input(&input);
171 ex ret = parse_expression();
172 // parse_expression() stops if it encounters an unknown token.
173 // This is not a bug: since the parser is recursive checking
174 // whether the next token is valid is responsibility of the caller.
175 // Hence make sure nothing is left in the stream:
176 if (token != lexer::token_type::eof)
177 Parse_error("expected EOF");
182 ex parser::operator()(const std::string& input)
184 std::istringstream is(input);
185 ex ret = operator()(is);
189 int parser::get_next_tok()
191 token = scanner->gettok();
195 parser::parser(const symtab& syms_, const bool strict_,
196 const prototype_table& funcs_) : strict(strict_),
197 funcs(funcs_), syms(syms_)
199 scanner = new lexer();