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

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

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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
        a5 = engine.aregs[5];
        a6 = engine.aregs[6];
        a7 = engine.aregs[7];
        cont = engine.cont;
    // '$parse_tokens_post_in_ops'(A,B,C,D,E,F,G):-['$parse_tokens_skip_spaces'(F,H),'C'(H,I,J),'$parse_tokens_op'(I,A,B,C,K,L,J,M),'$parse_tokens_post_in_ops'(A,K,L,D,E,M,G)]
        a8 = new VariableTerm(engine);
        a9 = new VariableTerm(engine);
        a10 = new VariableTerm(engine);
        a11 = new VariableTerm(engine);
        a12 = new VariableTerm(engine);
        a13 = new VariableTerm(engine);
        p1 = new PRED_$parse_tokens_post_in_ops_7(a1, a11, a12, a4, a5, a13, a7, cont);
        p2 = new PRED_$parse_tokens_op_8(a9, a1, a2, a3, a11, a12, a10, a13, p1);
        p3 = new PRED_C_3(a8, a9, a10, p2);
        return new PRED_$parse_tokens_skip_spaces_2(a6, a8, p3);
    }
View Full Code Here
182
183
184
185
186
187
188
189
190
191
192
        Predicate cont;
        a1 = engine.aregs[1];
        a2 = engine.aregs[2];
        cont = engine.cont;
    // '$process_order'(A,B):-['$get_level'(C),var(A),'$cut'(C),illarg(var,(?-A),1)]
        a3 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(3))
        if (! a3.unify(new IntegerTerm(engine.B0), 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
98
99
100
101
102
103
104
105
106
107
108
109
        a2 = a2.dereference();
        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
90
91
92
93
94
95
96
97
98
99
100
        Predicate cont;
        a1 = engine.aregs[1];
        a2 = engine.aregs[2];
        cont = engine.cont;
    // set_prolog_flag(A,B):-['$get_level'(C),var(A),'$cut'(C),illarg(var,set_prolog_flag(A,B),1)]
        a3 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(3))
        if (! a3.unify(new IntegerTerm(engine.B0), engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
View Full Code Here
125
126
127
128
129
130
131
132
133
134
135
        Predicate cont;
        a1 = engine.aregs[1];
        a2 = engine.aregs[2];
        cont = engine.cont;
    // set_prolog_flag(A,B):-['$get_level'(C),var(B),'$cut'(C),illarg(var,set_prolog_flag(A,B),2)]
        a3 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(3))
        if (! a3.unify(new IntegerTerm(engine.B0), engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
View Full Code Here
160
161
162
163
164
165
166
167
168
169
170
        Predicate cont;
        a1 = engine.aregs[1];
        a2 = engine.aregs[2];
        cont = engine.cont;
    // set_prolog_flag(A,B):-['$get_level'(C),atom(A),'$cut'(C),'$set_prolog_flag0'(A,B)]
        a3 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(3))
        if (! a3.unify(new IntegerTerm(engine.B0), engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
121
        if (a1.isList()){
            Term[] args = {((ListTerm)a1).car(), ((ListTerm)a1).cdr()};
            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);
View Full Code Here
95
96
97
98
99
100
101
102
103
104
105
        a7 = engine.aregs[7];
        a8 = engine.aregs[8];
        a9 = engine.aregs[9];
        cont = engine.cont;
    // '$dummy_4_builtins.pl'(A,B,C,D,E,F,G,H,I):-['$get_level'(J),'$unify'(G,<),'$cut'(J),'$unify'(E,B),'$merge'(C,[A|I],F,D,H)]
        a10 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(10))
        if (! a10.unify(new IntegerTerm(engine.B0), engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
View Full Code Here
TOP

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

  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$add_op_3_1
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$add_op_3_2
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$add_operators_3_2
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dcg_translate_dcg_5_11
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dcg_translate_dcg_5_12
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dcg_translate_dcg_5_9
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dummy_30_builtins$002Epl_6_1
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dummy_31_builtins$002Epl_5_1
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dummy_4_builtins$002Epl_9_1
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$hash_addz_all_3_2
    • 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.