mirror/guile
mirror/guile
1
Fork 0
mirror of https://git.savannah.gnu.org/git/guile.git synced 2025-06-28 05:50:30 +02:00
Code Activity

[doc] Clean up .texi for modern GNU Texinfo

Browse source 
These changes are the minimal needed to get "make" to
complete w/o error or warnings using GNU Texinfo 6.3.

* doc/goops/goops.texi <title page>: Condense @author lines.
  (Running GOOPS, Methods, User-defined types)
  (Asking for the type of an object):
  Promote these nodes from subsection to section.
* doc/r5rs/r5rs.texi <title page>: Remove spurious @author;
  change @unnumbered to @heading.
  (Entry format): Comment out spurious @center;
  remove spurious @item.
  (Characters): Likewise.
  (Lexical structure): Rework @format blocks w/ embedded
  @t and @cindex, as a series of abutting @example blocks
  that close and reopen around the @cindex; and sans @t.
  (Additional material): Comment out spurious @center lines.
* doc/tutorial/guile-tut.texi (Hello World):
  Promote from @subsection to @section.
  (A bunch of operations in Scheme): Likewise;
  change @print to take no args.
  (Using recursion to process lists, Processing matrices):
  Promote from @subsection to @section.
  (Using Guile to program in Scheme): Change @print to take no args.
This commit is contained in:
Thien-Thi Nguyen 2017-03-03 10:17:03 +01:00
parent de2d678982
commit 4c6f43a635
3 changed files with 49 additions and 41 deletions
Download patch file Download diff file Expand all files Collapse all files

18
doc/tutorial/guile-tut.texi
View file

@ -446,7 +446,7 @@ get started, look at the books @cite{Simply Scheme} and @cite{The Little
Schemer} from that list.}
@subsection Hello World
@section Hello World
@cindex hello world
Our first program is the typical Scheme "hello world" program. Put the
@ -483,7 +483,7 @@ is then terminated with @code{!#} on the second line so as to not
interfere with the execution mechanism.
@subsection A bunch of operations in Scheme
@section A bunch of operations in Scheme
Here is some code you can type at the @code{guile>} prompt to see some
of the Scheme data types at work (mostly lists and vectors). I have
@ -535,12 +535,12 @@ guile> @kbd{(memq 4 ls)}
guile> @kbd{(if (memq 4 ls)
(display "hey, it's true!\n")
(display "dude, it's false\n"))}
@print{hey, it's true!}
@print{} hey, it's true!
@result{}
guile> @kbd{(if (memq 12 ls)
(display "hey, it's true!\n")
(display "dude, it's false\n"))}
@print{dude, it's false}
@print{} dude, it's false
@result{}
guile> @kbd{(memq 4 (reverse ls))}
@result{} (4 3 2 1)
@ -583,7 +583,7 @@ guile> @kbd{v}
@end smalllisp
@subsection Using recursion to process lists
@section Using recursion to process lists
@cindex recursion
@cindex list processing
@ -600,7 +600,7 @@ Here are some typical examples of using recursion to process a list.
@end smalllisp
@subsection Processing matrices
@section Processing matrices
Suppose you have a matrix represented as a list of lists:
@ -656,9 +656,9 @@ And then invoke it with
(represent-matrix m
(lambda (x) (begin (display x) (display " ")))
(lambda (l) (begin (display "\n"))))
@print{7 2 1 3 2 8 5 3 6}
@print{4 1 1 1 3 8 9 8 1}
@print{5 5 4 8 1 8 2 2 4}
@print{} 7 2 1 3 2 8 5 3 6
@print{} 4 1 1 1 3 8 9 8 1
@print{} 5 5 4 8 1 8 2 2 4
@end smalllisp
@cindex objects