commit 62a74566151392f33aa02d4fcb1245c2c721f8e7
parent fd772a2d129b6254f0037837cfbdd7acf26e2009
Author: Yuval Langer <yuvallangerontheroad@gmail.com>
Date: Sat, 27 Jan 2024 19:44:48 +0200
Run GNU Emacs's texinfo-all-menus-update.
Diffstat:
1 file changed, 186 insertions(+), 0 deletions(-)
diff --git a/doc/r7rs-small/r7rs-small.texinfo b/doc/r7rs-small/r7rs-small.texinfo
@@ -79,6 +79,22 @@ The report concludes with a list of references and an alphabetic index.
R5RS and R6RS. There is no intended implication that those editors, individually or
collectively, support or do not support this report.
+@menu
+* Introduction::
+* Overview of Scheme::
+* Lexical conventions::
+* Basic concepts::
+* Expressions::
+* Program structure::
+* Standard procedures::
+* Formal syntax and semantics::
+* Appendices::
+* Language changes::
+* Additional material::
+* Example::
+* References::
+@end menu
+
@node Introduction
@chapter Introduction
@@ -189,6 +205,12 @@ Algol 60 [25], as well as the following SRFIs: 0, 1, 4, 6, 9, 11, 13, 16, 30, 34
@node Overview of Scheme
@chapter Overview of Scheme
+@menu
+* Semantics::
+* Syntax::
+* Notation and terminology::
+@end menu
+
@node Semantics
@section Semantics
@@ -250,6 +272,14 @@ The formal syntax of Scheme is described in section 7.1.
@node Notation and terminology
@section Notation and terminology
+@menu
+* Base and optional features::
+* Error situations and unspecified behavior::
+* Entry format::
+* Evaluation examples::
+* Naming conventions::
+@end menu
+
@node Base and optional features
@subsection Base and optional features
@@ -555,6 +585,13 @@ A thunk is a procedure that does not accept arguments.
This section gives an informal account of some of the lexical conventions used in writing
Scheme programs. For a formal syntax of Scheme, see section 7.1.
+@menu
+* Identifiers::
+* Whitespace and comments::
+* Other notations::
+* Datum labels::
+@end menu
+
@node Identifiers
@section Identifiers
@@ -745,6 +782,14 @@ In particular, it is an error for quasiquote (section 4.2.8) to contain them.
@node Basic concepts
@chapter Basic concepts
+@menu
+* Variables - syntactic keywords - and regions::
+* Disjointness of types::
+* External representations (basic)::
+* Storage model::
+* Proper tail recursion::
+@end menu
+
@node Variables - syntactic keywords - and regions
@section Variables, syntactic keywords, and regions
@@ -990,9 +1035,25 @@ The procedures force, promise?, make-promise, and make-parameter are also descri
in this chapter because they are intimately associated with the delay, delay-force, and
parameterize expression types.
+@menu
+* Primitive expression types::
+* Derived expression types::
+* Macros::
+@end menu
+
@node Primitive expression types
@section Primitive expression types
+@menu
+* Variable references::
+* Literal expressions::
+* Procedure calls::
+* Procedures::
+* Conditionals (if)::
+* Assignments::
+* Inclusion::
+@end menu
+
@node Variable references
@subsection Variable references
@@ -1191,6 +1252,18 @@ The constructs in this section are hygienic, as discussed in section 4.3. For re
purposes, section 7.3 gives syntax definitions that will convert most of the constructs
described in this section into the primitive constructs described in the previous section.
+@menu
+* Conditionals (cond)::
+* Binding constructs::
+* Sequencing::
+* Iteration::
+* Delayed evaluation::
+* Dynamic bindings::
+* Exception handling::
+* Quasiquotation::
+* Case-lambda::
+@end menu
+
@node Conditionals (cond)
@subsection Conditionals (cond)
@@ -2017,6 +2090,12 @@ In consequence, all macros defined using the pattern language are “hygienic”
Implementations may provide macro facilities of other types.
+@menu
+* Binding constructs for syntactic keywords::
+* Pattern language::
+* Signaling errors in macro transformers::
+@end menu
+
@node Binding constructs for syntactic keywords
@subsection Binding constructs for syntactic keywords
@@ -2254,6 +2333,16 @@ exception handlers or guards.
@node Program structure
@chapter Program structure
+@menu
+* Programs::
+* Import declarations::
+* Variable definitions::
+* Syntax definitions::
+* Record-type definitions::
+* Libraries::
+* The REPL::
+@end menu
+
@node Programs
@section Programs
@@ -2353,6 +2442,12 @@ them. The simplest kind of variable definition takes one of the following forms:
(define <variable>
(lambda <formal> <body>)).
+@menu
+* Top level definitions::
+* Internal definitions::
+* Multiple-value definitions::
+@end menu
+
@node Top level definitions
@subsection Top level definitions
@@ -2548,6 +2643,11 @@ Libraries provide a way to organize Scheme programs into reusable parts with exp
defined interfaces to the rest of the program. This section defines the notation and
semantics for libraries.
+@menu
+* Library Syntax::
+* Library example::
+@end menu
+
@node Library Syntax
@subsection Library Syntax
@@ -2768,6 +2868,23 @@ has an unspecified effect on the behavior of the procedures defined in this chap
When a procedure is said to return a newly allocated object, it means that the locations in
the object are fresh.
+@menu
+* Equivalence predicates::
+* Numbers::
+* Booleans::
+* Pairs and lists::
+* Symbols::
+* Characters::
+* Strings::
+* Vectors::
+* Bytevectors::
+* Control features::
+* Exceptions::
+* Environments and evaluation::
+* Input and output::
+* System interface::
+@end menu
+
@node Equivalence predicates
@section Equivalence predicates
@@ -3049,6 +3166,16 @@ numbers, and notations used to write numbers. This report uses the types number,
complex, real, rational, and integer to refer to both mathematical numbers and Scheme
numbers.
+@menu
+* Numerical types::
+* Exactness::
+* Implementation restrictions::
+* Implementation extensions::
+* Syntax of numerical constants::
+* Numerical operations::
+* Numerical input and output::
+@end menu
+
@node Numerical types
@subsection Numerical types
@@ -6662,6 +6789,12 @@ eval to allow other objects.
@node Input and output
@section Input and output
+@menu
+* Ports::
+* Input::
+* Output::
+@end menu
+
@node Ports
@subsection Ports
@@ -7332,12 +7465,28 @@ modify this list. Here is an example of what features might return:
@node Formal syntax and semantics
@chapter Formal syntax and semantics
+@menu
+* Formal syntax::
+* Formal semantics::
+* Derived expression types (formal)::
+@end menu
+
@node Formal syntax
@section Formal syntax
This chapter provides formal descriptions of what has already been described informally
in previous chapters of this report.
+@menu
+* Lexical structure::
+* External representations (formal)::
+* Expressions (formal)::
+* Quasiquotations::
+* Transformers::
+* Programs and definitions::
+* Libraries (formal)::
+@end menu
+
@node Lexical structure
@subsection Lexical structure
@@ -7723,6 +7872,13 @@ obtained by replacing every definition in P by an assignment, <undefined> is an
expression that evaluates to undefined, and calE is the semantic function that assigns
meaning to expressions.
+@menu
+* Abstract syntax::
+* Domain equations::
+* Semantic functions::
+* Auxiliary functions::
+@end menu
+
@node Abstract syntax
@subsection Abstract syntax
@@ -8259,6 +8415,11 @@ that each feature identifier provided by the implementation be explicitly mentio
@node Appendices
@chapter Appendices
+@menu
+* Appendix A Standard Libraries::
+* Appendix B Standard Feature Identifiers::
+@end menu
+
@node Appendix A Standard Libraries
@section Appendix A Standard Libraries
@@ -8269,6 +8430,25 @@ might be expensive to load.
The scheme library prefix is used for all standard libraries, and is reserved for use by
future standards.
+@menu
+* Base Library::
+* Case-Lambda Library::
+* Char Library::
+* Complex Library::
+* CxR Library::
+* Eval Library::
+* File Library::
+* Inexact Library::
+* Lazy Library::
+* Load Library::
+* Process-Context Library::
+* Read Library::
+* Repl Library::
+* Time Library::
+* Write Library::
+* R5RS Library::
+@end menu
+
@node Base Library
@subsection Base Library
@@ -8710,6 +8890,12 @@ big-endian, little-endianByte order flags.
@node Language changes
@chapter Language changes
+@menu
+* Incompatibilities with R5RS::
+* Other language changes since R5RS::
+* Incompatibilities with R6RS::
+@end menu
+
@node Incompatibilities with R5RS
@section Incompatibilities with R5RS
