CompAnn--User Manual

Table of Contents


Next: , Up: (dir)

CompAnn—User Manual

This is the user manual for CompAnn and Anne language description. Technical details and internals are described in another document.


Next: , Previous: Top, Up: Top

1 cann—The Anne Compiler

cann is the compiler that translates the programming language Anne (see Anne) into neural networks. cann is a command-line utility.


Next: , Up: cann

1.1 Basic Usage

cann's usage is very basically oriented at gcc's:

cann [FLAGS] INPUT -o OUTPUT [--sam-dump SAM]

This call compiles the Anne-file INPUT and saves the resulting network to OUTPUT. Optionally (mainly for debugging of the compiler itself) can be requested to dump the SAM tree (as readable text) to the file SAM.

General options allowed as FLAGS:

--version
Displays copyright- and version-information for cann.
--help
Displays a short usage-summary.

Additionally allowed are the flags for optimization, See cann Optimization.


Previous: cann Usage, Up: cann

1.2 Requesting Optimization

To enable compiler optimization fully or partially (only some algorithms), the following flags can be used:

-O
Enable all optimization algorithms.
-Obitsharing
Enable BitSharing.
-Ocompactor
Enable Compactor optimization.


Next: , Previous: cann, Up: Top

2 rann—The ANN-Interpreter

rann is an interpreter for programs in form of ANNs generated by cann.


Next: , Up: rann

2.1 Usage of rann

The usage of rann is basically the following:

rann [FLAGS] ANN [ARGUMENTS]

This call loads the network ANN and executes it. The input arguments passed to the network can be specified directly on the command-line as a sequence of numbers as ARGUMENTS. If that is not or only partially done, the program will ask interactively for the missing values. After the successful execution all output-values are written to stdout.

Flags allowed:

--version
Display copyright- and version-information for rann.
--help
Display a short usage-summary.
--statistics
-s
Enables collecting of runtime-statistics (see rann Statistics).


Previous: rann Usage, Up: rann

2.2 Collecting Runtime-Statistics

rann is able to collect runtime-statistics during the execution of ANNs. This is great for testing and optimizing the performance of both the compiler itself (and the effectiveness of optimizations) and the Anne-sources of the ANNs.

If statistics are enabled via the command-line flag (see rann Usage), the collected values are dumped to stdout after the execution. Values collected:


Next: , Previous: rann, Up: Top

3 The Programming Language Anne

Anne is a procedural, structured programming language specifically designed to be compilable into ANNs. The syntax is vaguely based on C but often differes from C or refers to language constructs not existent in C; the description of very C-like syntax however is kept very briefly.

All identifiers, keywords and things like that are handled case-sensitive.


Next: , Up: Anne

3.1 Basic Language Elements


Next: , Up: Anne Elements

3.1.1 Comments

Comments are in Anne both in classical C-multi-line-syntax and in one-line syntax as per C++ and Java possible:

     /* This is a
     multi-line comment */
     // This is a one-line comment


Next: , Previous: Anne Comments, Up: Anne Elements

3.1.2 Literals for Numbers and Booleans

3.1.2.1 Numbers

Numbers must be notated in decimal notation without sign or decimal point, that is, simply a sequence of digits:

     a=1234;
     b=567;
     c=04567; // Possible, but nicht octal!
     d=0xABC; // Invalid
     e=-.5e2; // Invalid
3.1.2.2 Booleans

For boolean values the corresponding numbers 0 and 1 can be used as well as the “constants” true and false.


Next: , Previous: Anne Literal, Up: Anne Elements

3.1.3 Identifiers

IDs are identifiers for “named things” like variables or calls. They may consist of alpha-numeric characters, but the first character must not be a digit.

Valid IDs are `abc123', `DanielKraft' or `fooBar', invalid are `0fun', `abc.def' or `daniel_kraft'.

Also invalid are reserved keywords as those are recognized by the parser as keywords and not IDs.


Next: , Previous: Anne IDs, Up: Anne Elements

3.1.4 Types

At the moment there's only one flavour of data-types in Anne: unsigned integers with arbitrary bit-size. The corresponding type is identified by uintn, where n is the desired number of bits.

