Package tree

Examples of tree.HaxeTree

12
13
14
15
16
17
18
19
public class IfNodeTests
{
    @Test
    public void parseSimpleIfWithBlock() throws RecognitionException {
        HaxeTree tree = parseStatement("if(true){ doSmth(); }");
        assertTrue(tree instanceof IfNode);
    }
View Full Code Here
18
19
20
21
22
23
24
25
        assertTrue(tree instanceof IfNode);
    }
   
    @Test
    public void parseSimpleIFWithBlockAndExprInIf() throws RecognitionException {
        HaxeTree tree = parseStatement("if(a==b){ doSmth(); }");
        assertTrue(tree instanceof IfNode);
    }
View Full Code Here
42
43
44
45
46
47
48
49
50
51
52
    Linker linker = new Linker();
   
    @Test
    public void testIntToFloatInReturnNode() throws RecognitionException
    {
        HaxeTree tree = parseModule("class A { function main():Int { return 123.1;}}");
        linker.visit(tree, new Environment());
       
        Return returnNode = getReturnNode(tree);
        HaxeType type = returnNode.getHaxeType();
        Function function = returnNode.getFunction();   
View Full Code Here
56
57
58
59
60
61
62
63
64
65
66
    }
   
    @Test
    public void testFloatToIntInReturnNode() throws RecognitionException
    {
        HaxeTree tree = parseModule("class A { function main():Float { return 123;}}");
        linker.visit(tree, new Environment());
       
        Return returnNode = getReturnNode(tree);
        HaxeType type = returnNode.getHaxeType();
        Function function = returnNode.getFunction();
View Full Code Here
15
16
17
18
19
20
21
22
23
24
{

    @Test
    public void testIntToFloat() throws RecognitionException
    {
        HaxeTree tree = parseFunction("function main(x:Int, y:Float) {}");
       
        ArrayList<Declaration> firstType = ((Function)tree).getParametersAsDeclarations();
        assertTrue(firstType.size() == 2);
    }
View Full Code Here
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
                && node.isDeclaredWithoutType())
        {
            ErrorPublisher.commitClassUndefinedTypeError(node);
        }
       
        HaxeTree initialization = node.getInitializationNode();
        if (initialization == null)
        {
            return;
        }
        HaxeType type = node.getHaxeType();
        HaxeType initType = initialization.getHaxeType(true);
        if (type == null || initType == null)
        {
            return;
        }
        if (!TypeUtils.isAvailableAssignement(type, initType))
View Full Code Here
138
139
140
141
142
143
144
145
146
147
148
        for (HaxeTree child : params)
        {
            visit(child, data);
        }
       
        HaxeTree declaration = node.getDeclarationNode();
        if (declaration == null)
        {
            data = node;
            ErrorPublisher.commitUninitializedUsingError(node);
        }
View Full Code Here
164
165
166
167
168
169
170
171
172
173
174
            {
                ErrorPublisher.commitCastError(child, TypeUtils.getInt());
            }
        }
       
        HaxeTree declaration = node.getDeclarationNode();
        if (declaration == null)
        {
            data = node;
            node.commitError("Undeclared Slice");
            return;
View Full Code Here
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
    }

    @Override
    protected void visit(final Assignment node, Object data)
    {
        HaxeTree rightOperand = node.getRightOperand();
       
        if (node.isUndefinedType())
        {
            visit(rightOperand, data);
        }
        else if (!TypeUtils.isAvailableAssignement(
                node.getHaxeType(),
                rightOperand.getHaxeType(true)))
        {
            data = node;
            ErrorPublisher.commitInvalidAssignError(node);
            return;
        }
View Full Code Here
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
        if (!node.isUndefinedType(true))
        {
            return;
        }
       
        HaxeTree leftOperand = node.getLeftOperand();
        HaxeTree rightOperand = node.getRightOperand();
       
        if (!leftOperand.isUndefinedType(true)
                && !rightOperand.isUndefinedType(true))
        {
            data = node;
            ErrorPublisher.commitCastError(
                    rightOperand,
                    leftOperand.getHaxeType());
            return;
        }
       
        if (leftOperand.isUndefinedType(true))
        {
            visit(leftOperand, data);           
        }       
        if (rightOperand.isUndefinedType(true))
        {
            visit(rightOperand, data);
        }
    }
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.