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

        if (a1.isList()){
            Term[] args = {((ListTerm)a1).car(), ((ListTerm)a1).cdr()};
            a5 = args[1];
        } else if (a1.isVariable()){
            a5 = new VariableTerm(engine);
            ((VariableTerm) a1).bind(new ListTerm(new VariableTerm(engine), a5), engine.trail);
        } else {
            return engine.fail();
        }
        a5 = a5.dereference();
        if (a5.isList()){
            Term[] args = {((ListTerm)a5).car(), ((ListTerm)a5).cdr()};
            a6 = args[1];
        } else if (a5.isVariable()){
            a6 = new VariableTerm(engine);
            ((VariableTerm) a5).bind(new ListTerm(new VariableTerm(engine), a6), engine.trail);
        } else {
            return engine.fail();
        }
        a2 = a2.dereference();
        if (a2.isList()){
            Term[] args = {((ListTerm)a2).car(), ((ListTerm)a2).cdr()};
            a7 = args[0];
            a8 = args[1];
        } else if (a2.isVariable()){
            a7 = new VariableTerm(engine);
            a8 = new VariableTerm(engine);
            ((VariableTerm) a2).bind(new ListTerm(a7, a8), engine.trail);
        } else {
            return engine.fail();
        }
        a3 = a3.dereference();
        if (a3.isList()){
            Term[] args = {((ListTerm)a3).car(), ((ListTerm)a3).cdr()};
            if (! a7.unify(args[0], engine.trail))
                return engine.fail();
            a9 = args[1];
        } else if (a3.isVariable()){
            a9 = new VariableTerm(engine);
            ((VariableTerm) a3).bind(new ListTerm(a7, a9), engine.trail);
        } else {
            return engine.fail();
        }
        //START inline expansion of $neck_cut
        engine.neckCut();

View Full Code Here

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

View Full Code Here

            a2 = args[0];
            a3 = args[1];
        } else if (a1.isVariable()){
            a2 = new VariableTerm(engine);
            a3 = new VariableTerm(engine);
            ((VariableTerm) a1).bind(new ListTerm(a2, a3), engine.trail);
        } else {
            return engine.fail();
        }
        p1 = new PRED_$builtin_message_1(a3, cont);
        p2 = new PRED_$fast_write_1(s2, p1);

View Full Code Here

        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

        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

            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();
        }
        a6 = new VariableTerm(engine);
        a7 = new VariableTerm(engine);

View Full Code Here

            if (! a1.unify(args[0], engine.trail))
                return engine.fail();
            if (! a2.unify(args[1], engine.trail))
                return engine.fail();
        } else if (a3.isVariable()){
            ((VariableTerm) a3).bind(new ListTerm(a1, a2), engine.trail);
        } else {
            return engine.fail();
        }
        a4 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(4))

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

View Full Code Here

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

View Full Code Here

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

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.