|
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 |
|
|
9 Free Software Foundation; either version 2, or (at your option) any |
|
|
10 later version. |
|
|
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 |
|
|
18 along with Octave; see the file COPYING. If not, write to the Free |
|
5307
|
19 Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA |
|
|
20 02110-1301, USA. |
|
2980
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 #if !defined (octave_tree_assign_h) |
|
|
25 #define octave_tree_assign_h 1 |
|
|
26 |
|
3503
|
27 #include <iostream> |
|
2980
|
28 #include <string> |
|
|
29 |
|
|
30 class tree_argument_list; |
|
|
31 class tree_walker; |
|
|
32 |
|
|
33 class octave_value; |
|
|
34 class octave_value_list; |
|
|
35 class octave_lvalue; |
|
|
36 |
|
|
37 #include "ov.h" |
|
|
38 #include "pt-exp.h" |
|
|
39 |
|
|
40 // Simple assignment expressions. |
|
|
41 |
|
|
42 class |
|
|
43 tree_simple_assignment : public tree_expression |
|
|
44 { |
|
|
45 public: |
|
|
46 |
|
|
47 tree_simple_assignment (bool plhs = false, int l = -1, int c = -1, |
|
3527
|
48 octave_value::assign_op t = octave_value::op_asn_eq) |
|
2980
|
49 : tree_expression (l, c), lhs (0), rhs (0), preserve (plhs), etype (t) { } |
|
|
50 |
|
|
51 tree_simple_assignment (tree_expression *le, tree_expression *re, |
|
|
52 bool plhs = false, int l = -1, int c = -1, |
|
3527
|
53 octave_value::assign_op t = octave_value::op_asn_eq) |
|
2980
|
54 : tree_expression (l, c), lhs (le), rhs (re), preserve (plhs), |
|
|
55 etype (t) { } |
|
|
56 |
|
|
57 ~tree_simple_assignment (void); |
|
|
58 |
|
4267
|
59 bool has_magic_end (void) const { return (rhs && rhs->has_magic_end ()); } |
|
|
60 |
|
3933
|
61 bool rvalue_ok (void) const { return true; } |
|
2980
|
62 |
|
|
63 octave_value rvalue (void); |
|
|
64 |
|
|
65 octave_value_list rvalue (int nargout); |
|
|
66 |
|
3933
|
67 bool is_assignment_expression (void) const { return true; } |
|
2980
|
68 |
|
|
69 void eval_error (void); |
|
|
70 |
|
3523
|
71 std::string oper (void) const; |
|
2980
|
72 |
|
|
73 tree_expression *left_hand_side (void) { return lhs; } |
|
|
74 |
|
|
75 tree_expression *right_hand_side (void) { return rhs; } |
|
|
76 |
|
|
77 void accept (tree_walker& tw); |
|
|
78 |
|
|
79 private: |
|
|
80 |
|
|
81 void do_assign (octave_lvalue& ult, const octave_value_list& args, |
|
|
82 const octave_value& rhs_val); |
|
|
83 |
|
|
84 void do_assign (octave_lvalue& ult, const octave_value& rhs_val); |
|
|
85 |
|
|
86 // The left hand side of the assignment. |
|
|
87 tree_expression *lhs; |
|
|
88 |
|
|
89 // The right hand side of the assignment. |
|
|
90 tree_expression *rhs; |
|
|
91 |
|
|
92 // True if we should not delete the lhs. |
|
|
93 bool preserve; |
|
|
94 |
|
5794
|
95 // True if this is an assignment to the automatic variable ans. |
|
2980
|
96 bool ans_ass; |
|
|
97 |
|
|
98 // The type of the expression. |
|
|
99 octave_value::assign_op etype; |
|
2988
|
100 |
|
|
101 // No copying! |
|
|
102 |
|
2989
|
103 tree_simple_assignment (const tree_simple_assignment&); |
|
2988
|
104 |
|
2989
|
105 tree_simple_assignment& operator = (const tree_simple_assignment&); |
|
2980
|
106 }; |
|
|
107 |
|
|
108 // Multi-valued assignment expressions. |
|
|
109 |
|
|
110 class |
|
|
111 tree_multi_assignment : public tree_expression |
|
|
112 { |
|
|
113 public: |
|
|
114 |
|
3208
|
115 tree_multi_assignment (bool plhs = false, int l = -1, int c = -1, |
|
3527
|
116 octave_value::assign_op t = octave_value::op_asn_eq) |
|
3208
|
117 : tree_expression (l, c), lhs (0), rhs (0), preserve (plhs), etype(t) { } |
|
2980
|
118 |
|
|
119 tree_multi_assignment (tree_argument_list *lst, tree_expression *r, |
|
3208
|
120 bool plhs = false, int l = -1, int c = -1, |
|
3527
|
121 octave_value::assign_op t = octave_value::op_asn_eq) |
|
3208
|
122 : tree_expression (l, c), lhs (lst), rhs (r), preserve (plhs), |
|
|
123 etype (t) { } |
|
2980
|
124 |
|
|
125 ~tree_multi_assignment (void); |
|
|
126 |
|
4267
|
127 bool has_magic_end (void) const { return (rhs && rhs->has_magic_end ()); } |
|
|
128 |
|
3933
|
129 bool is_assignment_expression (void) const { return true; } |
|
2980
|
130 |
|
3933
|
131 bool rvalue_ok (void) const { return true; } |
|
2980
|
132 |
|
|
133 octave_value rvalue (void); |
|
|
134 |
|
|
135 octave_value_list rvalue (int nargout); |
|
|
136 |
|
|
137 void eval_error (void); |
|
|
138 |
|
3523
|
139 std::string oper (void) const; |
|
3208
|
140 |
|
2980
|
141 tree_argument_list *left_hand_side (void) { return lhs; } |
|
|
142 |
|
|
143 tree_expression *right_hand_side (void) { return rhs; } |
|
|
144 |
|
|
145 void accept (tree_walker& tw); |
|
|
146 |
|
|
147 private: |
|
|
148 |
|
3208
|
149 // The left hand side of the assignment. |
|
2980
|
150 tree_argument_list *lhs; |
|
3208
|
151 |
|
|
152 // The right hand side of the assignment. |
|
2980
|
153 tree_expression *rhs; |
|
2988
|
154 |
|
3208
|
155 // True if we should not delete the lhs. |
|
|
156 bool preserve; |
|
|
157 |
|
|
158 // The type of the expression. |
|
|
159 octave_value::assign_op etype; |
|
|
160 |
|
2988
|
161 // No copying! |
|
|
162 |
|
2989
|
163 tree_multi_assignment (const tree_multi_assignment&); |
|
2988
|
164 |
|
2989
|
165 tree_multi_assignment& operator = (const tree_multi_assignment&); |
|
2980
|
166 }; |
|
|
167 |
|
|
168 #endif |
|
|
169 |
|
|
170 /* |
|
|
171 ;;; Local Variables: *** |
|
|
172 ;;; mode: C++ *** |
|
|
173 ;;; End: *** |
|
|
174 */ |
