|
2980
|
1 /* |
|
|
2 |
|
|
3 Copyright (C) 1996, 1997 John W. Eaton |
|
|
4 |
|
|
5 This file is part of Octave. |
|
|
6 |
|
|
7 Octave is free software; you can redistribute it and/or modify it |
|
|
8 under the terms of the GNU General Public License as published by the |
|
7016
|
9 Free Software Foundation; either version 3 of the License, or (at your |
|
|
10 option) any later version. |
|
2980
|
11 |
|
|
12 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
15 for more details. |
|
|
16 |
|
|
17 You should have received a copy of the GNU General Public License |
|
7016
|
18 along with Octave; see the file COPYING. If not, see |
|
|
19 <http://www.gnu.org/licenses/>. |
|
2980
|
20 |
|
|
21 */ |
|
|
22 |
|
|
23 #if !defined (octave_tree_unop_h) |
|
|
24 #define octave_tree_unop_h 1 |
|
|
25 |
|
|
26 #include <string> |
|
|
27 |
|
|
28 class tree_walker; |
|
|
29 |
|
|
30 class octave_value; |
|
|
31 class octave_value_list; |
|
|
32 class octave_lvalue; |
|
|
33 |
|
|
34 #include "pt-exp.h" |
|
|
35 |
|
|
36 // Unary expressions. |
|
|
37 |
|
|
38 class |
|
|
39 tree_unary_expression : public tree_expression |
|
|
40 { |
|
|
41 public: |
|
|
42 |
|
3203
|
43 tree_unary_expression (int l = -1, int c = -1, |
|
|
44 octave_value::unary_op t |
|
|
45 = octave_value::unknown_unary_op) |
|
|
46 : tree_expression (l, c), op (0), etype (t) { } |
|
2980
|
47 |
|
3203
|
48 tree_unary_expression (tree_expression *e, int l = -1, int c = -1, |
|
|
49 octave_value::unary_op t |
|
|
50 = octave_value::unknown_unary_op) |
|
|
51 : tree_expression (l, c), op (e), etype (t) { } |
|
2980
|
52 |
|
|
53 ~tree_unary_expression (void) { delete op; } |
|
|
54 |
|
4267
|
55 bool has_magic_end (void) const { return (op && op->has_magic_end ()); } |
|
|
56 |
|
2980
|
57 tree_expression *operand (void) { return op; } |
|
|
58 |
|
3523
|
59 std::string oper (void) const; |
|
3203
|
60 |
|
2980
|
61 protected: |
|
|
62 |
|
|
63 // The operand for the expression. |
|
|
64 tree_expression *op; |
|
2988
|
65 |
|
3203
|
66 // The type of the expression. |
|
|
67 octave_value::unary_op etype; |
|
|
68 |
|
|
69 private: |
|
|
70 |
|
2988
|
71 // No copying! |
|
|
72 |
|
|
73 tree_unary_expression (const tree_unary_expression&); |
|
|
74 |
|
|
75 tree_unary_expression& operator = (const tree_unary_expression&); |
|
2980
|
76 }; |
|
|
77 |
|
|
78 // Prefix expressions. |
|
|
79 |
|
|
80 class |
|
|
81 tree_prefix_expression : public tree_unary_expression |
|
|
82 { |
|
|
83 public: |
|
|
84 |
|
|
85 tree_prefix_expression (int l = -1, int c = -1) |
|
3203
|
86 : tree_unary_expression (l, c, octave_value::unknown_unary_op) { } |
|
2980
|
87 |
|
3195
|
88 tree_prefix_expression (tree_expression *e, int l = -1, int c = -1, |
|
3203
|
89 octave_value::unary_op t |
|
|
90 = octave_value::unknown_unary_op) |
|
|
91 : tree_unary_expression (e, l, c, t) { } |
|
2980
|
92 |
|
|
93 ~tree_prefix_expression (void) { } |
|
|
94 |
|
3933
|
95 bool rvalue_ok (void) const { return true; } |
|
2980
|
96 |
|
|
97 octave_value rvalue (void); |
|
|
98 |
|
3010
|
99 octave_value_list rvalue (int nargout); |
|
2980
|
100 |
|
|
101 void eval_error (void); |
|
|
102 |
|
5861
|
103 tree_expression *dup (symbol_table *sym_tab); |
|
|
104 |
|
2980
|
105 void accept (tree_walker& tw); |
|
|
106 |
|
|
107 private: |
|
|
108 |
|
2988
|
109 // No copying! |
|
|
110 |
|
|
111 tree_prefix_expression (const tree_prefix_expression&); |
|
|
112 |
|
|
113 tree_prefix_expression& operator = (const tree_prefix_expression&); |
|
2980
|
114 }; |
|
|
115 |
|
|
116 // Postfix expressions. |
|
|
117 |
|
|
118 class |
|
|
119 tree_postfix_expression : public tree_unary_expression |
|
|
120 { |
|
|
121 public: |
|
|
122 |
|
|
123 tree_postfix_expression (int l = -1, int c = -1) |
|
3203
|
124 : tree_unary_expression (l, c, octave_value::unknown_unary_op) { } |
|
2980
|
125 |
|
3195
|
126 tree_postfix_expression (tree_expression *e, int l = -1, int c = -1, |
|
3203
|
127 octave_value::unary_op t |
|
|
128 = octave_value::unknown_unary_op) |
|
|
129 : tree_unary_expression (e, l, c, t) { } |
|
2980
|
130 |
|
|
131 ~tree_postfix_expression (void) { } |
|
|
132 |
|
3933
|
133 bool rvalue_ok (void) const { return true; } |
|
2980
|
134 |
|
|
135 octave_value rvalue (void); |
|
|
136 |
|
|
137 octave_value_list rvalue (int nargout); |
|
|
138 |
|
|
139 void eval_error (void); |
|
|
140 |
|
5861
|
141 tree_expression *dup (symbol_table *sym_tab); |
|
|
142 |
|
2980
|
143 void accept (tree_walker& tw); |
|
|
144 |
|
|
145 private: |
|
|
146 |
|
2988
|
147 // No copying! |
|
|
148 |
|
|
149 tree_postfix_expression (const tree_postfix_expression&); |
|
|
150 |
|
|
151 tree_postfix_expression& operator = (const tree_postfix_expression&); |
|
2980
|
152 }; |
|
|
153 |
|
|
154 #endif |
|
|
155 |
|
|
156 /* |
|
|
157 ;;; Local Variables: *** |
|
|
158 ;;; mode: C++ *** |
|
|
159 ;;; End: *** |
|
|
160 */ |
