adesha 0.1.0__tar.gz

adesha-0.1.0/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

adesha-0.1.0/PKG-INFO

@@ -0,0 +1,119 @@
+Metadata-Version: 2.4
+Name: adesha
+Version: 0.1.0
+Summary: A Sanskrit programming language — from Pāṇini to silicon.
+Author: Ayush Bhoi
+License-Expression: Apache-2.0
+Project-URL: Homepage, https://github.com/ayushbhoi08-lab/adesha
+Project-URL: Repository, https://github.com/ayushbhoi08-lab/adesha
+Project-URL: Documentation, https://ayushbhoi08-lab.github.io/adesha/
+Keywords: sanskrit,programming-language,interpreter,education,panini,devanagari
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Education
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Topic :: Education
+Classifier: Topic :: Software Development :: Interpreters
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: license-file
+
+# Ādeśa (आदेश)
+
+**A Sanskrit programming language — from Pāṇini to silicon.**
+
+Ādeśa ("command") is a small interpreted language whose keywords are real Sanskrit imperatives, written in the pure-ASCII [Harvard-Kyoto](https://en.wikipedia.org/wiki/Harvard-Kyoto) convention so they type on any keyboard. When you write `vada` you are writing वद — the loṭ lakāra imperative *"Speak!"* — and the machine obeys.
+
+```text
+$ python adesha.py
+Ādeśa shell (Harvard-Kyoto) — type 'samApti' to quit.
+>> vada namaste lokAH
+namaste lokAH
+>> punaH tri vada punarukti
+punarukti
+punarukti
+punarukti
+```
+
+`punaH tri` — "again, three times." Numbers can be Sanskrit words (`eka`, `dvi`, `tri`, … `aSTottarazata` = 108) or digits; both work everywhere.
+
+## Why Sanskrit?
+
+Not decoration — lineage. Pāṇini's **Aṣṭādhyāyī** (~500 BCE) is a formal generative grammar of ~4,000 ordered rewrite rules with meta-rules and context-sensitive transformations — structurally the same device as the BNF notation that defines modern programming languages (computer scientists sometimes call it the *Pāṇini–Backus form*). **Piṅgala's** Chandaḥśāstra (~200 BCE) encoded poetic meter as sequences of light (laghu) and heavy (guru) syllables — a binary notation, two millennia early. Sanskrit is arguably the only human language that was *formally specified*, the way programming languages are. Ādeśa is built on that inheritance: Sanskrit **structure and vocabulary** — never a claim that the machine "understands" Sanskrit meaning.
+
+## The language in one screen
+
+```text
+# lesson0_final.adesha — my first program
+sthApaya nama rAma          # "establish!"  — set a variable
+vada namaste nama           # "speak!"      — print (namaste rAma)
+
+yadi nama == rAma           # "if"
+    vada sAdhu              # blocks end with iti ("thus")
+anyathA                     # "otherwise"
+    vada anyat
+iti
+
+vidhi ghata n               # "procedure"  — define a function
+    yadi n <= eka
+        dehi 1              # "give!"      — return a value
+    iti
+    dehi n * ghata(n - 1)
+iti
+gaNaya ghata(paJca)         # "compute!"   — 120 (recursion works)
+
+samUha s                    # "collection" — make a list
+yojaya s Adi                # "join!"      — append
+vada s[eka]                 # 1-based indexing: eka is the first element
+
+mudrA nama                  # "seal!"      — 108-bit integrity fingerprint
+```
+
+Booleans are `satya`/`asatya`. Logic is `ca`/`vA`/`na` (and/or/not). Errors speak both languages with a numbered `doSa` code, a line number, and a did-you-mean:
+
+```text
+>> vad namaste
+doSa-001: ajYAta Adeza 'vad' (did you mean: vada?) — unknown command 'vad' (did you mean: vada?)
+```
+
+Every keyword is registered in three spellings: Harvard-Kyoto canonical (`sthApaya`), lowercase (`sthapaya`), and Devanagari (`स्थापय`).
+
+## Sealed scripts
+
+`adesha seal file.adesha` stamps a script with its own fingerprint footer; `adesha parIkSA file.adesha` later answers **siddha** (intact, exit 0) or **bhraSTa** (tampered, exit 1). Like a wax seal on a letter — tamper-evident homework, lesson files, and documents.
+
+## Two layers, honestly labeled
+
+Ādeśa is a two-layer stack:
+
+- **`adesha/`** — the high-level language (this repo, fully self-contained, Python stdlib only).
+- **`aos_asm.py`** — a low-level layer whose FOLD/lane operations mirror a private RNS chip design (the A0S project). It runs here on a **software model**. The chip-true `lane_residue()` in this repo was verified against the chip's RTL by co-simulation: **1,000/1,000 randomized inputs agree bit-for-bit** across the built-in mirror, the verified golden model, and the Verilog core under Icarus Verilog — see [tests/reports/c2_parity_report.md](tests/reports/c2_parity_report.md). The chip design itself is not in this repo, and nothing here requires it.
+
+Two different numbers, two different jobs: `mudrA` is a 108-bit *software* integrity fingerprint (mod M107); the *chip lane residue* (mod 12289) reflects Harvard-Kyoto prosodic weight and is deliberately **not** an integrity primitive.
+
+## Try it
+
+```bash
+git clone https://github.com/ayushbhoi08-lab/adesha.git
+cd adesha
+python adesha.py                       # REPL
+python adesha.py examples/zloka_mudra.adesha   # seal a Bhagavad Gītā verse
+python adesha.py --trace run examples/function.adesha  # watch it execute
+python -m pytest tests -q              # the test suite
+```
+
+The browser playground (Pyodide, zero install) lives in [playground/](playground/) — serve it with `python -m http.server` from that folder, or open it directly at **https://ayushbhoi08-lab.github.io/adesha/**.
+
+New to programming? Start with [Lesson Zero](docs/lessons/lesson0.md) — five steps that teach one programming concept and one real Sanskrit grammar note at a time.
+
+## Status
+
+Active, early, and honest about it. The language core (tokenizer, expression parser, blocks, functions with recursion, lists, dual-language errors, seal/verify CLI) is complete and tested. On the roadmap: a sandhi-based macro layer (Pāṇini's own mechanism as a language feature), an aṣṭa-dik turtle for teaching, and offline Sanskrit voice commands. This project makes **no claims** of natural-language understanding, translation, or NLP.
+
+## License
+
+[Apache-2.0](LICENSE)

adesha-0.1.0/README.md

@@ -0,0 +1,95 @@
+# Ādeśa (आदेश)
+
+**A Sanskrit programming language — from Pāṇini to silicon.**
+
+Ādeśa ("command") is a small interpreted language whose keywords are real Sanskrit imperatives, written in the pure-ASCII [Harvard-Kyoto](https://en.wikipedia.org/wiki/Harvard-Kyoto) convention so they type on any keyboard. When you write `vada` you are writing वद — the loṭ lakāra imperative *"Speak!"* — and the machine obeys.
+
+```text
+$ python adesha.py
+Ādeśa shell (Harvard-Kyoto) — type 'samApti' to quit.
+>> vada namaste lokAH
+namaste lokAH
+>> punaH tri vada punarukti
+punarukti
+punarukti
+punarukti
+```
+
+`punaH tri` — "again, three times." Numbers can be Sanskrit words (`eka`, `dvi`, `tri`, … `aSTottarazata` = 108) or digits; both work everywhere.
+
+## Why Sanskrit?
+
+Not decoration — lineage. Pāṇini's **Aṣṭādhyāyī** (~500 BCE) is a formal generative grammar of ~4,000 ordered rewrite rules with meta-rules and context-sensitive transformations — structurally the same device as the BNF notation that defines modern programming languages (computer scientists sometimes call it the *Pāṇini–Backus form*). **Piṅgala's** Chandaḥśāstra (~200 BCE) encoded poetic meter as sequences of light (laghu) and heavy (guru) syllables — a binary notation, two millennia early. Sanskrit is arguably the only human language that was *formally specified*, the way programming languages are. Ādeśa is built on that inheritance: Sanskrit **structure and vocabulary** — never a claim that the machine "understands" Sanskrit meaning.
+
+## The language in one screen
+
+```text
+# lesson0_final.adesha — my first program
+sthApaya nama rAma          # "establish!"  — set a variable
+vada namaste nama           # "speak!"      — print (namaste rAma)
+
+yadi nama == rAma           # "if"
+    vada sAdhu              # blocks end with iti ("thus")
+anyathA                     # "otherwise"
+    vada anyat
+iti
+
+vidhi ghata n               # "procedure"  — define a function
+    yadi n <= eka
+        dehi 1              # "give!"      — return a value
+    iti
+    dehi n * ghata(n - 1)
+iti
+gaNaya ghata(paJca)         # "compute!"   — 120 (recursion works)
+
+samUha s                    # "collection" — make a list
+yojaya s Adi                # "join!"      — append
+vada s[eka]                 # 1-based indexing: eka is the first element
+
+mudrA nama                  # "seal!"      — 108-bit integrity fingerprint
+```
+
+Booleans are `satya`/`asatya`. Logic is `ca`/`vA`/`na` (and/or/not). Errors speak both languages with a numbered `doSa` code, a line number, and a did-you-mean:
+
+```text
+>> vad namaste
+doSa-001: ajYAta Adeza 'vad' (did you mean: vada?) — unknown command 'vad' (did you mean: vada?)
+```
+
+Every keyword is registered in three spellings: Harvard-Kyoto canonical (`sthApaya`), lowercase (`sthapaya`), and Devanagari (`स्थापय`).
+
+## Sealed scripts
+
+`adesha seal file.adesha` stamps a script with its own fingerprint footer; `adesha parIkSA file.adesha` later answers **siddha** (intact, exit 0) or **bhraSTa** (tampered, exit 1). Like a wax seal on a letter — tamper-evident homework, lesson files, and documents.
+
+## Two layers, honestly labeled
+
+Ādeśa is a two-layer stack:
+
+- **`adesha/`** — the high-level language (this repo, fully self-contained, Python stdlib only).
+- **`aos_asm.py`** — a low-level layer whose FOLD/lane operations mirror a private RNS chip design (the A0S project). It runs here on a **software model**. The chip-true `lane_residue()` in this repo was verified against the chip's RTL by co-simulation: **1,000/1,000 randomized inputs agree bit-for-bit** across the built-in mirror, the verified golden model, and the Verilog core under Icarus Verilog — see [tests/reports/c2_parity_report.md](tests/reports/c2_parity_report.md). The chip design itself is not in this repo, and nothing here requires it.
+
+Two different numbers, two different jobs: `mudrA` is a 108-bit *software* integrity fingerprint (mod M107); the *chip lane residue* (mod 12289) reflects Harvard-Kyoto prosodic weight and is deliberately **not** an integrity primitive.
+
+## Try it
+
+```bash
+git clone https://github.com/ayushbhoi08-lab/adesha.git
+cd adesha
+python adesha.py                       # REPL
+python adesha.py examples/zloka_mudra.adesha   # seal a Bhagavad Gītā verse
+python adesha.py --trace run examples/function.adesha  # watch it execute
+python -m pytest tests -q              # the test suite
+```
+
+The browser playground (Pyodide, zero install) lives in [playground/](playground/) — serve it with `python -m http.server` from that folder, or open it directly at **https://ayushbhoi08-lab.github.io/adesha/**.
+
+New to programming? Start with [Lesson Zero](docs/lessons/lesson0.md) — five steps that teach one programming concept and one real Sanskrit grammar note at a time.
+
+## Status
+
+Active, early, and honest about it. The language core (tokenizer, expression parser, blocks, functions with recursion, lists, dual-language errors, seal/verify CLI) is complete and tested. On the roadmap: a sandhi-based macro layer (Pāṇini's own mechanism as a language feature), an aṣṭa-dik turtle for teaching, and offline Sanskrit voice commands. This project makes **no claims** of natural-language understanding, translation, or NLP.
+
+## License
+
+[Apache-2.0](LICENSE)

adesha-0.1.0/adesha/__init__.py

@@ -0,0 +1,2 @@
+# -*- coding: utf-8 -*-
+"""Ādeśa — Sanskrit-imperative programming language (high-level layer)."""

adesha-0.1.0/adesha/errors.py

@@ -0,0 +1,113 @@
+# -*- coding: utf-8 -*-
+"""
+doSa (दोष, "fault/error") system — A0.3.
+
+All interpreter errors flow through here.  Every doSa has:
+  - a three-digit numeric code
+  - a Sanskrit line (Harvard-Kyoto)
+  - an English line
+  - optional position ([pankti L] where pankti = "line")
+
+Format:
+    doSa-001 [pankti 7]: ajYAta Adeza "vad" — unknown command "vad" (did you mean: vada?)
+
+Public API:
+    DosA                    the one exception that crosses run_line -> REPL/script
+    raise_dosa(code, ...)   build and raise a DosA
+    suggest(word, names)    nearest match within edit distance <= 2, or ""
+"""
+
+# ---------------------------------------------------------------------------
+# doSa code table
+# Values are (sanskrit_template, english_template).
+# Templates are str.format_map()-style with named keys.
+# ---------------------------------------------------------------------------
+_TABLE = {
+    1:  ("ajYAta Adeza {word!r}{hint}",
+         "unknown command {word!r}{hint}"),
+    2:  ("varNa-doSa: {msg}",
+         "character/token error: {msg}"),
+    3:  ("gaNanA-doSa (vyAkaraNa): {msg}",
+         "expression parse error: {msg}"),
+    4:  ("gaNanA-doSa (kAla): {msg}",
+         "runtime error: {msg}"),
+    5:  ("yadi: dvibindu AvazyakaH  (yadi n > 3 : vada bahu)",
+         "yadi: ':' is required  (yadi n > 3 : vada bahu)"),
+    6:  ("Adeza-tarka riktaH: {cmd!r} ko tarka cAhie",
+         "command {cmd!r} needs an argument"),
+    7:  ("punaH: saMkhyA AvazyakA — {word!r} milA",
+         "punaH: count must be an integer, got {word!r}"),
+    8:  ("iti asthAna {msg}",
+         "unmatched iti — {msg}"),
+    9:  ("iti hInaH {word!r} prabandhaH",
+         "missing iti for {word!r} block"),
+    10: ("anyathA asthAne — yadi bahire",
+         "anyathA outside yadi block"),
+    11: ("vidhi-doSa: {msg}",
+         "function error: {msg}"),
+    12: ("samUha-doSa: {msg}",
+         "list error: {msg}"),
+    13: ("anukrama-doSa: {msg}",
+         "index error: {msg}"),
+    99: ("AntarikA-doSa: {msg}",
+         "internal error: {msg}"),
+}
+
+
+# ---------------------------------------------------------------------------
+# Edit distance (Levenshtein) for did-you-mean
+# ---------------------------------------------------------------------------
+def _edit_distance(a, b):
+    la, lb = len(a), len(b)
+    # small optimisation: bail early if lengths differ by more than 2
+    if abs(la - lb) > 2:
+        return abs(la - lb)
+    prev = list(range(lb + 1))
+    for i, ca in enumerate(a, 1):
+        curr = [i] + [0] * lb
+        for j, cb in enumerate(b, 1):
+            curr[j] = min(
+                prev[j] + 1,
+                curr[j - 1] + 1,
+                prev[j - 1] + (0 if ca == cb else 1),
+            )
+        prev = curr
+    return prev[lb]
+
+
+def suggest(word, candidates, max_dist=2):
+    """Return ' (did you mean: X?)' if a candidate is within max_dist, else ''."""
+    best, best_d = None, max_dist + 1
+    for c in candidates:
+        d = _edit_distance(word.lower(), c.lower())
+        if d < best_d:
+            best, best_d = c, d
+    return f" (did you mean: {best}?)" if best is not None else ""
+
+
+# ---------------------------------------------------------------------------
+# DosA exception
+# ---------------------------------------------------------------------------
+class DosA(Exception):
+    """The single exception that the REPL and script runner catch and display."""
+
+    def __init__(self, code, line=None, **kw):
+        self.code = code
+        self.line = line
+        self.kw = kw
+        super().__init__(str(self))
+
+    def __str__(self):
+        sk_tmpl, en_tmpl = _TABLE.get(self.code, ("doSa", "error"))
+        try:
+            sk = sk_tmpl.format_map(self.kw)
+            en = en_tmpl.format_map(self.kw)
+        except (KeyError, ValueError) as exc:
+            sk = en = f"(formatting error: {exc})"
+        pos = f" [pankti {self.line}]" if self.line else ""
+        return f"doSa-{self.code:03d}{pos}: {sk} — {en}"
+
+
+def raise_dosa(code, line=None, **kw):
+    """Build and immediately raise a DosA."""
+    raise DosA(code, line=line, **kw)