1 /** @file input_lexer.ll
3 * Lexical analyzer definition for reading expressions.
4 * This file must be processed with flex. */
7 * GiNaC Copyright (C) 1999-2000 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
35 #include "input_lexer.h"
42 #ifndef NO_NAMESPACE_GINAC
43 using namespace GiNaC;
45 #endif // ndef NO_NAMESPACE_GINAC
47 #include "input_parser.h"
49 #ifndef NO_NAMESPACE_GINAC
51 #endif // ndef NO_NAMESPACE_GINAC
53 // Table of all used symbols
55 sym_def() : predefined(false) {}
56 sym_def(const ex &s, bool predef) : sym(s), predefined(predef) {}
59 sym_def(const sym_def &other) {sym = other.sym; predefined = other.predefined;}
60 const sym_def &operator=(const sym_def &other)
64 predefined = other.predefined;
70 bool predefined; // true = user supplied symbol, false = lexer generated symbol
72 typedef map<string, sym_def> sym_tab;
76 static int lexer_input(char *buf, int max_size);
77 #define YY_INPUT(buf, result, max_size) (result = lexer_input(buf, max_size))
92 [ \t]+ /* skip whitespace */
95 Pi ginac_yylval = Pi; return T_LITERAL;
96 Euler ginac_yylval = Euler; return T_LITERAL;
97 Catalan ginac_yylval = Catalan; return T_LITERAL;
98 FAIL ginac_yylval = *new fail(); return T_LITERAL;
99 I ginac_yylval = I; return T_NUMBER;
100 Digits ginac_yylval = (long)Digits; return T_DIGITS;
105 "<=" return T_LESSEQ;
106 ">=" return T_GREATEREQ;
108 /* matrix delimiters */
109 \[\[ return T_MATRIX_BEGIN;
110 \]\] return T_MATRIX_END;
116 {D}+{E} ginac_yylval = numeric(yytext); return T_NUMBER;
120 sym_tab::const_iterator i = syms.find(yytext);
121 if (i == syms.end()) {
122 syms[yytext] = sym_def(ginac_yylval = *(new symbol(yytext)), false);
124 ginac_yylval = i->second.sym;
128 /* everything else */
138 // The string from which we will read
139 static string lexer_string;
141 // The current position within the string
142 static int curr_pos = 0;
144 // Input function that reads from string
145 static int lexer_input(char *buf, int max_size)
147 int actual = lexer_string.length() - curr_pos;
148 if (actual > max_size)
152 lexer_string.copy(buf, actual, curr_pos);
157 // EOF encountered, terminate the scanner
163 #ifndef NO_NAMESPACE_GINAC
165 #endif // ndef NO_NAMESPACE_GINAC
167 // Set the input string
168 void set_lexer_string(const string &s)
174 // Set the list of predefined symbols
175 void set_lexer_symbols(ex l)
178 if (!is_ex_exactly_of_type(l, lst))
180 for (int i=0; i<l.nops(); i++) {
181 if (is_ex_exactly_of_type(l.op(i), symbol))
182 syms[ex_to_symbol(l.op(i)).getname()] = sym_def(l.op(i), true);
186 // Check whether symbol was predefined
187 bool is_lexer_symbol_predefined(const ex &s)
189 sym_tab::const_iterator i = syms.find(ex_to_symbol(s).getname());
193 return i->second.predefined;
196 #ifndef NO_NAMESPACE_GINAC
198 #endif // ndef NO_NAMESPACE_GINAC