1
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
2
* Copyright (C) 2001 Gerwin Klein <lsf@jflex.de> *
3
* Copyright (C) 2001 Bernhard Rumpe <rumpe@in.tum.de> *
4
* All rights reserved. *
6
* This program is free software; you can redistribute it and/or modify *
7
* it under the terms of the GNU General Public License. See the file *
8
* COPYRIGHT for more information. *
10
* This program is distributed in the hope that it will be useful, *
11
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
12
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13
* GNU General Public License for more details. *
15
* You should have received a copy of the GNU General Public License along *
16
* with this program; if not, write to the Free Software Foundation, Inc., *
17
* 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *
19
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
23
* AST node for infix expressions
25
class Texpinfix extends Texp implements AST {
26
Texp exp1, exp2; // left and right sub expression
27
char kind; // kind ('+', '-', '*', '/')
29
public Texpinfix(Texp e1, char k, Texp e2) {
35
public String toString() {
36
return("("+exp1+kind+exp2+")");
39
public void checkcontext(SymTab st) { // context conditions
40
exp1.checkcontext(st);
41
exp2.checkcontext(st);
44
public void prepInterp(SymTab st) { // set pointers und indices
49
public int interpret(int[] in, int[] par) {
50
int e1 = exp1.interpret(in,par);
51
int e2 = exp2.interpret(in,par);
54
case '+': return(e1+e2);
55
case '-': return(e1-e2);
56
case '*': return(e1*e2);
57
case '/': return(e1/e2);
added
removed
examples/interpreter/Texpinfix.java
