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

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

List.
The class ListTerm represents a list structure.

 % [1,2] Term Nil = SymbolTerm.makeSymbol("[]"); Term  n1 = IntegerTerm(1); Term  n2 = IntegerTerm(2); Term   t = new ListTerm(n1, new ListTerm(n2, Nil)); Term car = ((ListTerm)t).car(); Term cdr = ((ListTerm)t).cdr();

Here is sample program for creating a list from 1 to n.

 public static Term makeList(int n) { Term t = SymbolTerm.makeSymbol("[]"); for (int i = n; i > 0; i--) { t = new ListTerm(new IntegerTerm(i), t); } return t; }

@author Mutsunori Banbara (banbara@kobe-u.ac.jp) @author Naoyuki Tamura (tamura@kobe-u.ac.jp) @version 1.0

            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();
        }
        a2 = a2.dereference();
        if (a2.isList()){
            Term[] args = {((ListTerm)a2).car(), ((ListTerm)a2).cdr()};
            if (! a3.unify(args[0], engine.trail))
                return engine.fail();
            a5 = args[1];
        } else if (a2.isVariable()){
            a5 = new VariableTerm(engine);
            ((VariableTerm) a2).bind(new ListTerm(a3, a5), engine.trail);
        } else {
            return engine.fail();
        }
        a6 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(6))

View Full Code Here

            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();
        }
        if (! a4.unify(a2, engine.trail))
            return engine.fail();

View Full Code Here

        //END inline expansion
        a5 = new VariableTerm(engine);
        a6 = new VariableTerm(engine);
        a7 = new VariableTerm(engine);
        a8 = new VariableTerm(engine);
        a9 = new ListTerm(a5, a8);
        a10 = new VariableTerm(engine);
        a11 = new ListTerm(a5, a10);
        p1 = new PRED_$univ_2(a3, a11, cont);
        p2 = new PRED_$localize_args_4(a7, a8, a2, a10, p1);
        p3 = new PRED_$univ_2(a1, a9, p2);
        p4 = new PRED_$cut_1(a4, p3);
        p5 = new PRED_$builtin_meta_predicates_3(a5, a6, a7, p4);

View Full Code Here

        a1 = arg1;
        a2 = arg2;
    // java_constructor(A,B):-['$univ'(A,[C|D]),builtin_java_convert_args(D,E),'$univ'(F,[C|E]),java_constructor0(F,G),'$unify'(B,G)]
        a3 = new VariableTerm(engine);
        a4 = new VariableTerm(engine);
        a5 = new ListTerm(a3, a4);
        a6 = new VariableTerm(engine);
        a7 = new VariableTerm(engine);
        a8 = new ListTerm(a3, a6);
        a9 = new VariableTerm(engine);
        p1 = new PRED_$unify_2(a2, a9, cont);
        p2 = new PRED_java_constructor0_2(a7, a9, p1);
        p3 = new PRED_$univ_2(a7, a8, p2);
        p4 = new PRED_builtin_java_convert_args_2(a4, a6, p3);

View Full Code Here

            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();
        }
        //START inline expansion of $neck_cut
        engine.neckCut();

View Full Code Here

            a6 = args[0];
            if (! s1.unify(args[1], engine.trail))
                return engine.fail();
        } else if (a1.isVariable()){
            a6 = new VariableTerm(engine);
            ((VariableTerm) a1).bind(new ListTerm(a6, s1), engine.trail);
        } else {
            return engine.fail();
        }
        //START inline expansion of $neck_cut
        engine.neckCut();

View Full Code Here

            a6 = args[0];
            a7 = args[1];
        } else if (a1.isVariable()){
            a6 = new VariableTerm(engine);
            a7 = new VariableTerm(engine);
            ((VariableTerm) a1).bind(new ListTerm(a6, a7), engine.trail);
        } else {
            return engine.fail();
        }
        //START inline expansion of $neck_cut
        engine.neckCut();

View Full Code Here

        a5 = engine.aregs[5];
        cont = engine.cont;
    // '$parse_tokens1'(A,B,C,D,E):-['$parse_tokens_peep_next'(F,D,G),'$parse_tokens_error'([F,cannot,start,an,expression],G,E)]
        a6 = new VariableTerm(engine);
        a7 = new VariableTerm(engine);
        a8 = new ListTerm(a6, s9);
        p1 = new PRED_$parse_tokens_error_3(a8, a7, a5, cont);
        return new PRED_$parse_tokens_peep_next_3(a6, a4, a7, p1);
    }

View Full Code Here

            a5 = args[0];
            if (! s1.unify(args[1], engine.trail))
                return engine.fail();
        } else if (a1.isVariable()){
            a5 = new VariableTerm(engine);
            ((VariableTerm) a1).bind(new ListTerm(a5, s1), engine.trail);
        } else {
            return engine.fail();
        }
        a2 = a2.dereference();
        if (a2.isList()){
            Term[] args = {((ListTerm)a2).car(), ((ListTerm)a2).cdr()};
            if (! a5.unify(args[0], engine.trail))
                return engine.fail();
            if (! s1.unify(args[1], engine.trail))
                return engine.fail();
        } else if (a2.isVariable()){
            ((VariableTerm) a2).bind(new ListTerm(a5, s1), engine.trail);
        } else {
            return engine.fail();
        }
        return cont;
    }

View Full Code Here

            a5 = args[0];
            a6 = args[1];
        } else if (a1.isVariable()){
            a5 = new VariableTerm(engine);
            a6 = new VariableTerm(engine);
            ((VariableTerm) a1).bind(new ListTerm(a5, a6), engine.trail);
        } else {
            return engine.fail();
        }
        a6 = a6.dereference();
        if (a6.isList()){
            Term[] args = {((ListTerm)a6).car(), ((ListTerm)a6).cdr()};
            a7 = args[0];
            a8 = args[1];
        } else if (a6.isVariable()){
            a7 = new VariableTerm(engine);
            a8 = new VariableTerm(engine);
            ((VariableTerm) a6).bind(new ListTerm(a7, a8), engine.trail);
        } else {
            return engine.fail();
        }
        a9 = new ListTerm(a7, a8);
        a10 = new VariableTerm(engine);
        a11 = new VariableTerm(engine);
        a12 = new ListTerm(a5, a10);
        a13 = new VariableTerm(engine);
        a14 = new VariableTerm(engine);
        p1 = new PRED_$merge_5(a13, a14, a2, a3, a4, cont);
        p2 = new PRED_$sort_4(a11, a14, a3, a4, p1);
        p3 = new PRED_$sort_4(a12, a13, a3, a4, p2);

View Full Code Here

0 1 2 3 4 5 6 7 8 9

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

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.