commit cbbd966e33ca88aab5a01666bec7dafc88788213
parent 713c86f823a27462efd4f3269aaa7fb091de086a
Author: Wolfgang Corcoran-Mathe <wcm@sigwinch.xyz>
Date: Wed, 31 Jan 2024 16:56:23 -0500
Don't put parens in node names.
These are replaced with byte sequences in filenames, which
is ugly.
Diffstat:
1 file changed, 9 insertions(+), 9 deletions(-)
diff --git a/doc/r7rs-small/r7rs-small.texinfo b/doc/r7rs-small/r7rs-small.texinfo
@@ -933,7 +933,7 @@ boolean value for the purpose of a conditional test. As explained in section
report uses the word ``true'' to refer to any Scheme value except @code{#f},
and the word ``false'' to refer to @code{#f}.
-@node External representations (basic)
+@node External representations basic
@section External representations (basic)
An important concept in Scheme (and Lisp) is that of the @dfn{external
@@ -1177,7 +1177,7 @@ Expression types are categorized as @dfn{primitive} or @dfn{derived}.
Primitive expression types include variables and procedure calls. Derived
expression types are not semantically primitive, but can instead be defined
as macros. Suitable syntax definitions of some of the derived expressions
-are given in @ref{Derived expression types (formal)}.
+are given in @ref{Derived expression types formal}.
The procedures @code{force}, @code{promise?}, @code{make-promise}, and
@code{make-parameter} are also described in this chapter because they are
@@ -1403,7 +1403,7 @@ make @code{eqv?} and @code{eq?} work on procedures (@xref{Equivalence
predicates}).
@end deffn
-@node Conditionals (if)
+@node Conditionals if
@subsection Conditionals (if)
@deffn syntax if @svar{test} @svar{consequent} @svar{alternate}
@@ -1490,7 +1490,7 @@ described in this section into the primitive constructs described in the previou
* Case-lambda::
@end menu
-@node Conditionals (cond)
+@node Conditionals cond
@subsection Conditionals (cond)
syntax: (cond @svar{clause1} @svar{clause2} @dots{})
@@ -7896,8 +7896,8 @@ empty string.
The following extensions to BNF are used to make the description more concise: @svar{thing}*
means zero or more occurrences of @svar{thing}; and @svar{thing}+ means at least one @svar{thing}.
-@node External representations (formal)
-@subsection External representations (forma)
+@node External representations formal
+@subsection External representations (formal)
This section describes how individual tokens(identifiers, numbers, etc.) are formed from
sequences of characters. The following sections describe how expressions and programs
@@ -8029,7 +8029,7 @@ characters used in the grammar of numbers can appear in either upper or lower ca
@svar{digit 10} ⟶@svar{digit}
@svar{digit 16} ⟶@svar{digit 10} ∣a ∣b ∣c ∣d ∣e ∣f
-@node Expressions (formal)
+@node Expressions formal
@subsection Expressions (formal)
@svar{Datum} is what the read procedure (section 6.13.2) successfully parses. Note that any
@@ -8202,7 +8202,7 @@ a list pattern, not a vector pattern or an identifier pattern.
@svar{ellipsis} ⟶@svar{an identifier defaulting to ...}
@svar{underscore} ⟶@svar{the identifier _}
-@node Libraries (formal)
+@node Libraries formal
@subsection Libraries (formal)
@svar{program} ⟶ @svar{import declaration}+
@svar{command or definition}+
@@ -8295,7 +8295,7 @@ XXX: TeX!
XXX: TeX!
-@node Derived expression types (formal)
+@node Derived expression types formal
@section Derived expression types (formal)
This section gives syntax definitions for the derived expression types in terms of the
