+ act_str = ""
+ for action in actions:
+ contents = action[1]
+
+ if contents["words"] == None:
+ words_str = "NULL"
+ else:
+ c_words = [make_c_string(s) for s in contents["words"]]
+ words_str = "(const char* []) {" + ", ".join(c_words) + "}"
+
+ if contents["message"] == None:
+ message = "NO_MESSAGE"
+ else:
+ message = contents["message"]
+
+ act_str += template.format(words_str, message)
+ act_str = act_str[:-1] # trim trailing newline
+ return act_str
+
+def bigdump(arr):
+ out = ""
+ for (i, entry) in enumerate(arr):
+ if i % 10 == 0:
+ if out and out[-1] == ' ':
+ out = out[:-1]
+ out += "\n "
+ out += str(arr[i]) + ", "
+ out = out[:-2] + "\n"
+ return out
+
+def buildtravel(locs, objs, voc):
+ ltravel = []
+ verbmap = {}
+ for entry in db["vocabulary"]:
+ if entry["type"] == "motion" and entry["value"] not in verbmap:
+ verbmap[entry["word"]] = entry["value"]
+ def dencode(action, name):
+ "Decode a destination number"
+ if action[0] == "goto":
+ try:
+ return locnames.index(action[1])
+ except ValueError:
+ sys.stderr.write("dungeon: unknown location %s in goto clause of %s\n" % (cond[1], name))
+ elif action[0] == "special":
+ return 300 + action[1]
+ elif action[0] == "speak":
+ try:
+ return 500 + msgnames.index(action[1])
+ except ValueError:
+ sys.stderr.write("dungeon: unknown location %s in carry clause of %s\n" % (cond[1], name))
+ else:
+ print(cond)
+ raise ValueError
+ def cencode(cond, name):
+ if cond is None:
+ return 0;
+ elif cond[0] == "pct":
+ return cond[1]
+ elif cond[0] == "carry":
+ try:
+ return 100 + objnames.index(cond[1])
+ except ValueError:
+ sys.stderr.write("dungeon: unknown object name %s in carry clause of %s\n" % (cond[1], name))
+ sys.exit(1)
+ elif cond[0] == "with":
+ try:
+ return 200 + objnames.index(cond[1])
+ except IndexError:
+ sys.stderr.write("dungeon: unknown object name %s in with clause of \n" % (cond[1], name))
+ sys.exit(1)
+ elif cond[0] == "not":
+ # FIXME: Allow named as well as numbered states
+ try:
+ return 300 + objnames.index(cond[1]) + 100 * cond[2]
+ except ValueError:
+ sys.stderr.write("dungeon: unknown object name %s in not clause of %s\n" % (cond[1], name))
+ sys.exit(1)
+ else:
+ print(cond)
+ raise ValueError
+
+ for (i, (name, loc)) in enumerate(locs):
+ if "travel" in loc:
+ for rule in loc["travel"]:
+ tt = [i]
+ dest = dencode(rule["action"], name) + 1000 * cencode(rule.get("cond"), name)
+ tt.append(dest)
+ tt += [verbmap[e] for e in rule["verbs"]]
+ if not rule["verbs"]:
+ tt.append(1)
+ ltravel.append(tuple(tt))
+
+ # At this point the ltravel data is in the Section 3
+ # representation from the FORTRAN version. Next we perform the
+ # same mapping into the runtime format. This was the C translation
+ # of the FORTRAN code:
+ # long loc;
+ # while ((loc = GETNUM(database)) != -1) {
+ # long newloc = GETNUM(NULL);
+ # long L;
+ # if (TKEY[loc] == 0) {
+ # TKEY[loc] = TRVS;
+ # } else {
+ # TRAVEL[TRVS - 1] = -TRAVEL[TRVS - 1];
+ # }
+ # while ((L = GETNUM(NULL)) != 0) {
+ # TRAVEL[TRVS] = newloc * 1000 + L;
+ # TRVS = TRVS + 1;
+ # if (TRVS == TRVSIZ)
+ # BUG(TOO_MANY_TRAVEL_OPTIONS);
+ # }
+ # TRAVEL[TRVS - 1] = -TRAVEL[TRVS - 1];
+ # }
+ travel = [0]
+ tkey = [0]
+ oldloc = 0
+ while ltravel:
+ rule = list(ltravel.pop(0))
+ loc = rule.pop(0)
+ newloc = rule.pop(0)
+ if loc != oldloc:
+ tkey.append(len(travel))
+ oldloc = loc
+ elif travel:
+ travel[-1] *= -1
+ while rule:
+ travel.append(rule.pop(0) + newloc * 1000)
+ travel[-1] *= -1
+ return (travel, tkey)