With two's complement notation and some corresponding operators one can however also use those numbers as signed if needed.

     variable uint16 a; // 16-bit unsigned integer (uint16_t)
     variable uint1  b; // boolean value
     variable uint64 c; // 64-bit unsigned integer (uint64_t)
     variable uint4  d; // 4-bit unsigned integer, range 0-15


Previous: Anne Types, Up: Anne Elements

3.1.5 Reserved Keywords

The following words are reserved in Anne having some special meaning described in other sections of this manual:


Next: , Previous: Anne Elements, Up: Anne

3.2 Basic Structure of an Anne Program


Next: , Up: Anne Structure

3.2.1 Input- and Output-Arguments

The head of an Anne-program lists all input- followed by the output-arguments of the program. Such a definition follows the syntax:

     inout type name;

where inout is depending on the type of definition either input or output, type the data-type of the defined argument and name the ID used to reference it later.

     input uint4 inNum;
     input uint1 inBool;
     
     output uint16 outNum;
     output uint1 outBool;

If no input- or output-arguments are needed, the corresponding definitions part can be skiped.


Next: , Previous: Anne InOutArgs, Up: Anne Structure

3.2.2 Callback Definitions

After the arguments one can define callbacks to be used in the program. A callback is somewhat a “native” method that has to be implemented by the runtime-environment and can be used for more complex interaction as is possible by simply passing arguments. The syntax for such a definition is:

     callback name(in1, in2...) -> (out1, out2...);

name is the identifier for the callback, inN the type of the N-th callback input-argument and outN the type of the N-th output argument. If there's exactly one output argument the parentheses can be omitted. For a callback entirely without output arguments that's not possible!

     callback sum(uint4, uint4) -> uint5;
     callback nothing() -> ();
     callback swap(uint8, uint8) -> (uint8, uint8);


Next: , Previous: Anne Callbacks, Up: Anne Structure

3.2.3 Global Variables

At this point global variables may be defined; the syntax is the same as for argument definitions (see Anne InOutArgs), but variable is used as keyword.

     variable uint6 flags;


Previous: Anne VarDecls, Up: Anne Structure

3.2.4 The Main Code

Not like most other languages where the main code is either in a special marked area (or a function like main) or the code present outside of every procedure, in Anne there has to be exactly one statement (see Anne Statement) after the header that is used as entry-point. This of course can be a code block (Anne Block) to allow a sequence of statements as program code.


Next: , Previous: Anne Structure, Up: Anne

3.3 Expressions—Values in Anne

An expression is everything that has a value (sometimes called Rvalues); they are no commands or statements of themselves but parts of those.


Next: , Up: Anne Expression

3.3.1 Constant Values

A literal (see Anne Literal) can be used as expression:

     a=42;   // ``42'' is an expression
     b=true; // as is ``true''


Next: , Previous: Anne Expression Literal, Up: Anne Expression

3.3.2 Variable References

A variable (and equivalently an input- or output-parameter) can be referenced by its name; the value of an expression like this is of course the variable's value.


Previous: Anne Expression Variable, Up: Anne Expression

3.3.3 Operations and Calculations

Of course Anne also allows operations and calculations by combining sub-expressions with operators. Possible operators in decreasing order of priority:

(a)
Value of a—parentheses can be used to override default priority.
~a
Binary “not” of a.
-a
The numerically negative value of a.
a#
a incremented by one (a+1).
a^b
a&b
a|b
Binary “XOR”, “and” or “or” of a and b.
a+b
a-b
Arithmetic sum or difference of a and b.
a<<n
a>>n
Left- or right-shift of a by n binary digits—n has to be a compile-time constant.
a<b
a<=b
a>b
a>=b
0 or 1 depending on the comparison's result.
a==b
a!=b
0 or 1 depending on the comparison's result.


Next: , Previous: Anne Expression, Up: Anne

3.4 Lvalues—Targets for Assignments

Lvalues are “objects” that can be assigned a (new) value, but they do not necessarily have to also have a value (that is, they need not be Rvalues). Not even after an assignment has taken place.

However, in Anne only variable-references are possible Lvalues (see Anne Expression Variable) which are expressions, too, so this detail is “hidden”.


