1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 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 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322
|
//############################################################################
// Programmation IV - 2002 - Week 13
//############################################################################
class Tokenizer(s: String, delimiters: String) extends Iterator[String] {
private var i = 0;
def isDelimiter(ch: Char) = {
var i = 0;
while (i < delimiters.length() && delimiters.charAt(i) != ch) { i = i + 1 }
i < delimiters.length()
}
def hasNext: Boolean = {
while (i < s.length() && s.charAt(i) <= ' ') { i = i + 1 }
i < s.length()
}
def next: String =
if (hasNext) {
val start = i;
var ch = s.charAt(i); i = i + 1;
if (isDelimiter(ch)) ch.toString()
else {
while (i < s.length() &&
s.charAt(i) > ' ' &&
!isDelimiter(s.charAt(i))){ i = i + 1 }
s.substring(start, i)
}
} else "";
}
object Terms {
val debug = false;
trait Term {
def map(s: Subst): Term;
def tyvars: List[String];
}
case class Binding(name: String, term: Term) {
term match { case Var(n) if (name == n) => sys.error("bad binding") case _ => () }
override def toString() = name + " = " + term;
}
type Subst = List[Binding];
def lookup(s: Subst, name: String): Option[Term] = s match {
case List() => None
case b :: s1 => if (name == b.name) Some(b.term) else lookup(s1, name)
}
case class Var(a: String) extends Term {
override def toString() = a;
def map(s: Subst): Term = lookup(s, a) match {
case Some(b) => b map s
case None => this;
}
def tyvars = List(a);
}
case class Con(a: String, ts: List[Term]) extends Term {
override def toString() =
a + (if (ts.isEmpty) "" else ts.mkString("(", ",", ")"));
def map(s: Subst): Term = Con(a, ts map (t => t map s));
def tyvars = (ts flatMap (t => t.tyvars)).distinct;
}
private var count = 0;
def newVar(prefix: String) = { count = count + 1; Var(prefix + count) }
val NoTerm = Con("<none>", List());
def unify1(x: Term, y: Term, s: Subst): Option[Subst] = (x, y) match {
case (Var(a), Var(b)) if (a == b) =>
Some(s)
case (Var(a), _) => lookup(s, a) match {
case Some(x1) => unify(x1, y, s)
case None => if (y.tyvars contains a) None else Some(Binding(a, y) :: s)
}
case (_, Var(b)) => lookup(s, b) match {
case Some(y1) => unify(x, y1, s)
case None => if (x.tyvars contains b) None else Some(Binding(b, x) :: s)
}
case (Con(a, xs), Con(b, ys)) if (a == b) =>
unify(xs, ys, s)
case _ => None
}
def unify(x: Term, y: Term, s: Subst): Option[Subst] = {
val ss = unify1(x, y, s);
if (debug) Console.println("unify " + x + " with " + y + " = " + ss);
ss
}
def unify(xs: List[Term], ys: List[Term], s: Subst): Option[Subst] = (xs, ys) match {
case (List(), List()) => Some(s)
case (x :: xs1, y :: ys1) =>
unify(x, y, s) match {
case Some(s1) => unify(xs1, ys1, s1)
case None => None
}
case _ => None
}
}
import Terms._;
object Programs {
case class Clause(lhs: Term, rhs: List[Term]) {
def tyvars =
(lhs.tyvars ::: (rhs flatMap (t => t.tyvars))).distinct;
def newInstance = {
var s: Subst = List();
for (a <- tyvars) { s = Binding(a, newVar(a)) :: s }
Clause(lhs map s, rhs map (t => t map s))
}
override def toString() =
lhs.toString() + " :- " + rhs.mkString("", ",", "") + ".";
}
def list2stream[a](xs: List[a]): Stream[a] = xs match {
case List() => Stream.empty
case x :: xs1 => Stream.cons(x, list2stream(xs1))
}
def option2stream[a](xo: Option[a]): Stream[a] = xo match {
case None => Stream.empty
case Some(x) => Stream.cons(x, Stream.empty)
}
def solve(query: List[Term], clauses: List[Clause]): Stream[Subst] = {
def solve2(query: List[Term], s: Subst): Stream[Subst] = query match {
case List() =>
Stream.cons(s, Stream.empty)
case Con("not", qs) :: query1 =>
if (solve1(qs, s).isEmpty) Stream.cons(s, Stream.empty)
else Stream.empty
case q :: query1 =>
for (clause <- list2stream(clauses);
s1 <- tryClause(clause.newInstance, q, s);
s2 <- solve1(query1, s1)) yield s2
}
def solve1(query: List[Term], s: Subst): Stream[Subst] = {
val ss = solve2(query, s);
if (debug) Console.println("solved " + query + " = " + ss);
ss
}
def tryClause(c: Clause, q: Term, s: Subst): Stream[Subst] = {
if (debug) Console.println("trying " + c);
for (s1 <- option2stream(unify(q, c.lhs, s)); s2 <- solve1(c.rhs, s1)) yield s2;
}
solve1(query, List())
}
}
import Programs._;
class Parser(s: String) {
val it = new Tokenizer(s, "(),.?");
var token: String = it.next;
def syntaxError(msg: String): Unit = sys.error(msg + ", but " + token + " found");
def rep[a](p: => a): List[a] = {
val t = p;
if (token == ",") { token = it.next; t :: rep(p) } else List(t)
}
def constructor: Term = {
val a = token;
token = it.next;
Con(a,
if (token equals "(") {
token = it.next;
val ts: List[Term] = if (token equals ")") List() else rep(term);
if (token equals ")") token = it.next else syntaxError("`)' expected");
ts
} else List())
}
def term: Term = {
val ch = token.charAt(0);
if ('A' <= ch && ch <= 'Z') { val a = token; token = it.next; Var(a) }
else if (it.isDelimiter(ch)) { syntaxError("term expected"); null }
else constructor
}
def line: Clause = {
val result =
if (token equals "?") {
token = it.next;
Clause(NoTerm, rep(constructor));
} else {
Clause(
constructor,
if (token equals ":-") { token = it.next; rep(constructor) } else List())
}
if (token equals ".") token = it.next else syntaxError("`.' expected");
result
}
def all: List[Clause] = if (token equals "") List() else line :: all;
}
object Prolog {
def processor: String => Unit = {
var program: List[Clause] = List();
var solutions: Stream[Subst] = Stream.empty;
var tvs: List[String] = List();
{ input =>
new Parser(input).all foreach { c =>
if (c.lhs == NoTerm) {
c.rhs match {
case List(Con("more", List())) =>
solutions = solutions.tail;
case _ =>
solutions = solve(c.rhs, program);
tvs = c.tyvars;
}
if (solutions.isEmpty) {
Console.println("no")
} else {
val s: Subst = solutions.head
.filter(b => tvs contains b.name)
.map(b => Binding(b.name, b.term map solutions.head))
.reverse;
if (s.isEmpty) Console.println("yes")
else Console.println(s);
}
} else {
program = program ::: List(c);
}
}
}
}
def process(code: String) = processor(code);
}
//############################################################################
object Test {
def main(args: Array[String]): Unit = {
Prolog.process(
"sujet(jean).\n" +
"sujet(marie).\n" +
"verbe(mange).\n" +
"verbe(dort).\n" +
"article(le).\n" +
"article(la).\n" +
"adjectif(grand).\n" +
"adjectif(belle).\n" +
"nom(table).\n" +
"nom(cheval).\n" +
"complement(A,D,N) :- article(A), adjectif(D), nom(N).\n" +
"phrase(S,V,A,D,N) :- sujet(S), verbe(V), complement(A,D,N).\n" +
"?phrase(S,V,A,D,N).\n" + "?more.\n"
);
Console.println;
Prolog.process(
"sujet(jean).\n" +
"sujet(marie).\n" +
"verbe(mange).\n" +
"verbe(dort).\n" +
"article(le,m).\n" +
"article(la,f).\n" +
"adjectif(grand,m).\n" +
"adjectif(belle,f).\n" +
"nom(table,f).\n" +
"nom(cheval,m).\n" +
"complement(A,D,N) :- article(A,G), adjectif(D,G), nom(N,G).\n" +
"phrase(S,V,A,D,N) :- sujet(S), verbe(V), complement(A,D,N).\n" +
"?phrase(S,V,A,D,N).\n" + "?more.\n"
);
Console.println;
Prolog.process(
"sujet(jean).\n" +
"sujet(marie).\n" +
"verbe(mange).\n" +
"verbe(dort).\n" +
"article(le,m).\n" +
"article(la,f).\n" +
"adjectif(grand,m).\n" +
"adjectif(belle,f).\n" +
"nom(table,f).\n" +
"nom(cheval,m).\n" +
"adjectifs(nil,G).\n" +
"adjectifs(cons(A1,nil),G) :- adjectif(A1,G).\n" +
"adjectifs(cons(A1,cons(A2,nil)),G) :- adjectif(A1,G),adjectif(A2,G).\n"+
"complement(A,D,N) :- article(A,G), adjectifs(D,G), nom(N,G).\n" +
"phrase(S,V,A,D,N) :- sujet(S), verbe(V), complement(A,D,N).\n" +
"?phrase(S,V,A,D,N).\n" + "?more.\n" + "?more.\n" + "?more.\n" +
"?phrase(jean,mange,le,nil,cheval).\n" +
"?phrase(jean,mange,le,cons(grand,nil),cheval).\n" +
"?phrase(jean,mange,le,cons(grand,nil),table).\n"
);
Console.println;
()
}
}
//############################################################################
|