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

            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();
        }
        a6 = a6.dereference();
        if (a6.isStructure()){
            if (! s2.equals(((StructureTerm)a6).functor()))
                return engine.fail();
            Term[] args = ((StructureTerm)a6).args();
            a8 = args[0];
            a9 = args[1];
        } else if (a6.isVariable()){
            a8 = new VariableTerm(engine);
            a9 = new VariableTerm(engine);
            Term[] args = {a8, a9};
            ((VariableTerm) a6).bind(new StructureTerm(s2, args), engine.trail);
        } else {
            return engine.fail();
        }
        a3 = a3.dereference();
        if (a3.isList()){
            Term[] args = {((ListTerm)a3).car(), ((ListTerm)a3).cdr()};
            a10 = args[0];
            a11 = args[1];
        } else if (a3.isVariable()){
            a10 = new VariableTerm(engine);
            a11 = new VariableTerm(engine);
            ((VariableTerm) a3).bind(new ListTerm(a10, a11), engine.trail);
        } else {
            return engine.fail();
        }
        a10 = a10.dereference();
        if (a10.isStructure()){
            if (! s2.equals(((StructureTerm)a10).functor()))
                return engine.fail();
            Term[] args = ((StructureTerm)a10).args();
            if (! a8.unify(args[0], engine.trail))
                return engine.fail();
            if (! a9.unify(args[1], engine.trail))
                return engine.fail();
        } else if (a10.isVariable()){
            Term[] args = {a8, a9};
            ((VariableTerm) a10).bind(new StructureTerm(s2, args), engine.trail);
        } else {
            return engine.fail();
        }
        a4 = a4.dereference();
        if (a4.isList()){
            Term[] args = {((ListTerm)a4).car(), ((ListTerm)a4).cdr()};
            if (! a9.unify(args[0], engine.trail))
                return engine.fail();
            a12 = args[1];
        } else if (a4.isVariable()){
            a12 = new VariableTerm(engine);
            ((VariableTerm) a4).bind(new ListTerm(a9, a12), engine.trail);
        } else {
            return engine.fail();
        }
        a13 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(13))

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();
        }
        a5 = a5.dereference();
        if (a5.isList()){
            Term[] args = {((ListTerm)a5).car(), ((ListTerm)a5).cdr()};
            if (! a6.unify(args[0], engine.trail))
                return engine.fail();
            a8 = args[1];
        } else if (a5.isVariable()){
            a8 = new VariableTerm(engine);
            ((VariableTerm) a5).bind(new ListTerm(a6, a8), engine.trail);
        } else {
            return engine.fail();
        }
        engine.aregs[1] = a7;
        engine.aregs[2] = a2;

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();
        }
        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
        a5 = new ListTerm(a2, s1);
        //START inline expansion of $unify(a(5),s(3))
        if (! a5.unify(s3, engine.trail)) {
            return engine.fail();
        }
        //END inline expansion

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_$parse_tokens_write_string_1(a3, cont);
        return new PRED_put_code_1(a2, p1);

View Full Code Here

        a8 = new StructureTerm(s5, y1);
        a9 = new VariableTerm(engine);
        a10 = new VariableTerm(engine);
        a11 = new VariableTerm(engine);
        a12 = new VariableTerm(engine);
        a13 = new ListTerm(a7, a12);
        p1 = new PRED_$univ_2(a2, a13, cont);
        p2 = new PRED_$parse_tokens_args_3(a12, a11, a5, p1);
        p3 = new PRED_$parse_tokens_skip_spaces_2(a10, a11, p2);
        p4 = new PRED_$cut_1(a6, p3);
        p5 = new PRED_C_3(a9, s12, a10, p4);

View Full Code Here

        a1 = engine.aregs[1];
        a2 = engine.aregs[2];
        a3 = engine.aregs[3];
        cont = engine.cont;
    // '$parse_tokens_expect'(A,B,C):-['$parse_tokens_error'([A,expected],B,C)]
        a4 = new ListTerm(a1, s3);
        return new PRED_$parse_tokens_error_3(a4, a2, a3, cont);
    }

View Full Code Here

        a1 = engine.aregs[1];
        a2 = engine.aregs[2];
        a3 = engine.aregs[3];
        cont = engine.cont;
    // '$dummy_33_builtins.pl'(A,B,C):-['$unify'(C,[B|A])]
        a4 = new ListTerm(a2, a1);
        //START inline expansion of $unify(a(3),a(4))
        if (! a3.unify(a4, engine.trail)) {
            return engine.fail();
        }
        //END inline expansion

View Full Code Here

        //START inline expansion of $get_level(a(3))
        if (! a3.unify(new IntegerTerm(engine.B0), engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
        a4 = new ListTerm(new VariableTerm(engine), new VariableTerm(engine));
        //START inline expansion of $unify(a(1),a(4))
        if (! a1.unify(a4, engine.trail)) {
            return engine.fail();
        }
        //END inline expansion

View Full Code Here

        a1 = engine.aregs[1];
        a2 = engine.aregs[2];
        a3 = engine.aregs[3];
        cont = engine.cont;
    // '$dummy_28_builtins.pl'(A,B,C):-['$unify'(A,[B|C])]
        a4 = new ListTerm(a2, a3);
        //START inline expansion of $unify(a(1),a(4))
        if (! a1.unify(a4, engine.trail)) {
            return engine.fail();
        }
        //END inline expansion

View Full Code Here

            a4 = args[0];
            if (! s1.unify(args[1], engine.trail))
                return engine.fail();
        } else if (a1.isVariable()){
            a4 = new VariableTerm(engine);
            ((VariableTerm) a1).bind(new ListTerm(a4, s1), engine.trail);
        } else {
            return engine.fail();
        }
        a4 = a4.dereference();
        if (a4.isStructure()){

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.