Previous: Anne Lvalue, Up: Anne

3.5 Statements—Commands in Anne


Next: , Up: Anne Statement

3.5.1 Assignments

Assignments are written in Anne as in many other programming languages; an expression gets assigned to an lvalue.

     a=42;
     b=56^7;
     c=(123==0|123);

Short-hand assignments as in C-like languages are also possible, here of course the target must be lvalue and expression together. Possible operators for this are: &, |, ^, +, -, << and >>.

     a&=4;
     b>>=2;


Next: , Previous: Anne Assignment, Up: Anne Statement

3.5.2 Calling Procedures

A Call (to a procedure or callback) can be used as statement, too, optinally the return-values can be assigned to some lvalues after the call returns.

The call itself is written as usual, and if return-values are expected, the operator -> followed by the lvalue-targets (in parentheses if more than one) should follow it. It is both possible to specify less lvalues than there are return-values and to skip some return-values in the middle of the list.

     voidFunktion();
     sum(3, 4) -> a;
     swap(a, b) -> (a, b);
     swap(4, 3) -> (, c); // c is now 4


Next: , Previous: Anne Statement Call, Up: Anne Statement

3.5.3 If-Then-Else Conditionals

If-Then- and If-Then-Else statements are the constructs for conditional execution in Anne. The syntax is similar to C:

     if(a==5)
       a=0;
     
     if(c!=0)
     {
       a=c;
       c=0;
     } else
       c=0;


Next: , Previous: Anne If, Up: Anne Statement

3.5.4 Loops in Anne


Next: , Up: Anne Loop
3.5.4.1 While-Loops

While-Loops are loops whose body is repeated as long a certain condition is true:

     a=1;
     // While until overflow
     while(a!=0)
       a<<=1;


Previous: Anne While, Up: Anne Loop
3.5.4.2 Do-While-Loops

Do-While-Loops are also repeated until some condition gets false, but this condition is checked at their end so they get executed at least once:

     // Infinite loop
     a=0;
     do
       a=42;
     while(a!=0);


Next: , Previous: Anne Loop, Up: Anne Statement

3.5.5 Jumps and Loop-Controlling


Next: , Up: Anne Jump
3.5.5.1 Labels

Labels name jumping targets; unlike in C they need not be followed by a statement as they generate their own NOP statement (that has no performance costs of course).

See Anne Goto for example.


Next: , Previous: Anne Label, Up: Anne Jump
3.5.5.2 Basic goto Jumps

The keyword goto followed by a label name allows for direct, simple jumps:

     a=5;
     label:
     if(a!=5)
       goto ende;
     a=6;
     goto label;
     ende:


Next: , Previous: Anne Goto, Up: Anne Jump
3.5.5.3 Break out of a Loop

The command break ends a loop currently executed immediatelly, it's simply a jump after the loop's end.

An optional constant n specified along with break determines which of a set of nested loops will be ended. The inner-most n loops will be cancelled.

     while(true)
       break;
     
     i=1;
     while(true)
     {
       i<<=1;
       j=1;
       while(true)
       {
         j<<=1;
         if((j==0)&(i==0))
           break 2;
       }
     }


Previous: Anne Break, Up: Anne Jump
3.5.5.4 Continuing Loop Iterations

continue cancells the current loop iteration and proceeds immediatelly with the next iteration. Like with break a constant may be specified to identify one of several nested loops, See Anne Break.

     // Infinite loop
     i=0;
     while(i==0)
     {
       continue;
       i=1;
     }


Next: , Previous: Anne Jump, Up: Anne Statement

3.5.6 Blocks

Often its useful to place a sequence of statements instead of a single one at some position (for instance if the body of a loop or conditional should consist of more than one statement). This is done via a block notated in curly braces:

     {
       a=6;
       b=7;
     }

Inside a block local variables may be declared (similarly to global variables, see Anne VarDecls); those are valid only inside that block. If other variables of the same name are already declared in a parent scope, they are shadowed by the new ones.

     {
       variable uint4 local;
       {
         variable uint8 local;
         local=128; // 8-bit variable
       }
       local=128;   // Overflow, only 4 bits here
     
       variable uint6 i;
       i=12;
     }


