Package jp.ac.kobe_u.cs.prolog.lang

Examples of jp.ac.kobe_u.cs.prolog.lang.ListTerm

250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
            a3 = args[0];
            a4 = args[1];
        } else if (a1.isVariable()){
            a3 = new VariableTerm(engine);
            a4 = new VariableTerm(engine);
            ((VariableTerm) a1).bind(new ListTerm(a3, a4), engine.trail);
        } else {
            return engine.fail();
        }
        //START inline expansion of $neck_cut
        engine.neckCut();
        //END inline expansion
        a5 = new ListTerm(a3, a4);
        return new PRED_consult_1(a5, cont);
    }
View Full Code Here
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
        a9 = new StructureTerm(s4, y1);
        Term[] y2 = {s3, a9};
        a10 = new StructureTerm(s2, y2);
        Term[] y3 = {a3, a2};
        a11 = new StructureTerm(s2, y3);
        a12 = new ListTerm(a11, s7);
        a13 = new ListTerm(s6, a12);
        a14 = new ListTerm(a1, a13);
        a15 = new ListTerm(a5, a14);
        a16 = new ListTerm(s5, a15);
        Term[] y4 = {a6, a7};
        a17 = new StructureTerm(s1, y4);
        Term[] y5 = {a1, a2, a3, a17, a5};
        a18 = new StructureTerm(s8, y5);
        p1 = new PRED_$read_blocked_1(a18, cont);
View Full Code Here
48
49
50
51
52
53
54
55
56
57
58
        a2 = arg2;
        a3 = arg3;
    // '$parse_tokens_peep_next'(A,B,B):-['$unify'(B,[A|C])]
        if (! a2.unify(a3, engine.trail))
            return engine.fail();
        a4 = new ListTerm(a1, new VariableTerm(engine));
        //START inline expansion of $unify(a(2),a(4))
        if (! a2.unify(a4, engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
        if (a2.isList()){
            Term[] args = {((ListTerm)a2).car(), ((ListTerm)a2).cdr()};
            if (! a1.unify(args[0], engine.trail))
                return engine.fail();
        } else if (a2.isVariable()){
            ((VariableTerm) a2).bind(new ListTerm(a1, new VariableTerm(engine)), engine.trail);
        } else {
            return engine.fail();
        }
        return cont;
    }
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
        if (a2.isList()){
            Term[] args = {((ListTerm)a2).car(), ((ListTerm)a2).cdr()};
            a3 = args[1];
        } else if (a2.isVariable()){
            a3 = new VariableTerm(engine);
            ((VariableTerm) a2).bind(new ListTerm(new VariableTerm(engine), a3), engine.trail);
        } else {
            return engine.fail();
        }
        engine.aregs[1] = a1;
        engine.aregs[2] = a3;
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
            a4 = args[0];
            a5 = args[1];
        } else if (a1.isVariable()){
            a4 = new VariableTerm(engine);
            a5 = new VariableTerm(engine);
            ((VariableTerm) a1).bind(new ListTerm(a4, a5), engine.trail);
        } else {
            return engine.fail();
        }
        p1 = new PRED_$add_operators_3(a5, a2, a3, cont);
        return new PRED_$add_op_3(a4, a2, a3, p1);
View Full Code Here
119
120
121
122
123
124
125
126
        //START inline expansion of $unify(a(5),a(2))
        if (! a5.unify(a2, engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
        a11 = new ListTerm(a1, a9);
        return new PRED_$merge_5(a3, a11, a6, a4, a8, cont);
    }
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
            a4 = args[0];
            a5 = args[1];
        } else if (a1.isVariable()){
            a4 = new VariableTerm(engine);
            a5 = new VariableTerm(engine);
            ((VariableTerm) a1).bind(new ListTerm(a4, a5), engine.trail);
        } else {
            return engine.fail();
        }
        p1 = new PRED_$hash_addz_all_3(a5, a2, a3, cont);
        return new PRED_$hash_addz_3(a2, a4, a3, p1);
View Full Code Here
49
50
51
52
53
54
55
56
57
58
59
60
61
62
        a2 = arg2;
        a3 = arg3;
    // java_declared_method(A,B,C):-['$univ'(B,[D|E]),builtin_java_convert_args(E,F),'$univ'(G,[D|F]),java_declared_method0(A,G,H),java_conversion(I,H),'$unify'(C,I)]
        a4 = new VariableTerm(engine);
        a5 = new VariableTerm(engine);
        a6 = new ListTerm(a4, a5);
        a7 = new VariableTerm(engine);
        a8 = new VariableTerm(engine);
        a9 = new ListTerm(a4, a7);
        a10 = new VariableTerm(engine);
        a11 = new VariableTerm(engine);
        p1 = new PRED_$unify_2(a3, a11, cont);
        p2 = new PRED_java_conversion_2(a11, a10, p1);
        p3 = new PRED_java_declared_method0_3(a1, a8, a10, p2);
View Full Code Here
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
            a4 = args[0];
            a5 = args[1];
        } else if (a1.isVariable()){
            a4 = new VariableTerm(engine);
            a5 = new VariableTerm(engine);
            ((VariableTerm) a1).bind(new ListTerm(a4, a5), engine.trail);
        } else {
            return engine.fail();
        }
        a2 = a2.dereference();
        if (a2.isList()){
            Term[] args = {((ListTerm)a2).car(), ((ListTerm)a2).cdr()};
            a6 = args[0];
            a7 = args[1];
        } else if (a2.isVariable()){
            a6 = new VariableTerm(engine);
            a7 = new VariableTerm(engine);
            ((VariableTerm) a2).bind(new ListTerm(a6, a7), engine.trail);
        } else {
            return engine.fail();
        }
        a6 = a6.dereference();
        if (a6.isStructure()){
View Full Code Here
TOP

Related Classes of jp.ac.kobe_u.cs.prolog.lang.ListTerm

  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$add_operators_3_2
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$builtin_member_2_1
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$builtin_member_2_2
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$clause_internal0_3_2
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dcg_translate_dcg_5_4
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dummy_33_builtins$002Epl_3_2
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dummy_4_builtins$002Epl_9_1
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$hash_adda_all_3_2
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$hash_addz_all_3_2
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$mem_pair_2_1
    • 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.