dive-model 0.1.0

Binding a TLA+ specification to its TLC model configuration
Documentation
//! Names TLC interns before and while SANY parses, measured on the pinned
//! `tla2tools.jar` (`tlc-2026.10.06.014338`) with `acceptance/ModelDump.java`.

/// The names in `util.UniqueString`'s table after the configuration's values
/// and before the first module token: the built-in operators SANY's
/// `Context.initialize` and the lexer's operator table create, in token order.
/// The same on every model of the corpus.
pub(crate) const PREFIX: &[&str] = &[
    "STRING",
    "FALSE",
    "TRUE",
    "BOOLEAN",
    "=",
    "/=",
    ".",
    "'",
    "\\lnot",
    "\\neg",
    "\\land",
    "\\lor",
    "\\equiv",
    "=>",
    "SUBSET",
    "UNION",
    "DOMAIN",
    "\\subseteq",
    "\\in",
    "\\notin",
    "\\",
    "\\intersect",
    "\\union",
    "\\times",
    "~>",
    "[]",
    "<>",
    "ENABLED",
    "UNCHANGED",
    "\\cdot",
    "-+->",
    "$AngleAct",
    "$BoundedChoose",
    "$BoundedExists",
    "$BoundedForall",
    "$CartesianProd",
    "$Case",
    "$ConjList",
    "$DisjList",
    "$Except",
    "$FcnApply",
    "$FcnConstructor",
    "$IfThenElse",
    "$NonRecursiveFcnSpec",
    "$Pair",
    "$RcdConstructor",
    "$RcdSelect",
    "$RecursiveFcnSpec",
    "$Seq",
    "$SetEnumerate",
    "$SetOfAll",
    "$SetOfFcns",
    "$SetOfRcds",
    "$SF",
    "$SquareAct",
    "$SubsetOf",
    "$TemporalExists",
    "$TemporalForall",
    "$TemporalWhile",
    "$Tuple",
    "$UnboundedChoose",
    "$UnboundedExists",
    "$UnboundedForall",
    "$WF",
    "$Nop",
    "$Qed",
    "$Pfcase",
    "$Have",
    "$Take",
    "$Pick",
    "$Witness",
    "$Suffices",
    "***I do not exist***",
    "--TLA+ BUILTINS--",
    "Formal_0",
    "Formal_1",
    "Formal_2",
    "[",
    "^",
    "/",
    "*",
    "-",
    "-.",
    "+",
    "^+",
    "^*",
    "^#",
    "<",
    "\\leq",
    ">",
    "\\geq",
    "...",
    "..",
    "|",
    "||",
    "&&",
    "&",
    "$$",
    "$",
    "??",
    "%%",
    "%",
    "##",
    "++",
    "--",
    "**",
    "//",
    "^^",
    "@@",
    "!!",
    "|-",
    "|=",
    "-|",
    "=|",
    "<:",
    ":>",
    ":=",
    "::=",
    "\\oplus",
    "\\ominus",
    "\\odot",
    "\\oslash",
    "\\otimes",
    "\\uplus",
    "\\sqcap",
    "\\sqcup",
    "\\div",
    "\\wr",
    "\\star",
    "\\o",
    "\\bigcirc",
    "\\bullet",
    "\\prec",
    "\\succ",
    "\\preceq",
    "\\succeq",
    "\\sim",
    "\\simeq",
    "\\ll",
    "\\gg",
    "\\asymp",
    "\\subset",
    "\\supset",
    "\\supseteq",
    "\\approx",
    "\\cong",
    "\\sqsubset",
    "\\sqsubseteq",
    "\\sqsupset",
    "\\sqsupseteq",
    "\\doteq",
    "\\propto",
    "~",
    "¬",
    "□",
    "◇",
    "/\\",
    "∧",
    "\\/",
    "∨",
    "<=>",
    "≡",
    "⇔",
    "#",
    "≠",
    "<=",
    "=<",
    "≤",
    ">=",
    "≥",
    "\\X",
    "×",
    "\\cap",
    "∩",
    "\\cup",
    "∪",
    "\\circ",
    "∘",
    "(+)",
    "⊕",
    "(-)",
    "⊖",
    "(.)",
    "⊙",
    "(/)",
    "⊘",
    "(\\X)",
    "⊗",
    "≈",
    "≔",
    "≍",
    "◯",
    "⩴",
    "●",
    "⋅",
    "≅",
    "÷",
    "≐",
    "‥",
    "…",
    "‼",
    "≫",
    "⇒",
    "∈",
    "⫤",
    "↝",
    "≪",
    "⊣",
    "∉",
    "⇸",
    "≺",
    "⪯",
    "∝",
    "⁇",
    "⊨",
    "⊢",
    "∼",
    "≃",
    "⊓",
    "⊔",
    "⊏",
    "⊑",
    "⊐",
    "⊒",
    "⋆",
    "⊂",
    "⊆",
    "≻",
    "⪰",
    "⊃",
    "⊇",
    "⊎",
    "‖",
    "≀",
    "⁺",
    "@",
];