Previous: Anne Block, Up: Anne Statement

3.5.7 Multi-Threading

3.5.7.1 Asynchronous Execution

The simplest form of multi-threading on the Anne-level is asynchronous execution; here, some statement is simply executed in parallel to the current line of execution (that of course can be a block, too, see Anne Block).

This form is very cheap as there are no runtime- and space-costs, but it is not suitable for all purposes.

Such a asynchronous statement is introduced with the keyword asynchronous:

     // Both assignments in parallel, only the time of one needed!
     asynchronous
       a=42;
     b=42;
3.5.7.2 Parallel Execution

For parallel execution, two or more statements are really executed in parallel; the program continues after the block once all those statements are finished.

This flavour of multi-threading costs a bit runtime and a few neurons, but is much more flexible and safe than asynchronous execution. Here one need not know at compile-time which of the parallel lines will be the longest.

Such a block is written after the keyword parallel in curly braces. All statements that are directly within this block are executed in parallel.

     // Three assignments of different durations in parallel
     parallel
     {
       a=0;
       b=5&6;
       c=(3<<1)|(19^(5&2));
     }


Previous: Anne, Up: Top

Appendix A GNU Free Documentation License

		GNU Free Documentation License
		  Version 1.2, November 2002


 Copyright (C) 2000,2001,2002  Free Software Foundation, Inc.
     51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
 Everyone is permitted to copy and distribute verbatim copies
 of this license document, but changing it is not allowed.


0. PREAMBLE

The purpose of this License is to make a manual, textbook, or other
functional and useful document "free" in the sense of freedom: to
assure everyone the effective freedom to copy and redistribute it,
with or without modifying it, either commercially or noncommercially.
Secondarily, this License preserves for the author and publisher a way
to get credit for their work, while not being considered responsible
for modifications made by others.

This License is a kind of "copyleft", which means that derivative
works of the document must themselves be free in the same sense.  It
complements the GNU General Public License, which is a copyleft
license designed for free software.

We have designed this License in order to use it for manuals for free
software, because free software needs free documentation: a free
program should come with manuals providing the same freedoms that the
software does.  But this License is not limited to software manuals;
it can be used for any textual work, regardless of subject matter or
whether it is published as a printed book.  We recommend this License
principally for works whose purpose is instruction or reference.


1. APPLICABILITY AND DEFINITIONS

This License applies to any manual or other work, in any medium, that
contains a notice placed by the copyright holder saying it can be
distributed under the terms of this License.  Such a notice grants a
world-wide, royalty-free license, unlimited in duration, to use that
work under the conditions stated herein.  The "Document", below,
refers to any such manual or work.  Any member of the public is a
licensee, and is addressed as "you".  You accept the license if you
copy, modify or distribute the work in a way requiring permission
under copyright law.

A "Modified Version" of the Document means any work containing the
Document or a portion of it, either copied verbatim, or with
modifications and/or translated into another language.

A "Secondary Section" is a named appendix or a front-matter section of
the Document that deals exclusively with the relationship of the
publishers or authors of the Document to the Document's overall subject
(or to related matters) and contains nothing that could fall directly
within that overall subject.  (Thus, if the Document is in part a
textbook of mathematics, a Secondary Section may not explain any
mathematics.)  The relationship could be a matter of historical
connection with the subject or with related matters, or of legal,
commercial, philosophical, ethical or political position regarding
them.

The "Invariant Sections" are certain Secondary Sections whose titles
are designated, as being those of Invariant Sections, in the notice
that says that the Document is released under this License.  If a
section does not fit the above definition of Secondary then it is not
allowed to be designated as Invariant.  The Document may contain zero
Invariant Sections.  If the Document does not identify any Invariant
Sections then there are none.

The "Cover Texts" are certain short passages of text that are listed,
as Front-Cover Texts or Back-Cover Texts, in the notice that says that
the Document is released under this License.  A Front-Cover Text may
be at most 5 words, and a Back-Cover Text may be at most 25 words.

