Skip to content

[spectec] Add period at the end of some sentences in the prose backend #2303

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
rossberg merged 1 commit into from
Oct 23, 2026
Merged

[spectec] Add period at the end of some sentences in the prose backend #2303

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions spectec/src/backend-prose/render.ml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1363,7 +1363,7 @@ let rec render_instr env algoname index depth instr =
match render_expr env arity with
| "" -> ""
| s ->
sprintf "\n\n%s%s Let %s be the arity of %s"
sprintf "\n\n%s%s Let %s be the arity of %s."
(repeat indent depth)
(render_order index depth)
s
Expand All @@ -1372,7 +1372,7 @@ let rec render_instr env algoname index depth instr =
let rendered_arg =
match atom_name with
| "HANDLER_" ->
sprintf "\n\n%s%s Let %s be the catch handler of %s"
sprintf "\n\n%s%s Let %s be the catch handler of %s."
(repeat indent depth)
(render_order index depth)
(render_expr env arg)
Expand Down
28 changes: 14 additions & 14 deletions spectec/test-prose/TEST.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1031,7 +1031,7 @@ The export :math:`(\mathsf{export}~{\mathit{name}}~{\mathit{externidx}})` is :re

#. Let :math:`L` be the topmost :math:`\mathsf{label}`.

#. Let :math:`n` be the arity of :math:`L`
#. Let :math:`n` be the arity of :math:`L`.

#. If :math:`{n'} = 0`, then:

Expand Down Expand Up @@ -1100,7 +1100,7 @@ The export :math:`(\mathsf{export}~{\mathit{name}}~{\mathit{externidx}})` is :re

1. Let :math:`f` be the topmost :math:`\mathsf{frame}`.

#. Let :math:`n` be the arity of :math:`f`
#. Let :math:`n` be the arity of :math:`f`.

#. Assert: Due to validation, there are at least :math:`n` values on the top of the stack.

Expand All @@ -1123,7 +1123,7 @@ The export :math:`(\mathsf{export}~{\mathit{name}}~{\mathit{externidx}})` is :re

a. Let :math:`f` be the topmost :math:`\mathsf{frame}`.

#. Let :math:`n` be the arity of :math:`f`
#. Let :math:`n` be the arity of :math:`f`.

#. Assert: Due to validation, there are at least :math:`n` values on the top of the stack.

Expand Down Expand Up @@ -6239,7 +6239,7 @@ The export :math:`(\mathsf{export}~{\mathit{name}}~{\mathit{externidx}})` is :re

#. Let :math:`L` be the topmost :math:`\mathsf{label}`.

#. Let :math:`n` be the arity of :math:`L`
#. Let :math:`n` be the arity of :math:`L`.

#. If :math:`{n'} = 0`, then:

Expand Down Expand Up @@ -6308,7 +6308,7 @@ The export :math:`(\mathsf{export}~{\mathit{name}}~{\mathit{externidx}})` is :re

1. Let :math:`f` be the topmost :math:`\mathsf{frame}`.

#. Let :math:`n` be the arity of :math:`f`
#. Let :math:`n` be the arity of :math:`f`.

#. Assert: Due to validation, there are at least :math:`n` values on the top of the stack.

Expand All @@ -6331,7 +6331,7 @@ The export :math:`(\mathsf{export}~{\mathit{name}}~{\mathit{externidx}})` is :re

a. Let :math:`f` be the topmost :math:`\mathsf{frame}`.

#. Let :math:`n` be the arity of :math:`f`
#. Let :math:`n` be the arity of :math:`f`.

#. Assert: Due to validation, there are at least :math:`n` values on the top of the stack.

Expand Down Expand Up @@ -18468,7 +18468,7 @@ The instruction sequence :math:`(\mathsf{block}~{\mathit{blocktype}}~{{\mathit{i

#. Let :math:`L` be the topmost :math:`\mathsf{label}`.

#. Let :math:`n` be the arity of :math:`L`
#. Let :math:`n` be the arity of :math:`L`.

#. If :math:`l = 0`, then:

Expand Down Expand Up @@ -18567,9 +18567,9 @@ The instruction sequence :math:`(\mathsf{block}~{\mathit{blocktype}}~{{\mathit{i

#. Let :math:`H` be the topmost :math:`\mathsf{handler}`.

#. Let :math:`n` be the arity of :math:`H`
#. Let :math:`n` be the arity of :math:`H`.

#. Let :math:`{{\mathit{catch}''}^\ast}` be the catch handler of :math:`H`
#. Let :math:`{{\mathit{catch}''}^\ast}` be the catch handler of :math:`H`.

#. If :math:`{{\mathit{catch}''}^\ast} = \epsilon`, then:

Expand Down Expand Up @@ -19119,7 +19119,7 @@ The instruction sequence :math:`(\mathsf{block}~{\mathit{blocktype}}~{{\mathit{i

a. Let :math:`L` be the topmost :math:`\mathsf{label}`.

#. Let :math:`n` be the arity of :math:`L`
#. Let :math:`n` be the arity of :math:`L`.

#. If :math:`l = 0`, then:

Expand Down Expand Up @@ -19256,7 +19256,7 @@ The instruction sequence :math:`(\mathsf{block}~{\mathit{blocktype}}~{{\mathit{i

1. Let :math:`f` be the topmost :math:`\mathsf{frame}`.

#. Let :math:`n` be the arity of :math:`f`
#. Let :math:`n` be the arity of :math:`f`.

#. Assert: Due to validation, there are at least :math:`n` values on the top of the stack.

Expand All @@ -19279,7 +19279,7 @@ The instruction sequence :math:`(\mathsf{block}~{\mathit{blocktype}}~{{\mathit{i

a. Let :math:`f` be the topmost :math:`\mathsf{frame}`.

#. Let :math:`n` be the arity of :math:`f`
#. Let :math:`n` be the arity of :math:`f`.

#. Assert: Due to validation, there are at least :math:`n` values on the top of the stack.

Expand Down Expand Up @@ -20171,9 +20171,9 @@ The instruction sequence :math:`(\mathsf{block}~{\mathit{blocktype}}~{{\mathit{i

a) Let :math:`H` be the topmost :math:`\mathsf{handler}`.

#) Let :math:`n` be the arity of :math:`H`
#) Let :math:`n` be the arity of :math:`H`.

#) Let :math:`{{\mathit{catch}''}^\ast}` be the catch handler of :math:`H`
#) Let :math:`{{\mathit{catch}''}^\ast}` be the catch handler of :math:`H`.

#) If :math:`{{\mathit{catch}''}^\ast} = \epsilon`, then:

Expand Down
Loading