/// The syntax-node kind names SANY interns when it builds the first syntax
/// tree node, right after the root module's header line
/// (`tla2sany.st.SyntaxTreeConstants`).
pub(crate) const NODE_KINDS: &[&str] = &[
    "Not a node",
    "N_ActDecl",
    "N_ActionExpr",
    "N_AssumeDecl",
    "N_AssumeProve",
    "N_Assumption",
    "N_BeginModule",
    "N_Body",
    "N_BoundedQuant",
    "N_Case",
    "N_CaseArm",
    "N_CaseStatement",
    "N_ChooseStatement",
    "N_ConjItem",
    "N_ConjList",
    "N_ConsDecl",
    "N_DisjItem",
    "N_DisjList",
    "N_EndModule",
    "N_Except",
    "N_ExceptComponent",
    "N_ExceptSpec",
    "N_Times",
    "N_Extends",
    "N_FairnessExpr",
    "N_FcnAppl",
    "N_FcnConst",
    "N_FieldSet",
    "N_FieldVal",
    "N_FunctionDefinition",
    "N_FunctionParam",
    "N_GeneralId",
    "N_GenInfixOp",
    "N_GenNonExpPrefixOp",
    "N_GenPostfixOp",
    "N_GenPrefixOp",
    "N_IdentDecl",
    "N_Real",
    "N_IdentifierTuple",
    "N_IdentLHS",
    "N_IdPrefix",
    "N_IdPrefixElement",
    "N_IfThenElse",
    "N_InfixDecl",
    "N_InfixExpr",
    "N_InfixLHS",
    "N_InfixOp",
    "N_InnerProof",
    "N_Instance",
    "N_NonLocalInstance",
    "N_Integer",
    "N_LeafProof",
    "N_LetDefinitions",
    "N_LetIn",
    "N_MaybeBound",
    "N_Module",
    "N_ModuleDefinition",
    "N_NonExpPrefixOp",
    "N_Number",
    "N_NumberedAssumeProve",
    "N_OpApplication",
    "N_OpArgs",
    "N_OperatorDefinition",
    "N_OtherArm",
    "N_ParamDecl",
    "N_ParamDeclaration",
    "N_ParenExpr",
    "N_PostfixDecl",
    "N_PostfixExpr",
    "N_PostfixLHS",
    "N_PostfixOp",
    "N_PrefixDecl",
    "N_PrefixExpr",
    "N_PrefixLHS",
    "N_PrefixOp",
    "N_Proof",
    "N_ProofLet",
    "N_ProofName",
    "N_ProofStatement",
    "N_ProofStep",
    "N_QEDStep",
    "N_QuantBound",
    "N_RcdConstructor",
    "N_RecordComponent",
    "N_SetEnumerate",
    "N_SetOfAll",
    "N_SetOfFcns",
    "N_SetOfRcds",
    "N_String",
    "N_SubsetOf",
    "N_Substitution",
    "N_TempDecl",
    "N_Theorem",
    "N_Tuple",
    "N_UnBoundedOrBoundedChoose",
    "N_UnboundedQuant",
    "N_VariableDeclaration",
    "Token =",
    "Token \\in",
    "N_NewSymb",
    "N_Lambda",
    "N_Recursive",
    "N_Label",
    "N_StructOp",
    "N_NumerableStep",
    "N_TerminalProof",
    "N_UseOrHide",
    "N_NonExprBody",
    "N_DefStep",
    "N_HaveStep",
    "N_TakeStep",
    "N_WitnessStep",
    "N_PickStep",
    "N_CaseStep",
    "N_AssertStep",
];