Package org.jpox.query.node

Examples of org.jpox.query.node.Node

829
830
831
832
833
834
835
836
        else
        {
            return false;
        }

        stack.push(new Node(Node.LITERAL, litValue));
        return true;
    }
View Full Code Here
845
846
847
848
849
850
851
852
853
        String id = p.parseIdentifier();
        if (id == null)
        {
            return false;
        }
        Node expr = new Node(Node.IDENTIFIER, id);
        stack.push(expr);
        return true;
    }
View Full Code Here
214
215
216
217
218
219
220
221
222
223
224
    {
        if (having == null)
        {
            return null;
        }
        Node node = parser.compile(having);
        ExpressionCompiler comp = new ExpressionCompiler();
        comp.setSymbolTable(symtbl);
        Expression expr = comp.compileExpression(node);
        // expr.bind();
        return expr;
View Full Code Here
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
        }
        if (!found)
        {
            throw new QueryCompilerSyntaxException("Expected keyword SELECT", p.getIndex(), p.getInput(), new String[]{"SELECT"});
        }
        Node select = new Node(Node.OPERATOR, "select");

        boolean unique = p.parseString("UNIQUE");
        if (!unique)
        {
            unique = p.parseString("unique");
        }
        if (unique)
        {
            select.appendChildNode(new Node(Node.OPERATOR, "unique"));
        }

        Node[] result = compileTupple(p);
        if (result.length > 0)
        {
            select.appendChildNode(result);
        }
        boolean into = p.parseString("INTO");
        if (!into)
        {
            into = p.parseString("into");
        }
        if (into)
        {
            Node node = new Node(Node.OPERATOR, "into");
            select.appendChildNode(node);
            Node intoExpr = compileExpression();
            node.appendChildNode(intoExpr);
        }

        boolean from = p.parseString("FROM");
        if (!from)
        {
            from = p.parseString("from");
        }
        if (from)
        {
            Node fromExpr = compileExpression();
            Node node = new Node(Node.OPERATOR, "from");
            select.appendChildNode(node);
            node.appendChildNode(fromExpr);
        }

        boolean where = p.parseString("WHERE");
        if (!where)
        {
            where = p.parseString("where");
        }
        if (where)
        {
            Node whereExpr = compileExpression();
            Node node = new Node(Node.OPERATOR, "where");
            select.appendChildNode(node);
            node.appendChildNode(whereExpr);
        }

        boolean variables = p.parseString("VARIABLES");
        if (!variables)
        {
            variables = p.parseString("variables");
        }
        if (variables)
        {
            Node[][] variablesExpr = compileVariables(p);
            Node node = new Node(Node.OPERATOR, "variables");
            select.appendChildNode(node);
            node.appendChildNode(variablesExpr);
        }

        boolean parameters = p.parseString("PARAMETERS");
        if (!parameters)
        {
            parameters = p.parseString("parameters");
        }
        if (parameters)
        {
            Node[][] parametersExpr = compileParameters(p);
            Node node = new Node(Node.OPERATOR, "parameters");
            select.appendChildNode(node);
            node.appendChildNode(parametersExpr);
        }

        List imports = new ArrayList();
        while (p.parseString("import"))
        {
View Full Code Here
201
202
203
204
205
206
207
208
209
210
        }
        if (!compileIdentifier())
        {
            throw new QueryCompilerSyntaxException("expected identifier", p.getIndex(), p.getInput());
        }
        Node nodeVariable = (Node) stack.pop();
        Node nodeType = (Node) stack.pop();
        nodeType.appendChildNode(nodeVariable);
        return nodeType;
    }
View Full Code Here
232
233
234
235
236
237
238
239
240
241
242
        stack = new Stack();
        List nodes = new ArrayList();
        do
        {
            compileExpression();
            Node expr = (Node) stack.pop();
            nodes.add(expr);
        }
        while (p.parseString(","));
        return (Node[])nodes.toArray(new Node[nodes.size()]);
    }
View Full Code Here
253
254
255
256
257
258
259
260
261
262
263
264
            }
            if (!compileIdentifier())
            {
                throw new QueryCompilerSyntaxException("expected identifier", p.getIndex(), p.getInput());
            }
            Node nodeVariable = (Node) stack.pop();
            Node nodeType = (Node) stack.pop();
            nodes.add(new Node[]{nodeType, nodeVariable});
        }
        while (p.parseString(";"));
        return (Node[][]) nodes.toArray(new Node[nodes.size()][2]);
    }
View Full Code Here
277
278
279
280
281
282
283
284
285
286
287
288
            }
            if (!compileIdentifier())
            {
                throw new QueryCompilerSyntaxException("expected identifier", p.getIndex(), p.getInput());
            }
            Node nodeVariable = (Node) stack.pop();
            Node nodeType = (Node) stack.pop();
            nodes.add(new Node[]{nodeType, nodeVariable});
        }
        while (p.parseString(";"));
        return (Node[][]) nodes.toArray(new Node[nodes.size()][2]);
    }
View Full Code Here
299
300
301
302
303
304
305
306
307
308
309
310
            }
            if (!compileIdentifier())
            {
                throw new QueryCompilerSyntaxException("expected identifier", p.getIndex(), p.getInput());
            }
            Node nodeVariable = (Node) stack.pop();
            Node nodeType = (Node) stack.pop();
            nodes.add(new Node[]{nodeType, nodeVariable});
        }
        while (p.parseString(","));
        return (Node[][]) nodes.toArray(new Node[nodes.size()][2]);
    }
View Full Code Here
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
        do
        {
            compileExpression();
            if (p.parseString("asc") || p.parseString("ascending"))
            {
                Node expr = new Node(Node.OPERATOR, "ascending");
                stack.push(expr);
            }
            else if (p.parseString("desc") || p.parseString("descending"))
            {
                Node expr = new Node(Node.OPERATOR, "descending");
                stack.push(expr);
            }
            Node expr = new Node(Node.OPERATOR, "order");
            expr.insertChildNode((Node) stack.pop());
            if (!stack.empty())
            {
                expr.insertChildNode((Node) stack.pop());
            }
            nodes.add(expr);
        }
        while (p.parseString(","));
        return (Node[]) nodes.toArray(new Node[nodes.size()]);
View Full Code Here
TOP

Related Classes of org.jpox.query.node.Node

  • org.jpox.query.compiler.Compiler
  • org.jpox.query.compiler.JDOQLParser
  • org.jpox.query.expression.ExpressionCompiler
    • 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.