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

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

49
50
51
52
53
54
55
56
57
58
59
        Predicate p1;
        a1 = arg1;
        a2 = arg2;
        a3 = arg3;
    // read_tokens(A,B,C):-['$get_level'(D),'$read_tokens'(A,B,C,[]),'$cut'(D)]
        a4 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(4))
        if (! a4.unify(new IntegerTerm(engine.B0), engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
View Full Code Here
40
41
42
43
44
45
46
47
48
        engine.setB0();
        Term a1, a2;
        Predicate p1;
        a1 = arg1;
    // skip(A):-[current_input(B),skip(B,A)]
        a2 = new VariableTerm(engine);
        p1 = new PRED_skip_2(a2, a1, cont);
        return new PRED_current_input_1(a2, p1);
    }
View Full Code Here
83
84
85
86
87
88
89
90
91
92
93
        a4 = engine.aregs[4];
        a5 = engine.aregs[5];
        a6 = engine.aregs[6];
        cont = engine.cont;
    // '$dummy_30_builtins.pl'(A,B,C,D,E,F):-['$get_level'(G),'$match_type'(D,A),'$cut'(G),'$unify'(E,domain_error(F,B,C,A))]
        a7 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(7))
        if (! a7.unify(new IntegerTerm(engine.B0), engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
View Full Code Here
43
44
45
46
47
48
49
50
51
        Term a1, a2, a3;
        Predicate p1;
        a1 = arg1;
        a2 = arg2;
    // write_term(A,B):-[current_output(C),write_term(C,A,B)]
        a3 = new VariableTerm(engine);
        p1 = new PRED_write_term_3(a3, a1, a2, cont);
        return new PRED_current_output_1(a3, p1);
    }
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_$hash_addz_all_3(a5, a2, a3, cont);
View Full Code Here
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
        Predicate p1, p2, p3, p4, p5;
        a1 = arg1;
        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);
        p4 = new PRED_$univ_2(a8, a9, p3);
        p5 = new PRED_builtin_java_convert_args_2(a5, a7, p4);
View Full Code Here
69
70
71
72
73
74
75
76
77
78
79
        Predicate cont;
        a1 = engine.aregs[1];
        a2 = engine.aregs[2];
        cont = engine.cont;
    // '$dummy_26_builtins.pl'(A,B):-['$get_level'(C),'$equality_of_term'(B,off),'$cut'(C),call(user:A)]
        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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
        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();
        }
        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()){
            if (! s2.equals(((StructureTerm)a6).functor()))
                return engine.fail();
            Term[] args = ((StructureTerm)a6).args();
            if (! a4.unify(args[0], engine.trail))
                return engine.fail();
            a8 = args[1];
        } else if (a6.isVariable()){
            a8 = new VariableTerm(engine);
            Term[] args = {a4, a8};
            ((VariableTerm) a6).bind(new StructureTerm(s2, args), engine.trail);
        } else {
            return engine.fail();
        }
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
        Predicate p1, p2, p3, p4;
        Predicate cont;
        a1 = engine.aregs[1];
        cont = engine.cont;
    // '$consult_init'(A):-[retractall('jp.ac.kobe_u.cs.prolog.builtin':'$consulted_file'(B)),retractall('jp.ac.kobe_u.cs.prolog.builtin':'$consulted_package'(C)),retract('jp.ac.kobe_u.cs.prolog.builtin':'$consulted_predicate'(D,E,A)),abolish(D:E),fail]
        Term[] y1 = {new VariableTerm(engine)};
        a2 = new StructureTerm(s3, y1);
        Term[] y2 = {s2, a2};
        a3 = new StructureTerm(s1, y2);
        Term[] y3 = {new VariableTerm(engine)};
        a4 = new StructureTerm(s4, y3);
        Term[] y4 = {s2, a4};
        a5 = new StructureTerm(s1, y4);
        a6 = new VariableTerm(engine);
        a7 = new VariableTerm(engine);
        Term[] y5 = {a6, a7, a1};
        a8 = new StructureTerm(s5, y5);
        Term[] y6 = {s2, a8};
        a9 = new StructureTerm(s1, y6);
        Term[] y7 = {a6, a7};
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
        a1 = arg1;
        a2 = arg2;
        a3 = arg3;
        a4 = arg4;
    // '$parse_tokens'(A,B,C,D):-['$get_level'(E),'$parse_tokens_skip_spaces'(C,F),'$parse_tokens1'(B,G,H,F,I),'$cut'(E),'$parse_tokens_skip_spaces'(I,J),'$parse_tokens2'(B,G,H,A,K,J,D),'$cut'(E)]
        a5 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(5))
        if (! a5.unify(new IntegerTerm(engine.B0), engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
        a6 = new VariableTerm(engine);
        a7 = new VariableTerm(engine);
        a8 = new VariableTerm(engine);
        a9 = new VariableTerm(engine);
        a10 = new VariableTerm(engine);
        p1 = new PRED_$cut_1(a5, cont);
        p2 = new PRED_$parse_tokens2_7(a2, a7, a8, a1, new VariableTerm(engine), a10, a4, p1);
        p3 = new PRED_$parse_tokens_skip_spaces_2(a9, a10, p2);
        p4 = new PRED_$cut_1(a5, p3);
        p5 = new PRED_$parse_tokens1_5(a2, a7, a8, a6, a9, p4);
        return new PRED_$parse_tokens_skip_spaces_2(a3, a6, p5);
    }
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.