tla-ts 0.0.9 → 0.0.10-dev.63a6693bd

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (400) hide show
  1. package/README.md +29 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +29 -29
  5. package/dist/deciders.js +42 -42
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +106 -10
  8. package/dist/index.d.ts +106 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +117 -37
  15. package/dist/prove.js +116 -36
  16. package/dist/run.cjs +143 -31
  17. package/dist/run.js +143 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +129 -104
  21. package/dist/transfer.js +129 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +3 -1
  25. package/src/ast.ts +48 -62
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +599 -754
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +14 -25
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +361 -0
  40. package/src/cli/tlc.ts +309 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +14 -53
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +169 -335
  51. package/src/errors.ts +71 -55
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +37 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +80 -100
  63. package/src/liveness-checker.ts +103 -153
  64. package/src/liveness.ts +150 -109
  65. package/src/obligations/action.ts +8 -39
  66. package/src/obligations/anonymize.ts +88 -82
  67. package/src/obligations/equality.ts +1 -1
  68. package/src/obligations/expression.ts +20 -21
  69. package/src/obligations/format.ts +1 -9
  70. package/src/obligations/generate.ts +46 -49
  71. package/src/obligations/index.ts +2 -13
  72. package/src/obligations/levels.ts +4 -8
  73. package/src/obligations/module.ts +28 -53
  74. package/src/obligations/normalize.ts +7 -25
  75. package/src/obligations/operators.ts +1 -2
  76. package/src/obligations/pragma.ts +1 -10
  77. package/src/obligations/printer.ts +47 -46
  78. package/src/obligations/proof.ts +1 -5
  79. package/src/obligations/regroup.ts +1 -4
  80. package/src/obligations/simplify.ts +42 -58
  81. package/src/obligations/source.ts +48 -78
  82. package/src/obligations/subexpression.ts +5 -11
  83. package/src/obligations/substitution.ts +1 -3
  84. package/src/obligations/temporal.ts +13 -19
  85. package/src/obligations/tuples.ts +3 -9
  86. package/src/parallel-worker.ts +30 -60
  87. package/src/parallel.ts +57 -71
  88. package/src/parser.ts +584 -316
  89. package/src/pcal/ast.ts +53 -86
  90. package/src/pcal/parse.ts +144 -219
  91. package/src/pcal/tokenize.ts +91 -131
  92. package/src/pcal/translate.ts +83 -130
  93. package/src/pcal/validate.ts +48 -68
  94. package/src/pretty-print.ts +7 -8
  95. package/src/prover/decide-pool.ts +8 -13
  96. package/src/prover/deciders.ts +3 -7
  97. package/src/prover/first-order.ts +0 -11
  98. package/src/prover/isabelle/decide.ts +0 -6
  99. package/src/prover/isabelle/encode.ts +11 -23
  100. package/src/prover/isabelle/isar/inner-syntax.ts +114 -115
  101. package/src/prover/isabelle/isar/method.ts +29 -53
  102. package/src/prover/isabelle/isar/proof.ts +1 -10
  103. package/src/prover/isabelle/isar/statement.ts +1 -6
  104. package/src/prover/isabelle/isar/theory.ts +26 -36
  105. package/src/prover/isabelle/isar/type-check.ts +17 -31
  106. package/src/prover/isabelle/provers/blast/blast.ts +17 -104
  107. package/src/prover/isabelle/provers/blast/branch.ts +1 -32
  108. package/src/prover/isabelle/provers/blast/prove.ts +1 -35
  109. package/src/prover/isabelle/provers/blast/rules.ts +6 -44
  110. package/src/prover/isabelle/provers/blast/state.ts +2 -28
  111. package/src/prover/isabelle/provers/blast/term.ts +9 -36
  112. package/src/prover/isabelle/provers/clasimp.ts +1 -13
  113. package/src/prover/isabelle/provers/classical.ts +14 -42
  114. package/src/prover/isabelle/provers/hypsubst.ts +28 -51
  115. package/src/prover/isabelle/pure/bicompose.ts +25 -38
  116. package/src/prover/isabelle/pure/consts.ts +1 -7
  117. package/src/prover/isabelle/pure/conv.ts +3 -17
  118. package/src/prover/isabelle/pure/drule.ts +33 -42
  119. package/src/prover/isabelle/pure/envir.ts +3 -52
  120. package/src/prover/isabelle/pure/goal.ts +1 -7
  121. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  122. package/src/prover/isabelle/pure/list.ts +0 -3
  123. package/src/prover/isabelle/pure/logic.ts +2 -15
  124. package/src/prover/isabelle/pure/name.ts +2 -9
  125. package/src/prover/isabelle/pure/net.ts +3 -59
  126. package/src/prover/isabelle/pure/object-logic.ts +3 -10
  127. package/src/prover/isabelle/pure/pattern.ts +2 -19
  128. package/src/prover/isabelle/pure/raw-simplifier.ts +17 -62
  129. package/src/prover/isabelle/pure/rewriter.ts +31 -67
  130. package/src/prover/isabelle/pure/search.ts +3 -10
  131. package/src/prover/isabelle/pure/seq.ts +1 -10
  132. package/src/prover/isabelle/pure/simplifier.ts +4 -12
  133. package/src/prover/isabelle/pure/table.ts +3 -32
  134. package/src/prover/isabelle/pure/tactic.ts +12 -22
  135. package/src/prover/isabelle/pure/tactical.ts +48 -47
  136. package/src/prover/isabelle/pure/term-ord.ts +2 -6
  137. package/src/prover/isabelle/pure/term.ts +2 -43
  138. package/src/prover/isabelle/pure/thm.ts +27 -47
  139. package/src/prover/isabelle/pure/type.ts +2 -15
  140. package/src/prover/isabelle/pure/unify.ts +20 -30
  141. package/src/prover/isabelle/pure/variable.ts +3 -7
  142. package/src/prover/isabelle/tla/classical-setup.ts +17 -24
  143. package/src/prover/isabelle/tla/context.ts +15 -18
  144. package/src/prover/isabelle/tla/logic.ts +14 -32
  145. package/src/prover/isabelle/tla/simpdata.ts +46 -43
  146. package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
  147. package/src/prover/ocaml.ts +0 -6
  148. package/src/prover/prep/action.ts +14 -54
  149. package/src/prover/prep/enabled-axioms.ts +12 -19
  150. package/src/prover/prep/fingerprint.ts +2 -21
  151. package/src/prover/prep/level-comparison.ts +8 -12
  152. package/src/prover/prep/md5.ts +0 -2
  153. package/src/prover/prep/methods.ts +33 -39
  154. package/src/prover/prep/normalize.ts +4 -28
  155. package/src/prover/prove-worker.ts +0 -2
  156. package/src/prover/prove.ts +87 -100
  157. package/src/prover/ptl/decide.ts +7 -12
  158. package/src/prover/ptl/encode.ts +14 -36
  159. package/src/prover/ptl/sat.ts +24 -32
  160. package/src/prover/ptl/tableau.ts +12 -26
  161. package/src/prover/smt/axioms.ts +0 -7
  162. package/src/prover/smt/context.ts +20 -28
  163. package/src/prover/smt/data.ts +433 -424
  164. package/src/prover/smt/encode.ts +43 -52
  165. package/src/prover/smt/extensionality.ts +0 -10
  166. package/src/prover/smt/flatten.ts +3 -22
  167. package/src/prover/smt/format.ts +5 -10
  168. package/src/prover/smt/instances.ts +0 -10
  169. package/src/prover/smt/rewrite.ts +663 -667
  170. package/src/prover/smt/solver/act-cache.ts +0 -15
  171. package/src/prover/smt/solver/arith-rewriter.ts +3 -48
  172. package/src/prover/smt/solver/array.ts +1 -3
  173. package/src/prover/smt/solver/asserted-formulas.ts +1 -43
  174. package/src/prover/smt/solver/ast-lt.ts +1 -11
  175. package/src/prover/smt/solver/ast-util.ts +1 -6
  176. package/src/prover/smt/solver/ast.ts +1 -165
  177. package/src/prover/smt/solver/auf-solver.ts +8 -44
  178. package/src/prover/smt/solver/case-split-queue.ts +1 -9
  179. package/src/prover/smt/solver/cg-table.ts +1 -18
  180. package/src/prover/smt/solver/clause.ts +1 -27
  181. package/src/prover/smt/solver/conflict-resolution.ts +0 -9
  182. package/src/prover/smt/solver/context.ts +7 -64
  183. package/src/prover/smt/solver/ctx-simplify.ts +14 -41
  184. package/src/prover/smt/solver/der.ts +2 -21
  185. package/src/prover/smt/solver/dyn-ack.ts +1 -11
  186. package/src/prover/smt/solver/e-matching.ts +4 -35
  187. package/src/prover/smt/solver/enode.ts +1 -21
  188. package/src/prover/smt/solver/expr-ref.ts +1 -5
  189. package/src/prover/smt/solver/expr-safe-replace.ts +1 -6
  190. package/src/prover/smt/solver/fingerprints.ts +1 -12
  191. package/src/prover/smt/solver/flat-literals.ts +1 -9
  192. package/src/prover/smt/solver/goal.ts +2 -14
  193. package/src/prover/smt/solver/hash.ts +0 -8
  194. package/src/prover/smt/solver/hashtable.ts +1 -12
  195. package/src/prover/smt/solver/internalizer.ts +7 -100
  196. package/src/prover/smt/solver/lbool.ts +1 -2
  197. package/src/prover/smt/solver/literal.ts +0 -3
  198. package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
  199. package/src/prover/smt/solver/lp/constraints.ts +2 -8
  200. package/src/prover/smt/solver/lp/containers.ts +12 -30
  201. package/src/prover/smt/solver/lp/core-solver.ts +10 -31
  202. package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
  203. package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
  204. package/src/prover/smt/solver/lp/dependency.ts +1 -4
  205. package/src/prover/smt/solver/lp/dioph-eq.ts +9 -102
  206. package/src/prover/smt/solver/lp/explanation.ts +1 -6
  207. package/src/prover/smt/solver/lp/gomory.ts +9 -22
  208. package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
  209. package/src/prover/smt/solver/lp/hnf.ts +11 -26
  210. package/src/prover/smt/solver/lp/int-cube.ts +15 -36
  211. package/src/prover/smt/solver/lp/int-solver.ts +4 -34
  212. package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
  213. package/src/prover/smt/solver/lp/lar-term.ts +1 -5
  214. package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
  215. package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
  216. package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
  217. package/src/prover/smt/solver/lp/nex.ts +1 -6
  218. package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
  219. package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
  220. package/src/prover/smt/solver/lp/nla-core.ts +36 -135
  221. package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
  222. package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
  223. package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
  224. package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
  225. package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
  226. package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
  227. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
  228. package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
  229. package/src/prover/smt/solver/lp/nla-order.ts +2 -13
  230. package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
  231. package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
  232. package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
  233. package/src/prover/smt/solver/lp/nla-types.ts +1 -11
  234. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
  235. package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
  236. package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
  237. package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
  238. package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
  239. package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
  240. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  241. package/src/prover/smt/solver/lp/random-updater.ts +1 -8
  242. package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
  243. package/src/prover/smt/solver/lp/union-find.ts +1 -6
  244. package/src/prover/smt/solver/mam-compiler.ts +18 -58
  245. package/src/prover/smt/solver/mam-interpreter.ts +1 -21
  246. package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
  247. package/src/prover/smt/solver/model-checker.ts +3 -37
  248. package/src/prover/smt/solver/model-evaluator.ts +3 -29
  249. package/src/prover/smt/solver/model-finder.ts +15 -32
  250. package/src/prover/smt/solver/model-generator.ts +1 -12
  251. package/src/prover/smt/solver/model-macro-solver.ts +23 -88
  252. package/src/prover/smt/solver/nlsat/algebraic.ts +63 -159
  253. package/src/prover/smt/solver/nlsat/atoms.ts +25 -23
  254. package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
  255. package/src/prover/smt/solver/nlsat/explain.ts +10 -69
  256. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
  257. package/src/prover/smt/solver/nlsat/levelwise.ts +49 -135
  258. package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
  259. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -159
  260. package/src/prover/smt/solver/nlsat/solver.ts +18 -90
  261. package/src/prover/smt/solver/nlsat/types.ts +1 -8
  262. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +2 -45
  263. package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
  264. package/src/prover/smt/solver/nnf.ts +3 -38
  265. package/src/prover/smt/solver/pattern-inference.ts +2 -15
  266. package/src/prover/smt/solver/poly-rewriter.ts +3 -23
  267. package/src/prover/smt/solver/propagate-values.ts +1 -10
  268. package/src/prover/smt/solver/proto-model.ts +3 -52
  269. package/src/prover/smt/solver/pull-quant.ts +1 -12
  270. package/src/prover/smt/solver/qe-lite-der.ts +1 -29
  271. package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
  272. package/src/prover/smt/solver/qe-lite.ts +3 -33
  273. package/src/prover/smt/solver/qi-queue.ts +1 -16
  274. package/src/prover/smt/solver/quant-tactics.ts +5 -22
  275. package/src/prover/smt/solver/quantifier-analyzer.ts +27 -47
  276. package/src/prover/smt/solver/quantifier-manager.ts +2 -13
  277. package/src/prover/smt/solver/random-gen.ts +1 -2
  278. package/src/prover/smt/solver/rational.ts +1 -8
  279. package/src/prover/smt/solver/ref-vector.ts +1 -6
  280. package/src/prover/smt/solver/relevancy.ts +2 -15
  281. package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
  282. package/src/prover/smt/solver/rewriter.ts +3 -85
  283. package/src/prover/smt/solver/rlimit.ts +2 -20
  284. package/src/prover/smt/solver/smtlib-parser.ts +80 -131
  285. package/src/prover/smt/solver/solver.ts +23 -34
  286. package/src/prover/smt/solver/sort.ts +1 -5
  287. package/src/prover/smt/solver/sticky-generations.ts +0 -5
  288. package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
  289. package/src/prover/smt/solver/theory-lra-bounds.ts +1 -7
  290. package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
  291. package/src/prover/smt/solver/theory-lra-internalize.ts +6 -43
  292. package/src/prover/smt/solver/theory-lra-model.ts +4 -19
  293. package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
  294. package/src/prover/smt/solver/theory-lra-state.ts +3 -8
  295. package/src/prover/smt/solver/theory-lra.ts +1 -8
  296. package/src/prover/smt/solver/var-subst.ts +2 -26
  297. package/src/prover/smt/table.ts +0 -8
  298. package/src/prover/tlapm/cache.ts +45 -40
  299. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  300. package/src/prover/tlapm/tlapm.ts +21 -20
  301. package/src/prover/verdict.ts +7 -2
  302. package/src/prover/zenon/check/check.ts +1 -11
  303. package/src/prover/zenon/check/definitions.ts +5 -15
  304. package/src/prover/zenon/check/equality.ts +0 -8
  305. package/src/prover/zenon/check/functions.ts +0 -4
  306. package/src/prover/zenon/check/keys.ts +0 -7
  307. package/src/prover/zenon/check/propositional.ts +0 -3
  308. package/src/prover/zenon/check/records.ts +1 -6
  309. package/src/prover/zenon/check/relations.ts +2 -14
  310. package/src/prover/zenon/check/rewrites.ts +2 -21
  311. package/src/prover/zenon/check/sets.ts +40 -61
  312. package/src/prover/zenon/check/terms.ts +1 -19
  313. package/src/prover/zenon/check/tla.ts +0 -6
  314. package/src/prover/zenon/decide.ts +0 -12
  315. package/src/prover/zenon/encode.ts +1 -8
  316. package/src/prover/zenon/eqrel.ts +2 -13
  317. package/src/prover/zenon/equality-rules.ts +0 -4
  318. package/src/prover/zenon/expr.ts +8 -26
  319. package/src/prover/zenon/index-table.ts +26 -57
  320. package/src/prover/zenon/isar-case.ts +9 -19
  321. package/src/prover/zenon/isar.ts +36 -64
  322. package/src/prover/zenon/limits.ts +0 -4
  323. package/src/prover/zenon/llproof.ts +2 -20
  324. package/src/prover/zenon/mltoll.ts +66 -104
  325. package/src/prover/zenon/node.ts +1 -11
  326. package/src/prover/zenon/ocaml.ts +1 -17
  327. package/src/prover/zenon/parse.ts +4 -12
  328. package/src/prover/zenon/phrase.ts +1 -11
  329. package/src/prover/zenon/proof.ts +0 -9
  330. package/src/prover/zenon/propositional-rules.ts +0 -5
  331. package/src/prover/zenon/rules.ts +2 -6
  332. package/src/prover/zenon/search.ts +5 -31
  333. package/src/prover/zenon/tla/functions.ts +59 -31
  334. package/src/prover/zenon/tla/llproof.ts +67 -76
  335. package/src/prover/zenon/tla/records.ts +57 -33
  336. package/src/prover/zenon/tla/rewrites.ts +12 -19
  337. package/src/prover/zenon/tla/sets.ts +83 -53
  338. package/src/prover/zenon/tla/terms.ts +0 -6
  339. package/src/prover/zenon/tla/tla.ts +66 -64
  340. package/src/randomization.ts +81 -35
  341. package/src/resolve.ts +67 -184
  342. package/src/runtime.ts +22 -22
  343. package/src/sany/builtins.ts +2 -5
  344. package/src/sany/generation.ts +394 -0
  345. package/src/sany/generator-def-entries.ts +210 -0
  346. package/src/sany/generator-definitions.ts +686 -0
  347. package/src/sany/generator-expressions.ts +1100 -0
  348. package/src/sany/generator-proofs.ts +662 -0
  349. package/src/sany/generator.ts +191 -2764
  350. package/src/sany/levels.ts +6 -34
  351. package/src/sany/lexer.ts +58 -77
  352. package/src/sany/linter.ts +1 -9
  353. package/src/sany/modules.ts +1 -5
  354. package/src/sany/nodes.ts +5 -43
  355. package/src/sany/parse-error.ts +39 -117
  356. package/src/sany/report.ts +32 -69
  357. package/src/sany/selectors.ts +49 -76
  358. package/src/sany/source.ts +1 -17
  359. package/src/sany/xml.ts +35 -117
  360. package/src/search.ts +541 -163
  361. package/src/simulate.ts +709 -0
  362. package/src/spec-description.ts +192 -100
  363. package/src/standard-definitions.ts +0 -4
  364. package/src/standard-modules.ts +264 -95
  365. package/src/state-graph.ts +52 -31
  366. package/src/subexpressions.ts +69 -52
  367. package/src/substitution-levels.ts +7 -7
  368. package/src/successors.ts +266 -99
  369. package/src/symmetry.ts +33 -25
  370. package/src/tableau.ts +27 -24
  371. package/src/tlc/fingerprint.ts +183 -67
  372. package/src/tlc/jar-data.ts +112 -6
  373. package/src/tlc/messages.ts +125 -54
  374. package/src/tlc/order.ts +39 -69
  375. package/src/tlc/random.ts +37 -49
  376. package/src/tlc/replay.ts +553 -228
  377. package/src/tlc/summary.ts +36 -47
  378. package/src/tlc/tlc-operators.ts +78 -44
  379. package/src/tlc/tlcext-operators.ts +139 -122
  380. package/src/tlc/trace-spec.ts +249 -0
  381. package/src/tlc/value-stream.ts +139 -0
  382. package/src/tlc/version.ts +1 -4
  383. package/src/transfer.ts +22 -25
  384. package/src/typescript/actions.ts +479 -0
  385. package/src/typescript/collections.ts +614 -0
  386. package/src/typescript/compile.ts +63 -0
  387. package/src/typescript/context.ts +94 -0
  388. package/src/typescript/emit.ts +121 -0
  389. package/src/typescript/expressions.ts +496 -0
  390. package/src/typescript/formula.ts +154 -0
  391. package/src/typescript/functions.ts +284 -0
  392. package/src/typescript/model.ts +162 -0
  393. package/src/typescript/names.ts +114 -0
  394. package/src/typescript/program.ts +48 -0
  395. package/src/typescript/properties.ts +139 -0
  396. package/src/typescript/scope.ts +112 -0
  397. package/src/typescript/steps.ts +167 -0
  398. package/src/typescript/types.ts +171 -0
  399. package/src/values.ts +832 -484
  400. package/src/worker.ts +7 -8
