192
193 public R visitSwitch(SwitchTree node, P p) {
194 R r = scan(node.getExpression(), p);
195 r = scanAndReduce(node.getCases(), p, r);
196 return r;
197 }
198
199 public R visitCase(CaseTree node, P p) {
200 R r = scan(node.getExpression(), p);
201 r = scanAndReduce(node.getStatements(), p, r);
202 return r;
203 }
204
205 public R visitSynchronized(SynchronizedTree node, P p) {
206 R r = scan(node.getExpression(), p);
207 r = scanAndReduce(node.getBlock(), p, r);
208 return r;
209 }
210
211 public R visitTry(TryTree node, P p) {
212 R r = scan(node.getBlock(), p);
213 r = scanAndReduce(node.getCatches(), p, r);
214 r = scanAndReduce(node.getFinallyBlock(), p, r);
215 return r;
216 }
217
218 public R visitCatch(CatchTree node, P p) {
219 R r = scan(node.getParameter(), p);
220 r = scanAndReduce(node.getBlock(), p, r);
221 return r;
222 }
223
224 public R visitConditionalExpression(ConditionalExpressionTree node, P p) {
225 R r = scan(node.getCondition(), p);
226 r = scanAndReduce(node.getTrueExpression(), p, r);
227 r = scanAndReduce(node.getFalseExpression(), p, r);
228 return r;
229 }
230
231 public R visitIf(IfTree node, P p) {
232 R r = scan(node.getCondition(), p);
|
192
193 public R visitSwitch(SwitchTree node, P p) {
194 R r = scan(node.getExpression(), p);
195 r = scanAndReduce(node.getCases(), p, r);
196 return r;
197 }
198
199 public R visitCase(CaseTree node, P p) {
200 R r = scan(node.getExpression(), p);
201 r = scanAndReduce(node.getStatements(), p, r);
202 return r;
203 }
204
205 public R visitSynchronized(SynchronizedTree node, P p) {
206 R r = scan(node.getExpression(), p);
207 r = scanAndReduce(node.getBlock(), p, r);
208 return r;
209 }
210
211 public R visitTry(TryTree node, P p) {
212 R r = scan(node.getResources(), p);
213 r = scanAndReduce(node.getBlock(), p, r);
214 r = scanAndReduce(node.getCatches(), p, r);
215 r = scanAndReduce(node.getFinallyBlock(), p, r);
216 return r;
217 }
218
219 public R visitCatch(CatchTree node, P p) {
220 R r = scan(node.getParameter(), p);
221 r = scanAndReduce(node.getBlock(), p, r);
222 return r;
223 }
224
225 public R visitConditionalExpression(ConditionalExpressionTree node, P p) {
226 R r = scan(node.getCondition(), p);
227 r = scanAndReduce(node.getTrueExpression(), p, r);
228 r = scanAndReduce(node.getFalseExpression(), p, r);
229 return r;
230 }
231
232 public R visitIf(IfTree node, P p) {
233 R r = scan(node.getCondition(), p);
|