A "Transparent" copy of the Document means a machine-readable copy,
represented in a format whose specification is available to the
general public, that is suitable for revising the document
straightforwardly with generic text editors or (for images composed of
pixels) generic paint programs or (for drawings) some widely available
drawing editor, and that is suitable for input to text formatters or
for automatic translation to a variety of formats suitable for input
to text formatters.  A copy made in an otherwise Transparent file
format whose markup, or absence of markup, has been arranged to thwart
or discourage subsequent modification by readers is not Transparent.
An image format is not Transparent if used for any substantial amount
of text.  A copy that is not "Transparent" is called "Opaque".

Examples of suitable formats for Transparent copies include plain
ASCII without markup, Texinfo input format, LaTeX input format, SGML
or XML using a publicly available DTD, and standard-conforming simple
HTML, PostScript or PDF designed for human modification.  Examples of
transparent image formats include PNG, XCF and JPG.  Opaque formats
include proprietary formats that can be read and edited only by
proprietary word processors, SGML or XML for which the DTD and/or
processing tools are not generally available, and the
machine-generated HTML, PostScript or PDF produced by some word
processors for output purposes only.

The "Title Page" means, for a printed book, the title page itself,
plus such following pages as are needed to hold, legibly, the material
this License requires to appear in the title page.  For works in
formats which do not have any title page as such, "Title Page" means
the text near the most prominent appearance of the work's title,
preceding the beginning of the body of the text.

A section "Entitled XYZ" means a named subunit of the Document whose
title either is precisely XYZ or contains XYZ in parentheses following
text that translates XYZ in another language.  (Here XYZ stands for a
specific section name mentioned below, such as "Acknowledgements",
"Dedications", "Endorsements", or "History".)  To "Preserve the Title"
of such a section when you modify the Document means that it remains a
section "Entitled XYZ" according to this definition.

The Document may include Warranty Disclaimers next to the notice which
states that this License applies to the Document.  These Warranty
Disclaimers are considered to be included by reference in this
License, but only as regards disclaiming warranties: any other
implication that these Warranty Disclaimers may have is void and has
no effect on the meaning of this License.


2. VERBATIM COPYING

You may copy and distribute the Document in any medium, either
commercially or noncommercially, provided that this License, the
copyright notices, and the license notice saying this License applies
to the Document are reproduced in all copies, and that you add no other
conditions whatsoever to those of this License.  You may not use
technical measures to obstruct or control the reading or further
copying of the copies you make or distribute.  However, you may accept
compensation in exchange for copies.  If you distribute a large enough
number of copies you must also follow the conditions in section 3.

You may also lend copies, under the same conditions stated above, and
you may publicly display copies.


3. COPYING IN QUANTITY

If you publish printed copies (or copies in media that commonly have
printed covers) of the Document, numbering more than 100, and the
Document's license notice requires Cover Texts, you must enclose the
copies in covers that carry, clearly and legibly, all these Cover
Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
the back cover.  Both covers must also clearly and legibly identify
you as the publisher of these copies.  The front cover must present
the full title with all words of the title equally prominent and
visible.  You may add other material on the covers in addition.
Copying with changes limited to the covers, as long as they preserve
the title of the Document and satisfy these conditions, can be treated
as verbatim copying in other respects.

If the required texts for either cover are too voluminous to fit
legibly, you should put the first ones listed (as many as fit
reasonably) on the actual cover, and continue the rest onto adjacent
pages.

If you publish or distribute Opaque copies of the Document numbering
more than 100, you must either include a machine-readable Transparent
copy along with each Opaque copy, or state in or with each Opaque copy
a computer-network location from which the general network-using
public has access to download using public-standard network protocols
a complete Transparent copy of the Document, free of added material.
If you use the latter option, you must take reasonably prudent steps,
when you begin distribution of Opaque copies in quantity, to ensure
that this Transparent copy will remain thus accessible at the stated
location until at least one year after the last time you distribute an
Opaque copy (directly or through your agents or retailers) of that
edition to the public.

It is requested, but not required, that you contact the authors of the
Document well before redistributing any large number of copies, to give
them a chance to provide you with an updated version of the Document.


4. MODIFICATIONS

You may copy and distribute a Modified Version of the Document under
the conditions of sections 2 and 3 above, provided that you release
the Modified Version under precisely this License, with the Modified
Version filling the role of the Document, thus licensing distribution
and modification of the Modified Version to whoever possesses a copy
of it.  In addition, you must do these things in the Modified Version:

