Package tree

Examples of tree.HaxeTree

169
170
171
172
173
174
175
176
        assertTrue(tree instanceof Binary);
    }
   
    @Test
    public void testBinOpIter() throws RecognitionException {
        HaxeTree tree = parseExpression("x...y");
        assertTrue(tree instanceof Binary);
    }
View Full Code Here
180
181
182
183
184
185
186
187
188
189
190
191
    //
   
    // With Parenthesis
    @Test
    public void testBinOpWithParenthesis() throws RecognitionException {
        HaxeTree tree = parseExpression("z*(x*y)");
        assertTrue(tree instanceof Binary);
        assertTrue(tree.getChildCount() == 2);
        Binary binaryNode = (Binary)tree;
        assertTrue(binaryNode.getLeftOperand() instanceof Usage);
        assertTrue(binaryNode.getRightOperand() instanceof Binary);
    }
View Full Code Here
191
192
193
194
195
196
197
198
199
200
    }
   
    // Priority without parenthesis
    @Test
    public void testBinOpPriority1() throws RecognitionException {
        HaxeTree tree = parseExpression("z || x && y");
        Binary binaryNode = (Binary)tree;
        assertTrue(binaryNode.getLeftOperand() instanceof Usage);
        assertTrue(binaryNode.getRightOperand() instanceof Binary);
    }
View Full Code Here
199
200
201
202
203
204
205
206
207
208
        assertTrue(binaryNode.getRightOperand() instanceof Binary);
    }
   
    @Test
    public void testBinOpPriority2() throws RecognitionException {
        HaxeTree tree = parseExpression("z && x != y");
        Binary binaryNode = (Binary)tree;
        assertTrue(binaryNode.getLeftOperand() instanceof Usage);
        assertTrue(binaryNode.getRightOperand() instanceof Binary);
    }
View Full Code Here
207
208
209
210
211
212
213
214
215
216
        assertTrue(binaryNode.getRightOperand() instanceof Binary);
    }
   
    @Test
    public void testBinOpPriority3() throws RecognitionException {
        HaxeTree tree = parseExpression("z <= x|y");
        Binary binaryNode = (Binary)tree;
        assertTrue(binaryNode.getLeftOperand() instanceof Usage);
        assertTrue(binaryNode.getRightOperand() instanceof Binary);
    }
View Full Code Here
215
216
217
218
219
220
221
222
223
224
        assertTrue(binaryNode.getRightOperand() instanceof Binary);
    }
   
    @Test
    public void testBinOpPriority8() throws RecognitionException {
        HaxeTree tree = parseExpression("z ... x >= y");
        Binary binaryNode = (Binary)tree;
        assertTrue(binaryNode.getLeftOperand() instanceof Usage);
        assertTrue(binaryNode.getRightOperand() instanceof Binary);
    }
View Full Code Here
223
224
225
226
227
228
229
230
231
232
        assertTrue(binaryNode.getRightOperand() instanceof Binary);
    }
   
    @Test
    public void testBinOpPriority4() throws RecognitionException {
        HaxeTree tree = parseExpression("z | x << y");
        Binary binaryNode = (Binary)tree;
        assertTrue(binaryNode.getLeftOperand() instanceof Usage);
        assertTrue(binaryNode.getRightOperand() instanceof Binary);
    }
View Full Code Here
231
232
233
234
235
236
237
238
239
240
        assertTrue(binaryNode.getRightOperand() instanceof Binary);
    }
   
    @Test
    public void testBinOpPriority5() throws RecognitionException {
        HaxeTree tree = parseExpression("z << x + y");
        Binary binaryNode = (Binary)tree;
        assertTrue(binaryNode.getLeftOperand() instanceof Usage);
        assertTrue(binaryNode.getRightOperand() instanceof Binary);
    }
View Full Code Here
239
240
241
242
243
244
245
246
247
248
        assertTrue(binaryNode.getRightOperand() instanceof Binary);
    }
   
    @Test
    public void testBinOpPriority6() throws RecognitionException {
        HaxeTree tree = parseExpression("z << x + y");
        Binary binaryNode = (Binary)tree;
        assertTrue(binaryNode.getLeftOperand() instanceof Usage);
        assertTrue(binaryNode.getRightOperand() instanceof Binary);
    }
View Full Code Here
247
248
249
250
251
252
253
254
255
256
        assertTrue(binaryNode.getRightOperand() instanceof Binary);
    }
   
    @Test
    public void testBinOpPriority7() throws RecognitionException {
        HaxeTree tree = parseExpression("z - x * y");
        Binary binaryNode = (Binary)tree;
        assertTrue(binaryNode.getLeftOperand() instanceof Usage);
        assertTrue(binaryNode.getRightOperand() instanceof Binary);
    }
View Full Code Here
TOP

Related Classes of tree.HaxeTree

  • imp.parser.antlr.HaxeParser
  • imp.parser.HaxeParseController
  • imp.utils.ContentProposer
  • imp.utils.HoverHelper
  • imp.utils.outline.AbstractLabelProvider
  • imp.utils.outline.OutlineBuilder
  • imp.utils.outline.OutlineLabelProvider
  • org.antlr.runtime.CommonToken
  • tests.AssignOperation
  • tests.BinaryOperationTests
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.