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

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

232
233
234
235
236
237
238
239
240
241
242
        } else {
            return engine.fail();
        }
        a6 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(6))
        if (! a6.unify(new IntegerTerm(engine.B0), engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
        p1 = new PRED_$cut_1(a6, cont);
        return new PRED_C_3(a4, s2, a5, p1);
View Full Code Here
265
266
267
268
269
270
271
272
273
274
275
        } else {
            return engine.fail();
        }
        a6 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(6))
        if (! a6.unify(new IntegerTerm(engine.B0), engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
        Term[] y1 = {a2};
        a7 = new StructureTerm(s4, y1);
View Full Code Here
300
301
302
303
304
305
306
307
308
309
310
        } else {
            return engine.fail();
        }
        a6 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(6))
        if (! a6.unify(new IntegerTerm(engine.B0), engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
        a7 = new VariableTerm(engine);
        a8 = new VariableTerm(engine);
View Full Code Here
339
340
341
342
343
344
345
346
347
348
349
        } else {
            return engine.fail();
        }
        a6 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(6))
        if (! a6.unify(new IntegerTerm(engine.B0), engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
        Term[] y1 = {new VariableTerm(engine), a2};
        a7 = new StructureTerm(s10, y1);
View Full Code Here
374
375
376
377
378
379
380
381
382
383
384
        } else {
            return engine.fail();
        }
        a6 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(6))
        if (! a6.unify(new IntegerTerm(engine.B0), engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
        Term[] y1 = {a2};
        a7 = new StructureTerm(s11, y1);
View Full Code Here
409
410
411
412
413
414
415
416
417
418
419
        } else {
            return engine.fail();
        }
        a6 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(6))
        if (! a6.unify(new IntegerTerm(engine.B0), engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
        a7 = new VariableTerm(engine);
        a8 = new VariableTerm(engine);
View Full Code Here
446
447
448
449
450
451
452
453
454
455
456
        } else {
            return engine.fail();
        }
        a6 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(6))
        if (! a6.unify(new IntegerTerm(engine.B0), engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
        a7 = new VariableTerm(engine);
        a8 = new VariableTerm(engine);
View Full Code Here
483
484
485
486
487
488
489
490
491
492
493
        } else {
            return engine.fail();
        }
        a6 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(6))
        if (! a6.unify(new IntegerTerm(engine.B0), engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
        a7 = new VariableTerm(engine);
        a8 = new VariableTerm(engine);
View Full Code Here
520
521
522
523
524
525
526
527
528
529
530
        } else {
            return engine.fail();
        }
        a6 = new VariableTerm(engine);
        //START inline expansion of $get_level(a(6))
        if (! a6.unify(new IntegerTerm(engine.B0), engine.trail)) {
            return engine.fail();
        }
        //END inline expansion
        a7 = new VariableTerm(engine);
        Term[] y1 = {a7};
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
        a1 = arg1;
        a2 = arg2;
    // A->B:-['$get_level'(C),call('jp.ac.kobe_u.cs.prolog.builtin':A),'$cut'(C),call('jp.ac.kobe_u.cs.prolog.builtin':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
        Term[] y1 = {s2, a1};
        a4 = new StructureTerm(s1, y1);
View Full Code Here
TOP

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

  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dcg_connect_3_1
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dcg_expansion_2_1
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dcg_expansion_2_3
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dcg_translate_dcg_5_1
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dcg_translate_dcg_5_11
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dummy_12_builtins$002Epl_3_1
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dummy_18_builtins$002Epl_1_1
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dummy_26_builtins$002Epl_2_1
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dummy_29_builtins$002Epl_5_1
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$dummy_30_builtins$002Epl_6_1
    • 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.