A. Use in the Title Page (and on the covers, if any) a title distinct
   from that of the Document, and from those of previous versions
   (which should, if there were any, be listed in the History section
   of the Document).  You may use the same title as a previous version
   if the original publisher of that version gives permission.
B. List on the Title Page, as authors, one or more persons or entities
   responsible for authorship of the modifications in the Modified
   Version, together with at least five of the principal authors of the
   Document (all of its principal authors, if it has fewer than five),
   unless they release you from this requirement.
C. State on the Title page the name of the publisher of the
   Modified Version, as the publisher.
D. Preserve all the copyright notices of the Document.
E. Add an appropriate copyright notice for your modifications
   adjacent to the other copyright notices.
F. Include, immediately after the copyright notices, a license notice
   giving the public permission to use the Modified Version under the
   terms of this License, in the form shown in the Addendum below.
G. Preserve in that license notice the full lists of Invariant Sections
   and required Cover Texts given in the Document's license notice.
H. Include an unaltered copy of this License.
I. Preserve the section Entitled "History", Preserve its Title, and add
   to it an item stating at least the title, year, new authors, and
   publisher of the Modified Version as given on the Title Page.  If
   there is no section Entitled "History" in the Document, create one
   stating the title, year, authors, and publisher of the Document as
   given on its Title Page, then add an item describing the Modified
   Version as stated in the previous sentence.
J. Preserve the network location, if any, given in the Document for
   public access to a Transparent copy of the Document, and likewise
   the network locations given in the Document for previous versions
   it was based on.  These may be placed in the "History" section.
   You may omit a network location for a work that was published at
   least four years before the Document itself, or if the original
   publisher of the version it refers to gives permission.
K. For any section Entitled "Acknowledgements" or "Dedications",
   Preserve the Title of the section, and preserve in the section all
   the substance and tone of each of the contributor acknowledgements
   and/or dedications given therein.
L. Preserve all the Invariant Sections of the Document,
   unaltered in their text and in their titles.  Section numbers
   or the equivalent are not considered part of the section titles.
M. Delete any section Entitled "Endorsements".  Such a section
   may not be included in the Modified Version.
N. Do not retitle any existing section to be Entitled "Endorsements"
   or to conflict in title with any Invariant Section.
O. Preserve any Warranty Disclaimers.

If the Modified Version includes new front-matter sections or
appendices that qualify as Secondary Sections and contain no material
copied from the Document, you may at your option designate some or all
of these sections as invariant.  To do this, add their titles to the
list of Invariant Sections in the Modified Version's license notice.
These titles must be distinct from any other section titles.

You may add a section Entitled "Endorsements", provided it contains
nothing but endorsements of your Modified Version by various
parties--for example, statements of peer review or that the text has
been approved by an organization as the authoritative definition of a
standard.

You may add a passage of up to five words as a Front-Cover Text, and a
passage of up to 25 words as a Back-Cover Text, to the end of the list
of Cover Texts in the Modified Version.  Only one passage of
Front-Cover Text and one of Back-Cover Text may be added by (or
through arrangements made by) any one entity.  If the Document already
includes a cover text for the same cover, previously added by you or
by arrangement made by the same entity you are acting on behalf of,
you may not add another; but you may replace the old one, on explicit
permission from the previous publisher that added the old one.

The author(s) and publisher(s) of the Document do not by this License
give permission to use their names for publicity for or to assert or
imply endorsement of any Modified Version.


5. COMBINING DOCUMENTS

You may combine the Document with other documents released under this
License, under the terms defined in section 4 above for modified
versions, provided that you include in the combination all of the
Invariant Sections of all of the original documents, unmodified, and
list them all as Invariant Sections of your combined work in its
license notice, and that you preserve all their Warranty Disclaimers.

The combined work need only contain one copy of this License, and
multiple identical Invariant Sections may be replaced with a single
copy.  If there are multiple Invariant Sections with the same name but
different contents, make the title of each such section unique by
adding at the end of it, in parentheses, the name of the original
author or publisher of that section if known, or else a unique number.
Make the same adjustment to the section titles in the list of
Invariant Sections in the license notice of the combined work.

