diff options
| author | Fred Drake <fdrake@acm.org> | 2001-10-01 17:04:10 (GMT) |
|---|---|---|
| committer | Fred Drake <fdrake@acm.org> | 2001-10-01 17:04:10 (GMT) |
| commit | 6c81e2a44fd6ab5cacbb2e1d5c48933d65a58948 (patch) | |
| tree | b632dc434ef138c372e714a363294165c97a9bb6 /Doc/lib/libparser.tex | |
| parent | 0f0380a25fc2a95f0367540f45af585751914d23 (diff) | |
| download | cpython-6c81e2a44fd6ab5cacbb2e1d5c48933d65a58948.zip cpython-6c81e2a44fd6ab5cacbb2e1d5c48933d65a58948.tar.gz cpython-6c81e2a44fd6ab5cacbb2e1d5c48933d65a58948.tar.bz2 | |
"boolean" --> "Boolean" (per the style guide).
Diffstat (limited to 'Doc/lib/libparser.tex')
| -rw-r--r-- | Doc/lib/libparser.tex | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Doc/lib/libparser.tex b/Doc/lib/libparser.tex index 9ff3f42..15b46ae 100644 --- a/Doc/lib/libparser.tex +++ b/Doc/lib/libparser.tex @@ -473,7 +473,7 @@ docstrings. Since the example demonstrates information extraction, we can safely require that the tree be in tuple form rather than list form, allowing a simple variable representation to be \code{['variable_name']}. A simple recursive function can implement -the pattern matching, returning a boolean and a dictionary of variable +the pattern matching, returning a Boolean and a dictionary of variable name to value mappings. (See file \file{example.py}.) \begin{verbatim} |