@@ -27,9 +27,7 @@ import {
27
27
  type ThmOrAssumpDefNode,
28
28
  } from "./nodes";
29
29
 
30
- // A port of the levelCheck methods of SANY's semantic nodes: the levels, weights and Leibniz flags
31
- // its XMLExporter writes, and the level errors it reports. Each check returns what SANY's returns,
32
- // which is whether the node is free of level errors, or true for the nodes that ignore that.
30
+ // A port of the levelCheck methods of SANY's semantic nodes.
33
31
 
34
32
  type AnyDefNode = OpDefNode | ThmOrAssumpDefNode;
35
33
 
@@ -72,7 +70,6 @@ const addArgLevelParams = (
72
70
  });
73
71
  };
74
72
 
75
- // SetOfLevelConstraints.put keeps the lowest bound.
76
73
  const putLevelConstraint = (target: Map<SymbolNode, number>, param: SymbolNode, level: number) => {
77
74
  target.set(param, Math.min(level, target.get(param) ?? TEMPORAL_LEVEL));
78
75
  };
@@ -89,7 +86,6 @@ const putLevelConstraints = (
89
86
 
90
87
  const getArgLevelConstraintKey = (param: SymbolNode, position: number) => `${param.id}:${position}`;
91
88
 
92
- // SetOfArgLevelConstraints.put keeps the highest bound.
93
89
  const putArgLevelConstraint = (
94
90
  target: Map<string, ArgLevelConstraint>,
95
91
  param: SymbolNode,
@@ -129,7 +125,6 @@ const mergeLevels = (node: LevelFields, part: LevelFields) => {
129
125
  addArgLevelParams(node.argLevelParams, part.argLevelParams);
130
126
  };
131
127
 
132
- // ArgLevelParam.occur.
133
128
  const isOccurring = (argLevelParam: ArgLevelParam, symbols: SymbolNode[]) =>
134
129
  symbols.includes(argLevelParam.op) || symbols.includes(argLevelParam.param);
135
130
 
@@ -170,14 +165,12 @@ const getBoundSymbols = (node: OpApplNode) => [
170
165
  const getSubstitute = (symbol: SymbolNode, substs: Subst[]) =>
171
166
  substs.find((subst) => subst.op === symbol)?.expr;
172
167
 
173
- // Subst.paramSet and Subst.allParamSet.
174
168
  const getSubstitutedParams = (param: SymbolNode, substs: Subst[], isAll: boolean) => {
175
169
  const substitute = getSubstitute(param, substs);
176
170
  if (substitute === undefined) return new Set([param]);
177
171
  return isAll ? substitute.allParams : substitute.levelParams;
178
172
  };
179
173
 
180
- // Subst.getSubALPSet.
181
174
  const getSubstitutedArgLevelParams = (source: Map<string, ArgLevelParam>, substs: Subst[]) => {
182
175
  const result = new Map<string, ArgLevelParam>();
183
176
  source.forEach((argLevelParam, key) => {
@@ -201,7 +194,6 @@ interface ConstraintSource {
201
194
  argLevelParams: Map<string, ArgLevelParam>;
202
195
  }
203
196
 
204
- // Subst.getSubLCSet.
205
197
  const getSubstitutedLevelConstraints = (
206
198
  body: ConstraintSource,
207
199
  substs: Subst[],
@@ -235,7 +227,6 @@ const getSubstitutedLevelConstraints = (
235
227
  return result;
236
228
  };
237
229
 
238
- // Subst.getSubALCSet.
239
230
  const getSubstitutedArgLevelConstraints = (
240
231
  body: ConstraintSource,
241
232
  substs: Subst[],
@@ -268,7 +259,6 @@ const getSubstitutedArgLevelConstraints = (
268
259
  return result;
269
260
  };
270
261
 
271
- // ModuleNode.isConstant.
272
262
  const isConstantModule = (module: ModuleNode, check: LevelCheck) => {
273
263
  if (getDeclarations(module, VARIABLE_DECL_KIND).length > 0) return false;
274
264
  checkModuleLevels(module, check);
@@ -278,19 +268,18 @@ const isConstantModule = (module: ModuleNode, check: LevelCheck) => {
278
268
  return module.topLevel.every((node) => node.kind !== "Theorem" || node.level === CONSTANT_LEVEL);
279
269
  };
280
270
 
281
- // The parts of OpDefNode.levelCheck and ThmOrAssumpDefNode.levelCheck that follow the body's.
282
271
  const checkDefinitionBody = (node: AnyDefNode, params: FormalParamNode[], body: LevelFields) => {
283
272
  node.minMaxLevel = params.map((param) =>
284
273
  Array.from(
285
274
  { length: param.arity },
286
- (_, position) =>
275
+ (_value, position) =>
287
276
  body.argLevelConstraints.get(getArgLevelConstraintKey(param, position))?.level ??
288
277
  CONSTANT_LEVEL,
289
278
  ),
290
279
  );
291
280
  node.opLevelCond = params.map((param) =>
292
281
  params.map((other) =>
293
- Array.from({ length: param.arity }, (_, index) =>
282
+ Array.from({ length: param.arity }, (_value, index) =>
294
283
  body.argLevelParams.has(getArgLevelKey(param, index, other)),
295
284
  ),
296
285
  ),
@@ -323,8 +312,6 @@ const checkDefinitionBody = (node: AnyDefNode, params: FormalParamNode[], body:
323
312
  );
324
313
  };
325
314
 
326
- // The checks of OpApplNode.levelCheck that compare the levels of the arguments of a defined
327
- // operator with the levels it allows.
328
315
  const checkArguments = (
329
316
  node: OpApplNode,
330
317
  operator: AnyDefNode,
@@ -395,7 +382,6 @@ const checkArguments = (
395
382
  });
396
383
  };
397
384
 
398
- // The level constraints OpApplNode.levelCheck derives for an application of a defined operator.
399
385
  const constrainArguments = (
400
386
  node: OpApplNode,
401
387
  operator: AnyDefNode,
@@ -405,7 +391,7 @@ const constrainArguments = (
405
391
  ) => {
406
392
  const params = operator.params ?? [];
407
393
  const getArgument = (symbol: SymbolNode) =>
408
- node.operands.find((_, index) => params[index] === symbol);
394
+ node.operands.find((_operand, index) => params[index] === symbol);
409
395
  putLevelConstraints(node.levelConstraints, operator.levelConstraints);
410
396
  node.operands.forEach((operand) => {
411
397
  if (operand === undefined) return;
@@ -532,8 +518,6 @@ const constrainArguments = (
532
518
  });
533
519
  };
534
520
 
535
- // The operators OpApplNode.levelCheck rejects with both temporal and action arguments, and how its
536
- // message names them.
537
521
  const LOGICAL_OPERATOR_NAMES = new Map([
538
522
  ["\\land", "\\land"],
539
523
  ["\\lor", "\\lor"],
@@ -543,9 +527,6 @@ const LOGICAL_OPERATOR_NAMES = new Map([
543
527
  ["$DisjList", "Disjunction list"],
544
528
  ]);
545
529
 
546
- // The checks at the end of OpApplNode.levelCheck of the temporal operators and quantifiers. TLC
547
- // 1.7.4's SANY reports these errors but leaves the node level-correct, so an operator applied to it
548
- // still checks its level.
549
530
  const checkTemporalApplication = (node: OpApplNode, check: LevelCheck) => {
550
531
  const addTemporalError = (location: SanyLocation, text: string) => {
551
532
  addError(check, location, text);
@@ -698,7 +679,7 @@ const checkTheoremDefinition = (node: ThmOrAssumpDefNode, iteration: number, che
698
679
  node.levelChecked = iteration;
699
680
  node.maxLevels = node.params.map(() => TEMPORAL_LEVEL);
700
681
  // SANY allocates isLeibnizArg anew for each parameter, so only the last one starts out Leibniz.
701
- node.isLeibnizArg = node.params.map((_, index) => index === node.params.length - 1);
682
+ node.isLeibnizArg = node.params.map((_param, index) => index === node.params.length - 1);
702
683
  if (node.params.length > 0) node.isLeibniz = true;
703
684
  node.levelCorrect = checkLevel(node.body, iteration, check);
704
685
  node.level = node.body.level;
@@ -710,8 +691,6 @@ const checkTheoremDefinition = (node: ThmOrAssumpDefNode, iteration: number, che
710
691
  return node.levelCorrect;
711
692
  };
712
693
 
713
- // ModuleNode.levelCheck: the definitions of each recursive section are checked twice, the second
714
- // time with the highest level and the parameters of the section's recursive operators.
715
694
  export const checkModuleLevels = (module: ModuleNode, check: LevelCheck) => {
716
695
  if (module.isLevelChecked) return module.levelCorrect;
717
696
  module.isLevelChecked = true;
@@ -796,7 +775,6 @@ export const checkModuleLevels = (module: ModuleNode, check: LevelCheck) => {
796
775
  return module.levelCorrect;
797
776
  };
798
777
 
799
- // LevelNode.levelCheckSubnodes, which skips modules.
800
778
  const checkSubnodes = (
801
779
  node: LevelFields,
802
780
  subnodes: SemanticNode[],
@@ -816,8 +794,6 @@ const checkSubnodes = (
816
794
  return node.levelCorrect;
817
795
  };
818
796
 
819
- // TheoremNode.LevelCheckTemporal: the steps of the proof of a temporal theorem that must be
820
- // constant.
821
797
  const checkTemporalProof = (proof: ProofNode | undefined, check: LevelCheck) => {
822
798
  if (proof?.kind !== "NonLeafProof") return;
823
799
  proof.steps.forEach((step) => {
@@ -840,7 +816,6 @@ const checkTemporalProof = (proof: ProofNode | undefined, check: LevelCheck) =>
840
816
  });
841
817
  };
842
818
 
843
- // InstanceNode.levelCheck.
844
819
  const checkInstance = (node: InstanceNode, iteration: number, check: LevelCheck) => {
845
820
  if (node.levelChecked >= iteration) return node.levelCorrect;
846
821
  node.levelChecked = iteration;
@@ -1121,7 +1096,6 @@ const checkLevel = (node: SemanticNode, iteration: number, check: LevelCheck): b
1121
1096
  node.levelChecked = iteration;
1122
1097
  const isBodyCorrect = checkLevel(node.body, iteration, check);
1123
1098
  const isDefinitionCorrect = !node.definition || checkLevel(node.definition, iteration, check);
1124
- // AssumeNode's getters return its expression's levels.
1125
1099
  node.level = node.body.level;
1126
1100
  shareLevels(node, node.body);
1127
1101
  if (node.level !== CONSTANT_LEVEL) {
@@ -1134,8 +1108,7 @@ const checkLevel = (node: SemanticNode, iteration: number, check: LevelCheck): b
1134
1108
  return isBodyCorrect && isDefinitionCorrect;
1135
1109
  }
1136
1110
  case "Theorem": {
1137
- // TheoremNode declares its own levelChecked, so levelCheckSubnodes still runs on the
1138
- // theorem's definition, or its statement when it has none, and its proof.
1111
+ // SANY's TheoremNode declares its own levelChecked, so levelCheckSubnodes still runs on it.
1139
1112
  if (node.levelChecked >= iteration) return true;
1140
1113
  const isCorrect = checkSubnodes(
1141
1114
  node,
@@ -1191,7 +1164,6 @@ const checkLevel = (node: SemanticNode, iteration: number, check: LevelCheck): b
1191
1164
  node.goal.level,
1192
1165
  );
1193
1166
  [node.goal, ...node.assumptions].forEach((part) => mergeLevels(node, part));
1194
- // LevelNode.addTemporalLevelConstraintToConstants.
1195
1167
  if (node.levelCorrect) {
1196
1168
  node.levelParams.forEach((param) => {
1197
1169
  if (param.kind === "OpDecl" && param.declKind === CONSTANT_DECL_KIND) {
package/src/sany/lexer.ts CHANGED
@@ -1,7 +1,6 @@
1
1
  import { TlaError } from "../errors";
2
2
 
3
- // An emulation of the token manager that JavaCC generates for SANY's grammar, javacc/tla+.jj: the
4
- // tokens it produces, their kinds in TLAplusParserConstants order, and their positions.
3
+ // An emulation of the token manager that JavaCC generates for SANY's grammar, javacc/tla+.jj.
5
4
 
6
5
  export interface SanyToken {
7
6
  kind: number;
@@ -11,8 +10,6 @@ export interface SanyToken {
11
10
  next: SanyToken | undefined;
12
11
  }
13
12
 
14
- // The token kinds, in the order of TLAplusParserConstants, each with the literal images that
15
- // produce it. JavaCC breaks a tie between matches of the same length by this order.
16
13
  const KINDS: [string, ...string[]][] = [
17
14
  ["EOF"],
18
15
  ["BEGIN_PRAGMA", "--->"],
@@ -228,7 +225,6 @@ const KIND_INDEXES = new Map(
228
225
  KIND_NAMES.map((name, kind): [string, number] => [name, kind]).reverse(),
229
226
  );
230
227
 
231
- // The anonymous infix operators share the name "infix", which no caller looks up.
232
228
  export const getKind = (name: string) => {
233
229
  const kind = KIND_INDEXES.get(name);
234
230
  if (kind === undefined) throw new TlaError(`Unknown SANY token kind ${name}`);
@@ -241,7 +237,7 @@ const LITERALS = new Map(
241
237
  const LONGEST_LITERAL = Math.max(...[...LITERALS.keys()].map((image) => image.length));
242
238
  const LITERAL_LENGTHS = Array.from(
243
239
  { length: LONGEST_LITERAL },
244
- (_, index) => LONGEST_LITERAL - index,
240
+ (_value, index) => LONGEST_LITERAL - index,
245
241
  );
246
242
 
247
243
  const BEGIN_MODULE = /----+ *MODULE/y;
@@ -261,7 +257,6 @@ const BAND_PATTERNS = getJunctionPatterns(String.raw`\.\/\\`);
261
257
  const BOR_PATTERNS = getJunctionPatterns(String.raw`\.\\\/`);
262
258
  const STEP = String.raw`<(?:[0-9]+|\+|\*)>`;
263
259
 
264
- // The tokens of the SPEC lexical state that are not literals, with their kinds.
265
260
  const SPEC_PATTERNS: [string, RegExp[]][] = [
266
261
  ["_BM0", [BEGIN_MODULE]],
267
262
  ["SEPARATOR", [/----+/y]],
@@ -278,7 +273,6 @@ const SPEC_PATTERNS: [string, RegExp[]][] = [
278
273
  ["UnnumberedStepLexeme", [new RegExp(String.raw`${STEP}(?:\*\.*|-\.*|\.+)`, "y")]],
279
274
  ];
280
275
 
281
- // The tokens of the DEFAULT and PRAGMA lexical states, which skip every other character.
282
276
  const DEFAULT_PATTERNS: [string, RegExp[]][] = [
283
277
  ["BEGIN_PRAGMA", [/--->/y]],
284
278
  ["_BM1", [BEGIN_MODULE]],
@@ -296,79 +290,78 @@ const getMatchLength = (pattern: RegExp, source: string, offset: number) => {
296
290
  return pattern.exec(source)?.[0].length ?? 0;
297
291
  };
298
292
 
299
- // The longest match at offset, the earliest kind among matches of that length.
293
+ interface TokenMatch {
294
+ kind: number;
295
+ length: number;
296
+ }
297
+
298
+ const getLongerMatch = (best: TokenMatch, match: TokenMatch) =>
299
+ match.length > best.length || (match.length === best.length && match.kind < best.kind)
300
+ ? match
301
+ : best;
302
+
300
303
  const matchPatterns = (patterns: [string, RegExp[]][], source: string, offset: number) =>
301
304
  patterns
302
305
  .map(([name, regexes]) => ({
303
306
  kind: getKind(name),
304
307
  length: Math.max(...regexes.map((regex) => getMatchLength(regex, source, offset))),
305
308
  }))
306
- .reduce(
307
- (best, match) =>
308
- match.length > best.length || (match.length === best.length && match.kind < best.kind)
309
- ? match
310
- : best,
311
- { kind: -1, length: 0 },
312
- );
309
+ .reduce(getLongerMatch, { kind: -1, length: 0 });
313
310
 
314
311
  const matchSpecToken = (source: string, offset: number) => {
315
312
  const literalLength = LITERAL_LENGTHS.find((length) =>
316
313
  LITERALS.has(source.slice(offset, offset + length)),
317
314
  );
318
315
  const pattern = matchPatterns(SPEC_PATTERNS, source, offset);
319
- if (literalLength === undefined) return pattern;
320
- const literal = {
321
- kind: LITERALS.get(source.slice(offset, offset + literalLength)) ?? -1,
322
- length: literalLength,
323
- };
324
- return literal.length > pattern.length ||
325
- (literal.length === pattern.length && literal.kind < pattern.kind)
326
- ? literal
327
- : pattern;
316
+ return literalLength === undefined
317
+ ? pattern
318
+ : getLongerMatch(pattern, {
319
+ kind: LITERALS.get(source.slice(offset, offset + literalLength)) ?? -1,
320
+ length: literalLength,
321
+ });
328
322
  };
329
323
 
330
324
  export const getTabStop = (column: number) => column + 8 - (column % 8);
331
325
 
332
- // SimpleCharStream.UpdateLineColumn: the line and column of each character, with tabs stopping
333
- // at multiples of 8.
334
326
  const getPositions = (source: string) => {
335
327
  const lines: number[] = [];
336
328
  const columns: number[] = [];
337
- const state = { line: 1, column: 0, isAfterCr: false, isAfterLf: false };
329
+ let line = 1;
330
+ let column = 0;
331
+ let isAfterCr = false;
332
+ let isAfterLf = false;
338
333
  for (const character of source) {
339
334
  for (let unit = 0; unit < character.length; unit++) {
340
- state.column++;
341
- if (state.isAfterLf) {
342
- state.isAfterLf = false;
343
- state.line++;
344
- state.column = 1;
345
- } else if (state.isAfterCr) {
346
- state.isAfterCr = false;
347
- if (character === "\n") state.isAfterLf = true;
335
+ column++;
336
+ if (isAfterLf) {
337
+ isAfterLf = false;
338
+ line++;
339
+ column = 1;
340
+ } else if (isAfterCr) {
341
+ isAfterCr = false;
342
+ if (character === "\n") isAfterLf = true;
348
343
  else {
349
- state.line++;
350
- state.column = 1;
344
+ line++;
345
+ column = 1;
351
346
  }
352
347
  }
353
- if (character === "\r") state.isAfterCr = true;
354
- else if (character === "\n") state.isAfterLf = true;
355
- else if (character === "\t") state.column = getTabStop(state.column - 1);
356
- lines.push(state.line);
357
- columns.push(state.column);
348
+ if (character === "\r") isAfterCr = true;
349
+ else if (character === "\n") isAfterLf = true;
350
+ else if (character === "\t") column = getTabStop(column - 1);
351
+ lines.push(line);
352
+ columns.push(column);
358
353
  }
359
354
  }
360
355
  return { lines, columns };
361
356
  };
362
357
 
363
- // The characters of a string literal that a string literal could still continue.
364
358
  const STRING_PREFIX = /"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y;
365
359
  const LITERAL_PREFIXES = new Set(
366
360
  [...LITERALS.keys()].flatMap((image) =>
367
- Array.from({ length: image.length - 1 }, (_, index) => image.slice(0, index + 1)),
361
+ Array.from({ length: image.length - 1 }, (_value, index) => image.slice(0, index + 1)),
368
362
  ),
369
363
  );
370
364
 
371
- // The characters JavaCC's token manager reads at offset while some token could still continue.
372
365
  const getTokenPrefix = (source: string, offset: number) => {
373
366
  let length = 0;
374
367
  while (LITERAL_PREFIXES.has(source.slice(offset, offset + length + 1))) length++;
@@ -378,12 +371,10 @@ const getTokenPrefix = (source: string, offset: number) => {
378
371
  );
379
372
  };
380
373
 
381
- // A lazy token stream over source, which returns SANY's message for the TokenMgrError JavaCC's
382
- // token manager throws at a character no token continues with, or at the end of the file in a
383
- // comment.
384
374
  export const createSanyLexer = (source: string) => {
385
375
  const positions = getPositions(source);
386
- const state = { offset: 0, mode: "DEFAULT" };
376
+ let nextOffset = 0;
377
+ let mode = "DEFAULT";
387
378
  const createToken = (kind: number, start: number, length: number): SanyToken => ({
388
379
  kind,
389
380
  image: source.slice(start, start + length),
@@ -393,8 +384,6 @@ export const createSanyLexer = (source: string) => {
393
384
  });
394
385
  // JavaCC places the end of the file at the file's last character.
395
386
  const getEndOfFile = () => createToken(getKind("EOF"), source.length - 1, 0);
396
- // The lexer read the characters from start to end, and TLAplusParser.parse reports the end of
397
- // the file in a token that starts on an earlier line as an open comment.
398
387
  const getLexicalError = (start: number, end: number, after: string) => {
399
388
  const index = end - 1;
400
389
  const line = positions.lines[index];
@@ -407,14 +396,12 @@ export const createSanyLexer = (source: string) => {
407
396
  ? formatLexicalError(line + 1, 0, undefined, after)
408
397
  : formatLexicalError(line, column + 1, undefined, after);
409
398
  };
410
- // A comment is a chain of MORE matches, which restarts after each nested comment bracket, and the
411
- // end of the file right after a bracket ends the token stream.
412
399
  const skipComment = () => {
413
- const start = state.offset;
400
+ const start = nextOffset;
414
401
  if (source.startsWith("\\*", start)) {
415
402
  const end = source.slice(start).search(/[\n\r]/);
416
403
  if (end === -1) return getLexicalError(start, source.length, "");
417
- state.offset += end + 1;
404
+ nextOffset += end + 1;
418
405
  return undefined;
419
406
  }
420
407
  let depth = 0;
@@ -430,41 +417,40 @@ export const createSanyLexer = (source: string) => {
430
417
  offset += 2;
431
418
  chainStart = offset;
432
419
  if (depth === 0) {
433
- state.offset = offset;
420
+ nextOffset = offset;
434
421
  return undefined;
435
422
  }
436
423
  } else offset++;
437
424
  }
438
- state.offset = offset;
425
+ nextOffset = offset;
439
426
  return chainStart === source.length ? undefined : getLexicalError(chainStart, offset, "");
440
427
  };
441
428
  const getSkippingToken = (patterns: [string, RegExp[]][]): SanyToken => {
442
- while (state.offset < source.length) {
443
- const match = matchPatterns(patterns, source, state.offset);
429
+ while (nextOffset < source.length) {
430
+ const match = matchPatterns(patterns, source, nextOffset);
444
431
  if (match.length > 0) {
445
- const token = createToken(match.kind, state.offset, match.length);
446
- state.offset += match.length;
447
- if (KIND_NAMES[match.kind].startsWith("_BM")) state.mode = "SPEC";
448
- if (KIND_NAMES[match.kind] === "BEGIN_PRAGMA") state.mode = "PRAGMA";
432
+ const token = createToken(match.kind, nextOffset, match.length);
433
+ nextOffset += match.length;
434
+ if (KIND_NAMES[match.kind].startsWith("_BM")) mode = "SPEC";
435
+ if (KIND_NAMES[match.kind] === "BEGIN_PRAGMA") mode = "PRAGMA";
449
436
  return token;
450
437
  }
451
- state.offset++;
438
+ nextOffset++;
452
439
  }
453
440
  return getEndOfFile();
454
441
  };
455
442
  const getNextToken = (): SanyToken | string => {
456
- if (state.mode === "DEFAULT") return getSkippingToken(DEFAULT_PATTERNS);
457
- if (state.mode === "PRAGMA") return getSkippingToken(PRAGMA_PATTERNS);
458
- while (state.offset < source.length) {
459
- const offset = state.offset;
460
- if (" \t\n\r".includes(source[offset])) state.offset++;
443
+ if (mode === "DEFAULT") return getSkippingToken(DEFAULT_PATTERNS);
444
+ if (mode === "PRAGMA") return getSkippingToken(PRAGMA_PATTERNS);
445
+ while (nextOffset < source.length) {
446
+ const offset = nextOffset;
447
+ if (" \t\n\r".includes(source[offset])) nextOffset++;
461
448
  else if (source.startsWith("(*", offset) || source.startsWith("\\*", offset)) {
462
449
  const error = skipComment();
463
450
  if (error !== undefined) return error;
464
451
  } else {
465
452
  const match = matchSpecToken(source, offset);
466
453
  if (match.length === 0) {
467
- // JavaCC reads on while a token could continue, and one more character.
468
454
  const prefix = getTokenPrefix(source, offset);
469
455
  const end = Math.min(offset + prefix.length + 1, source.length);
470
456
  const read = source.slice(offset, end);
@@ -472,7 +458,7 @@ export const createSanyLexer = (source: string) => {
472
458
  return getLexicalError(offset, end, after);
473
459
  }
474
460
  const token = createToken(match.kind, offset, match.length);
475
- state.offset += match.length;
461
+ nextOffset += match.length;
476
462
  return token;
477
463
  }
478
464
  }
@@ -481,7 +467,6 @@ export const createSanyLexer = (source: string) => {
481
467
  return getNextToken;
482
468
  };
483
469
 
484
- // JavaCC's TokenMgrError.addEscapes, which escapes the characters of a lexical error's message.
485
470
  const LEXEME_ESCAPES = new Map([
486
471
  ["\b", "\\b"],
487
472
  ["\t", "\\t"],
@@ -502,8 +487,6 @@ export const escapeLexeme = (text: string) =>
502
487
  (character === "\0" ? "" : `\\u${character.charCodeAt(0).toString(16).padStart(4, "0")}`),
503
488
  );
504
489
 
505
- // TokenMgrError.LexicalError: the character the lexer stopped at, or the end of the file, and the
506
- // characters of the token it had read.
507
490
  export const formatLexicalError = (
508
491
  line: number,
509
492
  column: number,
@@ -512,8 +495,6 @@ export const formatLexicalError = (
512
495
  ) =>
513
496
  `Lexical error at line ${line}, column ${column}. Encountered: ${character === undefined ? "<EOF> " : `"${escapeLexeme(character)}" (${character.charCodeAt(0)}), `}after : "${escapeLexeme(after)}"`;
514
497
 
515
- // TLC 1.7.4's lexer, which JavaCC generated without UNICODE_INPUT, reads a character past U+00FF
516
- // outside a comment by its low byte, and stops at one whose low byte is below 0x80.
517
498
  export const getSany174LexicalError = (source: string) => {
518
499
  const readToken = createSanyLexer(source);
519
500
  for (
@@ -7,10 +7,8 @@ import {
7
7
  type SemanticNode,
8
8
  } from "./nodes";
9
9
 
10
- // A port of SANY's tla2sany.linter.Linter, which warns about a record field named like a
11
- // definition or declaration of the module.
10
+ // A port of SANY's tla2sany.linter.Linter.
12
11
 
13
- // SemanticNode.getChildren.
14
12
  const getChildren = (node: SemanticNode): (SemanticNode | undefined)[] => {
15
13
  switch (node.kind) {
16
14
  case "OpAppl":
@@ -35,7 +33,6 @@ const getChildren = (node: SemanticNode): (SemanticNode | undefined)[] => {
35
33
  }
36
34
  };
37
35
 
38
- // Operators whose values are sets of values that a record field may range over.
39
36
  const SET_OPERATORS = new Map([
40
37
  ["Integers", "Int"],
41
38
  ["Naturals", "Nat"],
@@ -43,8 +40,6 @@ const SET_OPERATORS = new Map([
43
40
  ["Reals", "Reals"],
44
41
  ]);
45
42
 
46
- // Linter.isBuiltFromDeclarations: whether an expression applies a declared or bound symbol, BOOLEAN
47
- // or a standard set of numbers, directly or through the definitions it applies.
48
43
  const isBuiltFromDeclarations = (node: SemanticNode | undefined) => {
49
44
  const visited = new Set<SemanticNode>();
50
45
  const visit = (current: SemanticNode | undefined): boolean => {
@@ -74,7 +69,6 @@ const getFieldName = (pair: OpApplNode) => {
74
69
  return name?.kind === "String" ? name : undefined;
75
70
  };
76
71
 
77
- // Records.sameDomain, given that SANY rejects a record with two fields of the same name.
78
72
  const getDomain = (record: OpApplNode) =>
79
73
  JSON.stringify([
80
74
  record.operands.length,
@@ -83,7 +77,6 @@ const getDomain = (record: OpApplNode) =>
83
77
  .sort(),
84
78
  ]);
85
79
 
86
- // ModuleNode.getExtendedModuleSet(true).
87
80
  const getExtendedModules = (module: ModuleNode, found = new Set<ModuleNode>()) => {
88
81
  module.extendees.forEach((extendee) => {
89
82
  if (found.has(extendee)) return;
@@ -93,7 +86,6 @@ const getExtendedModules = (module: ModuleNode, found = new Set<ModuleNode>()) =
93
86
  return found;
94
87
  };
95
88
 
96
- // Linter.lintRecords: the warnings for the records of a module.
97
89
  export const lintSanyModule = (module: ModuleNode): SanyMessage[] => {
98
90
  const linted = module.records.map((record) => ({
99
91
  domain: getDomain(record),
@@ -156,8 +156,7 @@ CopiesIn(e, B) ==
156
156
  5 Dec 98 : Initial version.
157
157
  `;
158
158
 
159
- // The standard modules of SANY's tla2sany/StandardModules (tla2tools.jar 2026.10.28), verbatim,
160
- // since the XML that SANY exports locates every node of them and keeps their comments.
159
+ // Verbatim from tla2tools.jar 2026.10.28, since SANY's XML locates every node and keeps comments.
161
160
  export const SANY_STANDARD_MODULES = new Map([
162
161
  ["Bags", BAGS],
163
162
  [
@@ -1289,8 +1288,6 @@ _TLCTrace ==
1289
1288
  ],
1290
1289
  ]);
1291
1290
 
1292
- // The standard modules of TLC 1.7.4's tla2tools.jar, which has none of the later ones and older
1293
- // Bags, Randomization and Toolbox modules.
1294
1291
  export const SANY_174_STANDARD_MODULES = new Map([
1295
1292
  ...[...SANY_STANDARD_MODULES].filter(([name]) =>
1296
1293
  ["FiniteSets", "Integers", "Naturals", "RealTime", "Reals", "Sequences", "TLC"].includes(name),
@@ -1393,6 +1390,5 @@ _TEPosition ==
1393
1390
  ],
1394
1391
  ]);
1395
1392
 
1396
- // The standard modules of the SANY of a TLC.
1397
1393
  export const getSanyStandardModules = (version: TlcVersion = "master") =>
1398
1394
  version === "1.7.4" ? SANY_174_STANDARD_MODULES : SANY_STANDARD_MODULES;