In the combination, you must combine any sections Entitled "History"
in the various original documents, forming one section Entitled
"History"; likewise combine any sections Entitled "Acknowledgements",
and any sections Entitled "Dedications".  You must delete all sections
Entitled "Endorsements".


6. COLLECTIONS OF DOCUMENTS

You may make a collection consisting of the Document and other documents
released under this License, and replace the individual copies of this
License in the various documents with a single copy that is included in
the collection, provided that you follow the rules of this License for
verbatim copying of each of the documents in all other respects.

You may extract a single document from such a collection, and distribute
it individually under this License, provided you insert a copy of this
License into the extracted document, and follow this License in all
other respects regarding verbatim copying of that document.


7. AGGREGATION WITH INDEPENDENT WORKS

A compilation of the Document or its derivatives with other separate
and independent documents or works, in or on a volume of a storage or
distribution medium, is called an "aggregate" if the copyright
resulting from the compilation is not used to limit the legal rights
of the compilation's users beyond what the individual works permit.
When the Document is included in an aggregate, this License does not
apply to the other works in the aggregate which are not themselves
derivative works of the Document.

If the Cover Text requirement of section 3 is applicable to these
copies of the Document, then if the Document is less than one half of
the entire aggregate, the Document's Cover Texts may be placed on
covers that bracket the Document within the aggregate, or the
electronic equivalent of covers if the Document is in electronic form.
Otherwise they must appear on printed covers that bracket the whole
aggregate.


8. TRANSLATION

Translation is considered a kind of modification, so you may
distribute translations of the Document under the terms of section 4.
Replacing Invariant Sections with translations requires special
permission from their copyright holders, but you may include
translations of some or all Invariant Sections in addition to the
original versions of these Invariant Sections.  You may include a
translation of this License, and all the license notices in the
Document, and any Warranty Disclaimers, provided that you also include
the original English version of this License and the original versions
of those notices and disclaimers.  In case of a disagreement between
the translation and the original version of this License or a notice
or disclaimer, the original version will prevail.

If a section in the Document is Entitled "Acknowledgements",
"Dedications", or "History", the requirement (section 4) to Preserve
its Title (section 1) will typically require changing the actual
title.


9. TERMINATION

You may not copy, modify, sublicense, or distribute the Document except
as expressly provided for under this License.  Any other attempt to
copy, modify, sublicense or distribute the Document is void, and will
automatically terminate your rights under this License.  However,
parties who have received copies, or rights, from you under this
License will not have their licenses terminated so long as such
parties remain in full compliance.


10. FUTURE REVISIONS OF THIS LICENSE

The Free Software Foundation may publish new, revised versions
of the GNU Free Documentation License from time to time.  Such new
versions will be similar in spirit to the present version, but may
differ in detail to address new problems or concerns.  See
http://www.gnu.org/copyleft/.

Each version of the License is given a distinguishing version number.
If the Document specifies that a particular numbered version of this
License "or any later version" applies to it, you have the option of
following the terms and conditions either of that specified version or
of any later version that has been published (not as a draft) by the
Free Software Foundation.  If the Document does not specify a version
number of this License, you may choose any version ever published (not
as a draft) by the Free Software Foundation.


ADDENDUM: How to use this License for your documents

To use this License in a document you have written, include a copy of
the License in the document and put the following copyright and
license notices just after the title page:

    Copyright (c)  YEAR  YOUR NAME.
    Permission is granted to copy, distribute and/or modify this document
    under the terms of the GNU Free Documentation License, Version 1.2
    or any later version published by the Free Software Foundation;
    with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts.
    A copy of the license is included in the section entitled "GNU
    Free Documentation License".

If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
replace the "with...Texts." line with this:

    with the Invariant Sections being LIST THEIR TITLES, with the
    Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST.

If you have Invariant Sections without Cover Texts, or some other
combination of the three, merge those two alternatives to suit the
situation.

If your document contains nontrivial examples of program code, we
recommend releasing these examples in parallel under your choice of
free software license, such as the GNU General Public License,
to permit their use in free software.