Package net.sf.kpex.prolog

Examples of net.sf.kpex.prolog.Clause

49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
    if (null == s)
    {
      return null;
    }
    s = patchEOFString(s);
    Clause t = null;
    try
    {
      Parser p;
      p = new Parser(s, builtinDb);
      t = p.readClause();
    }
    catch (Exception e)
    { // nothing expected to catch
      IO.errmes("unexpected parsing error", e);
    }
    if (t.dict == null)
    {
      t.setGround(false);
    }
    else
    {
      t.setGround(t.dict.isEmpty());
    }
    return t;
  }
View Full Code Here
89
90
91
92
93
94
95
96
97
    IO.errmes("*** " + C);
  }

  static protected final Clause toClause(Term T, Map dict)
  {
    Clause C = T.toClause(); // adds ...:-true if missing
    C.dict = dict;
    return C;
  }
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
114
115
    if (null == mes)
    {
      mes = "unknown_error";
    }
    Fun f = new Fun("error", new Const(type), new Const(mes), new Fun("line", new Int(line)));
    Clause C = new Clause(f, Const.TRUE);
    if (verbose)
    {
      IO.errmes(type + " error at line:" + line);
      IO.errmes(C.prettyPrint(), e);
    }
    return C;
  }
View Full Code Here
145
146
147
148
149
150
151
152
153
154
155
   * Main Parser interface: reads a clause together with variable name
   * information
   */
  public Clause readClause()
  {
    Clause t = null;
    boolean verbose = false;
    try
    {
      t = readClauseOrEOF();
      // IO.mes("GOT Clause:"+t);
View Full Code Here
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
    if (n instanceof IffToken)
    {
      n = next();
      Term t = getTerm(n);
      Term bs = getConjCont(t);
      Clause C = new Clause(new Const("init"), bs);
      C.dict = dict;
      return C;
    }

    Term h = getTerm(n);

    // IO.mes("readClauseOrEOF 1:"+h);

    n = next();

    // IO.mes("readClauseOrEOF 2:"+n);

    if (n instanceof EocToken || n instanceof EofToken)
    {
      return toClause(h, dict);
    }

    // IO.mes("readClauseOrEOF 3:"+b);

    Clause C = null;
    if (n instanceof IffToken)
    {
      Term t = getTerm();
      Term bs = getConjCont(t);
      C = new Clause(h, bs);
      C.dict = dict;
    }
    else if (n instanceof CommaToken)
    {
      Term b = getTerm();
View Full Code Here
TOP

Related Classes of net.sf.kpex.prolog.Clause

  • net.sf.kpex.builtins.AnswerSource
  • net.sf.kpex.builtins.UnfolderSource
  • net.sf.kpex.DataBase
  • net.sf.kpex.Init
  • net.sf.kpex.io.ClauseReader
  • net.sf.kpex.parser.Parser
  • net.sf.kpex.util.Trail
    • 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.