Commits

Zero Piraeus committed ae37368

Import.

  • Participants

Comments (0)

Files changed (64)

+syntax: regexp
+\.swp$
+\.pyc$
+edit        csx.py
+below split script.py
+
+tabedit     doc/lib/declarations.txt
+below split doc/lib/declaration.txt
+below split doc/lib/error.txt
+below split doc/lib/renderable.txt
+below split doc/lib/rules.txt
+below split doc/lib/rule.txt
+below split doc/lib/selectors.txt
+below split doc/lib/selector.txt
+below split doc/lib/text.txt
+below split doc/script/alert.txt
+below split doc/script/parser.txt
+below split doc/script/source.txt
+below split tests.py
+
+tabedit     README.txt
+below split FAQ.txt
+below split COPYING
+
+tabedit     setup.py
+below split clean.py
+below split MANIFEST.in
+
+tabedit     .source.vim
+
+tabdo wincmd t
+tabdo resize
+tabfirst
+
+nmap <silent> <F8> :w<CR>:sp %:p.test<CR>:res<CR>:%!/home/z/etiol/clients/csx.org/bzr/trunk/tests.py<CR>:set syn=c<CR>zRG
+imap <buffer> <silent> <F8> <Esc><F8>
+
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public 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.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
+COPYING
+FAQ.txt
+README.txt
+csx
+csx.py
+script.py
+setup.py
+tests.py
+doc/lib/.declaration.txt.swp
+doc/lib/.declarations.txt.swp
+doc/lib/.error.txt.swp
+doc/lib/.escapedstring.txt.swp
+doc/lib/.renderable.txt.swp
+doc/lib/.rule.txt.swp
+doc/lib/.rules.txt.swp
+doc/lib/.selector.txt.swp
+doc/lib/.selectors.txt.swp
+doc/lib/.tokenstream.txt.swp
+doc/lib/declaration.txt
+doc/lib/declarations.txt
+doc/lib/declarations.txt.test
+doc/lib/error.txt
+doc/lib/escapedstring.txt
+doc/lib/escapedstring.txt.test
+doc/lib/renderable.txt
+doc/lib/rule.txt
+doc/lib/rules.txt
+doc/lib/selector.txt
+doc/lib/selectors.txt
+doc/lib/tokenstream.txt
+doc/lib/tokenstream.txt.test
+doc/script/.alert.txt.swp
+doc/script/.parser.txt.swp
+doc/script/.source.txt.swp
+doc/script/alert.txt
+doc/script/parser.txt
+doc/script/source.txt
+examples/run-all.sh
+examples/css-21-spec/run.sh
+examples/css-21-spec/original/default.css
+examples/zp-old-project/run.sh
+examples/zp-old-project/original/l/branding.css
+examples/zp-old-project/original/l/global.css
+examples/zp-old-project/original/l/menu.css
+examples/zp-old-project/original/l/primary.css
+examples/zp-old-project/original/l/secondary.css
+examples/zp-old-project/original/m/branding.css
+examples/zp-old-project/original/m/global.css
+examples/zp-old-project/original/m/menu.css
+examples/zp-old-project/original/m/primary.css
+examples/zp-old-project/original/m/secondary.css
+examples/zp-old-project/original/s/branding.css
+examples/zp-old-project/original/s/global.css
+examples/zp-old-project/original/s/menu.css
+examples/zp-old-project/original/s/primary.css
+examples/zp-old-project/original/s/secondary.css
+examples/zp-old-project/original/x/branding.css
+examples/zp-old-project/original/x/global.css
+examples/zp-old-project/original/x/menu.css
+examples/zp-old-project/original/x/primary.css
+examples/zp-old-project/original/x/secondary.css
+include *.py
+include *.txt
+include COPYING
+graft doc
+recursive-include examples */original/* */original/*/* */run.sh
+include examples/run-all.sh
+Metadata-Version: 1.0
+Name: csx
+Version: 0.09.07
+Summary: Extended Cascading Stylesheets
+Home-page: http://csx.org
+Author: Zero Piraeus
+Author-email: z@etiol.net
+License: GPLv3
+Description: csx - Create, manipulate and convert CSX stylesheets.
+        
+        CSX is a style language based on `CSS 2.1`_, with two improvements:
+        
+        1. Rules may be nested inside other rules.
+        2. There are no at-rules (like @media or @import).
+        
+        CSX is also somewhat stricter than CSS (for example, you can't split a
+        quoted string over more than one line, and comments must be terminated).
+        
+        See http://csx-style.org (or the file `README.txt` provided with this
+        module) for a complete description of the differences between CSS and CSX.
+        
+        .. _CSS 2.1: http://www.w3.org/TR/CSS21
+        
+        
+Keywords: css web
+Platform: UNKNOWN
+Classifier: Development Status :: 4 - Beta
+Classifier: Environment :: Console
+Classifier: Intended Audience :: Developers
+Classifier: License :: OSI Approved :: GNU General Public License (GPL)
+Classifier: Natural Language :: English
+Classifier: Operating System :: POSIX
+Classifier: Programming Language :: Python :: 3.0
+Classifier: Topic :: Internet :: WWW/HTTP
+Classifier: Topic :: Text Processing
+Classifier: Topic :: Utilities
+
+====================================
+CSX - Extended Cascading Stylesheets
+====================================
+
+CSX adds one powerful language feature to CSS: nested scopes.
+
+For example, the traditional CSS::
+
+    dl {
+        background: yellow;
+        font-family: "Arial Black";
+    }
+
+    dl dt {
+        color: red;
+    }
+
+    dl dd {
+        color: blue;
+    }
+
+    dl dd a {
+        color: green;
+    }
+
+can be written in CSX like this::
+
+    dl {
+        background: yellow;
+        font-family: "Arial Black";
+        dt { color: red }
+        dd {
+            color: blue;
+            a { color: green }
+        }
+    }
+
+You can nest child and sibling combinators::
+
+    ol {
+        > li { color: red }
+        + p { margin-top: 2em }
+    }
+
+... and they'll be handled as you would expect::
+
+    ol > li { color: red }
+    ol + p { margin-top: 2em }
+
+Comments are stripped out automatically. Because the conversion process mangles
+the order of the source and alters line formatting, attempting to keep them in
+what humans would regard as the "right" place would be error-prone.
+
+There's no limit to how far you can nest rules [1]_.
+
+CSS at-rules, such as @media and @import, are *not* allowed in CSX. Pretty much
+anything they can do is better accomplished by appropriate use of the <link>
+element in (X)HTML, and it's assumed that other document languages have similar
+capabilities.
+
+How to install it
+-----------------
+
+Unpack the tarball, cd to the csx-x.y.z directory, and type ::
+
+    sudo python setup.py install
+
+How to use it
+-------------
+
+This distribution includes a utility `csx`, and a Python module `csx.py`.
+
+Converting from CSX to CSS from the command line is simple::
+
+    z@cracker:~/projects/squee$ csx --compact kapow.csx
+
+... as it is from within Python code::
+
+    >>> from csx import Rules
+
+    >>> rules = Rules("/* ... */")
+    >>> rules.flatten()
+    >>> css_text = rules.render("pretty")
+
+You can also convert traditional CSS to CSX::
+
+    z@cracker:~/projects/squee$ csx --optimize kapow.css
+
+    >>> rules = Rules("/* ... */")
+    >>> rules.optimize()
+    >>> csx_text = rules.render("pretty")
+
+For complex stylesheets, this may result in deeply nested CSX. The conversion
+from CSS to CSX ignores the order of rules in the source stylesheet in order to
+maximize nesting; because of the way the cascade works, this might change the
+meaning of the stylesheet. A simple way to check for this is to "round-trip" a
+stylesheet::
+
+    z@cracker:~/projects/squee$ csx --optimize kapow.css | csx --pretty
+
+In general, neither the csx.py module nor the csx utility care whether you feed
+them CSS or CSX - everything is CSX as far as the underlying code is concerned.
+So, you can use csx as a code prettifier ... ::
+
+    z@cracker:~/projects/squee$ csx --pretty kapow.css
+
+... or compressor::
+
+    z@cracker:~/projects/squee$ csx --compact kapow.css
+
+The csx utility has several options, including one intended to make converting
+CSX on the fly by a web server straightforward; typing `csx --help` in a
+terminal will give you the run-down.
+
+The csx.py module is thoroughly documented - typing `help("csx")` from the
+Python interpreter should tell you all you need to know.
+
+Gotchas
+-------
+
+Syntax
+""""""
+
+Writing CSX is straightforward if you already know CSS, but there are some
+differences. Apart from nested rules, changes from CSS2.1_ are:
+
+- Syntax is strictly enforced; all errors are fatal. Illegal syntax that
+  would be ignored (or implicitly fixed) in CSS renders the entire
+  stylesheet invalid in CSX.
+
+- At-rules (`@import`, `@media`, etc.) are not allowed. Any `@` outside a
+  string or comment is a fatal error.
+
+- XML/SGML comment delimiters are not allowed. Any `<!--` or `-->` outside
+  a string or comment is a fatal error.
+
+- Strings must be correctly terminated. For example, ::
+
+        font-family: "Arial Black \n
+
+  is a fatal error; it is *not* ignored as in CSS.
+
+- Blocks and comments must be explicitly closed. For example, ::
+
+        blockquote {
+        color: green;
+        /* EOF */
+
+  is a fatal error; it is *not* implicitly closed as in CSS.
+
+Comments are allowed, although this implementation of CSX removes them
+from input.
+
+.. _CSS2.1: http://www.w3.org/TR/CSS21/
+
+Classes, pseudo-classes, IDs and attribute selectors
+""""""""""""""""""""""""""""""""""""""""""""""""""""
+
+The rule ::
+
+    ul {
+        .nav { background: yellow }
+    }
+
+is equivalent to ::
+
+    ul .nav { background: yellow }
+
+(note the space), and *not* ::
+
+    ul.nav { background: yellow }
+
+... similarly for pseudo-classes, IDs and attribute selectors.
+
+Invalid CSX / CSS
+"""""""""""""""""
+
+This implementation does some checking for illegal syntax, but not much. If you
+get weird results, there's probably an error in your stylesheet - and this
+implementation isn't especially helpful in tracking it down for you.
+
+Hacks
+"""""
+
+Because CSX strips out comments, hacks that rely on legacy browsers' incorrect
+handling of them won't work ... but you shouldn't be using them anyway.
+
+Tricks like the one employed by some CSS resets::
+
+    blockquote:before, blockquote:after,
+    q:before, q:after {
+        content: '';
+        content: none;
+    }
+
+... won't work as intended either, because (in this implementation at least),
+all but the last declaration for a particular property in each rule is simply
+discarded. This might be considered a bug.
+
+Credits / Copyright
+-------------------
+
+CSX was created by Zero Piraeus <z@etiol.net>, but inspired by an article on
+Eric Meyer's blog about nested scopes in CSS. It's released under the GNU
+General Public License (version 3 or later), a copy of which is included with
+this distribution in the file "COPYING".
+
+
+.. [1]  In this implementation, Python's internal recursion limits apply, but
+        you're unlikely to hit those in any sane stylesheet.
+
+#! /usr/bin/env python3
+
+import os
+import sys
+import warnings
+
+import script
+
+BASE = os.path.abspath(os.path.dirname(sys.argv[0]))
+
+def clean_tree():
+    """Remove junk files from the working tree."""
+    for root, __, files in os.walk(BASE):
+        for filename in files:
+            filepath = os.path.relpath(os.path.join(root, filename))
+            basename, ext = os.path.splitext(filename)
+            if ext in {".test", ".pyc"}:
+                os.remove(filepath)
+            if ext.startswith(".~"):
+                warnings.warn("found {0!r}".format(filepath))
+
+def update_script_usage():
+    """Update the docstring for scripts/csx to show the usage message."""
+    script_path = os.path.join(BASE, "csx")
+    with open(script_path, "r") as f:
+        parts = f.read().split('"""')
+    parser = script.Parser()
+    prog_name = parser.get_prog_name()
+    parts[1] = parser.format_help().replace(prog_name, "csx") + "\n"
+    with open(script_path, "w") as f:
+        f.write('"""'.join(parts))
+
+if __name__ == "__main__":
+    warnings.simplefilter("always")
+    clean_tree()
+    update_script_usage()
+#!/usr/bin/python3
+
+# csx - convert between CSX [Extended Cascading Stylesheets] and CSS.
+# Copyright (C) 2009 Zero Piraeus
+#
+# This program is free software: you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+# GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+"""Usage: csx [OPTION]... [FILE]...
+
+Convert each FILE from CSX to traditional CSS, or optimize each CSS/CSX FILE.
+With no FILE, or when FILE is -, read standard input.
+
+Options:
+  --version            show program's version number and exit
+  -h, --help           show this help message and exit
+  -q, --quiet          don't show warning messages
+
+  Formatting:
+    -b, --bare         equivalent to --style=bare
+    -c, --compact      equivalent to --style=compact
+    -p, --pretty       equivalent to --style=pretty
+    --style=STYLE      format output in the specified STYLE
+                       (bare, compact or pretty; default: pretty)
+    --tab=TAB          width of one level of indentation
+                       (requires --style=pretty; default: 4)
+    --width=WIDTH      try to keep output within WIDTH columns
+                       (requires --style=pretty; default: 80; 0=unlimited)
+
+  Optimization:
+    WARNING: --optimize changes the order of rules in the source document,
+    so may alter the meaning of output according to cascade rules.
+    --aggressive alters source order further still.
+
+    -a, --aggressive   eliminate redundant declarations (implies --optimize)
+    -n, --no-collapse  don't collapse redundant nesting (implies --optimize)
+    -o, --optimize     convert to optimally nested CSX
+
+  CGI:
+    -x, --cache        Output the most recently modified of FILE.STYLE.css or
+                       FILE.csx (converting to CSS if necessary), and save the
+                       result of any conversion to FILE.STYLE.css
+                       (not compatible with optimization options)
+
+"""
+
+import optparse
+import os
+import platform
+import sys
+import warnings
+
+import csx
+
+
+class Alert(UserWarning): pass
+
+
+class Parser(optparse.OptionParser):
+
+    """CSX option parser."""
+
+    DELIMITERS = {
+        "bare": "",
+        "compact": "\n",
+        "pretty": "\n\n",
+    }
+
+    OPTIONS = (
+        (None, [
+            ("-$ --debug", {
+                "action": "store_true",
+                "default": False,
+                "help": optparse.SUPPRESS_HELP
+            }),
+            ("-q --quiet", {
+                "action": "store_true",
+                "default": False,
+                "help": "don't show warning messages",
+            }),
+        ]),
+        ("Formatting", [
+            ("--style", {
+                "choices": csx.STYLES,
+                "default": csx.DEFAULT_STYLE,
+                "help": (
+                    "format output in the specified STYLE              "
+                    "({0} or {1}; default: %default)"
+                ).format(", ".join(csx.STYLES[:-1]), csx.STYLES[-1]),
+            }),
+            ("--tab", {
+                "default": len(csx.TAB) if (set(csx.TAB) == {" "}) else 4,
+                "type": "int",
+                "help": (
+                    "width of one level of indentation              "
+                    "(requires --style=pretty; default: %default)"
+                ),
+            }),
+            ("--width", {
+                "default": csx.WIDTH,
+                "type": "int",
+                "help": (
+                    "try to keep output within WIDTH columns        "
+                    "(requires --style=pretty; default: %default; 0=unlimited)"
+                ),
+            }),
+        ]),
+        ("Optimization", [
+            (
+                "WARNING: --optimize changes the order of rules in the source "
+                "document, so may alter the meaning of output according to "
+                "cascade rules. --aggressive alters source order further "
+                "still."
+            ),
+            ("-a --aggressive", {
+                "action": "store_true",
+                "default": False,
+                "help": "eliminate redundant declarations "
+                "(implies --optimize)",
+            }),
+            ("-n --no-collapse", {
+                "action": "store_false",
+                "default": True,
+                "dest": "collapse",
+                "help": "don't collapse redundant nesting "
+                "(implies --optimize)",
+            }),
+            ("-o --optimize", {
+                "action": "store_true",
+                "default": False,
+                "help": "convert to optimally nested CSX",
+            }),
+        ]),
+        ("CGI", [
+            ("-x --cache", {
+                "action": "store_true",
+                "default": False,
+                "help": (
+                    "Output the most recently modified of FILE.STYLE.css or "
+                    "FILE.csx (converting to CSS if necessary), and save the "
+                    "result of any conversion to FILE.STYLE.css          "
+                    "(not compatible with optimization options)"
+                ),
+            }),
+        ]),
+    )
+
+    # Add shortcut options.
+    OPTIONS[1][1][0:0] = [
+        ("-{0[0]} --{0}".format(style), {
+            "action": "store_const",
+            "const": style,
+            "dest": "style",
+            "help": "equivalent to --style={0}".format(style),
+        }) for style in csx.STYLES
+    ]
+
+    def __init__(self):
+        optparse.OptionParser.__init__(self, version=csx.__version__)
+        self.description = (
+            "Convert each FILE from CSX to traditional CSS, or optimize each "
+            "CSS/CSX FILE. With no FILE, or when FILE is -, read standard "
+            "input."
+        )
+        self.usage = "%prog [OPTION]... [FILE]..."
+        for title, args in self.OPTIONS:
+            self.__add_group(title, *args)
+        self.parse_args()
+        csx.TAB = " " * self.values.tab
+        csx.WIDTH = self.values.width
+        if not self.largs:
+            self.largs = ["-"]
+        if self.values.quiet:
+            warnings.simplefilter("ignore")
+        else:
+            warnings.simplefilter("once", Alert)
+
+    def __add_group(self, title:{str, None}, *args):
+        """Add an option group to `self`."""
+        if isinstance(args[0], str):
+            description, *args = args
+        else:
+            description = None
+        if title is None:
+            target = self
+        else:
+            target = optparse.OptionGroup(self, title, description)
+        for option, attrs in args:
+            target.add_option(*option.split(), **attrs)
+        if isinstance(target, optparse.OptionGroup):
+            self.add_option_group(target)
+
+    def __check_options(self):
+        """Check for conflicting option values, and enforce implied options."""
+        if self.values.optimize:
+            opt = "--optimize"
+        elif self.values.aggressive:
+            self.values.optimize = True
+            opt = "--aggressive"
+        elif not self.values.collapse:
+            self.values.optimize = True
+            opt = "--no-collapse"
+        if self.values.optimize:
+            if self.values.cache:
+                raise csx.Error("--cache and {0} are incompatible".format(opt))
+            else:
+                warnings.warn(Alert("{0} alters rule order".format(opt)))
+        if self.values.style != "pretty":
+            if self.values.tab != self.defaults["tab"]:
+                warnings.warn(Alert("--tab requires --style=pretty"))
+            if self.values.width != self.defaults["width"]:
+                warnings.warn(Alert("--width requires --style=pretty"))
+
+    def __process_cached(self) -> str:
+        """Process the files in `self.largs`, or their caches."""
+        output = []
+        for source in (Source(a, self.values.style) for a in self.largs):
+            try:
+                if source.cached:
+                    output.append(source.read(cache=True))
+                else:
+                    rules = csx.Rules(source.read())
+                    text = rules.render(self.values.style)
+                    with open(source.cache_name, "w") as cache:
+                        cache.write(text)
+                    output.append(text)
+            except csx.Error as exc:
+                exc.source = source.name
+                raise
+        return self.DELIMITERS[self.values.style].join(output)
+
+    def __process_uncached(self) -> str:
+        """Process the files in `self.largs`."""
+        rules = csx.Rules()
+        for source in (Source(a) for a in self.largs):
+            try:
+                rules.extend(csx.Rules(source.read()))
+            except csx.Error as exc:
+                exc.source = source.name
+                raise
+        if self.values.optimize:
+            rules.optimize(self.values.collapse, self.values.aggressive)
+        else:
+            rules.flatten()
+        return rules.render(self.values.style)
+
+    def process(self) -> str:
+        """Process the command line."""
+        self.__check_options()
+        if self.values.cache:
+            return self.__process_cached()
+        else:
+            return self.__process_uncached()
+
+
+class Source(object):
+
+    """A CSX source."""
+
+    def __init__(self, name:str, style:str=""):
+        self.name = name
+        self.style = style
+
+    def read(self, cache:bool=False) -> str:
+        """Return the contents of a file, or its cache, or standard input."""
+        if cache and self.name == "-":
+            raise csx.Error("can't cache standard input")
+        elif self.name == "-":
+            f = sys.stdin
+        elif cache and self.cached:
+            f = open(self.cache_name)
+        else:
+            f = open(self.name)
+        if os.isatty(f.fileno()):
+            sys.stderr.write(self.quit_msg)
+        return f.read()
+
+    @property
+    def cache_name(self) -> str:
+        """Filename of a possible cache of the file `self` refers to.
+
+        Example::
+
+            >>> {Source(filename, "pretty").cache_name for filename in [
+            ...     "squee",
+            ...     "squee.csx",
+            ...     "squee.CSS",
+            ...     "squee.bare.css",
+            ...     "squee.COMPACT",
+            ...     "squee.pretty.css",
+            ...     "squee.pretty.CSX",
+            ... ]}
+            {'squee.pretty.css'}
+
+        """
+        filename = self.name
+        basename, ext = os.path.splitext(filename)
+        if ext.lower() in {".css", ".csx"}:
+            filename = basename
+            basename, ext = os.path.splitext(filename)
+        if ext.lower() in {".{0}".format(x) for x in csx.STYLES}:
+            filename = basename
+        return "{0}.{1}.css".format(filename, self.style)
+
+    @property
+    def cached(self) -> bool:
+        """True if a current cache exists of the file `self` refers to.
+
+        Example::
+
+            >>> import tempfile
+            >>> import time
+            >>> temp_dir = tempfile.mkdtemp()
+            >>> squee = os.path.join(temp_dir, "squee.csx")
+            >>> pretty = os.path.join(temp_dir, "squee.pretty.css")
+            >>> for filename in [squee, pretty]:
+            ...     with open(filename, "w") as f:
+            ...         _ = f.write("/* blah */")
+            >>> one_week_ago = time.time() - 7 * 24 * 60 * 60
+            >>> os.utime(squee, (one_week_ago, one_week_ago))
+            >>> Source(squee, "pretty").cached
+            True
+            >>> Source(squee, "compact").cached
+            False
+            >>> # cleanup ...
+            >>> os.remove(squee)
+            >>> os.remove(pretty)
+            >>> os.rmdir(temp_dir)
+
+        """
+        cache_name = self.cache_name
+        cache_exists = os.path.exists(cache_name)
+        if cache_exists and os.path.exists(self.name):
+            return os.path.getmtime(cache_name) > os.path.getmtime(self.name)
+        elif cache_exists:
+            return True
+        else:
+            return False
+
+    @property
+    def quit_msg(self) -> str:
+        """Platform-appropriate quit message."""
+        if platform.system() == "Linux":
+            eof = "Ctrl-D"
+        elif platform.system() == "MacOS":
+            eof = "Cmd-Q"
+        elif platform.system() == "Windows":
+            eof = "Ctrl-Z then Return"
+        else:
+            eof = "EOF"
+        return "[reading from terminal; terminate with {0}]\n".format(eof)
+
+
+def _main():
+    warning_text = os.path.basename(sys.argv[0]) + ": warning: {0}\n"
+    warnings.formatwarning = lambda msg, *a, **k: warning_text.format(msg)
+    parser = Parser()
+    try:
+        print(parser.process())
+    except Exception as exc:
+        if parser.values.debug:
+            raise
+        elif isinstance(exc, EnvironmentError):
+            details = exc.strerror.lower()
+            if exc.filename:
+                parser.error("{0!r}: {1}".format(exc.filename, details))
+            else:
+                parser.error(details)
+        elif isinstance(exc, csx.Error):
+            parser.error(exc)
+        else:
+            parser.error("internal error; run with --debug for details.")
+    except KeyboardInterrupt:
+        return "[interrupted]"
+
+
+if __name__ == "__main__":
+    sys.exit(_main())
+
+#!/usr/bin/env python3
+
+# csx.py - Extended Cascading Stylesheets.
+# Copyright (C) 2009 Zero Piraeus
+#
+# This program is free software: you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+# GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+# TODO: register csx-style.org, publish, etc :-)
+
+"""csx - Create, manipulate and convert CSX stylesheets.
+
+CSX is a style language based on `CSS 2.1`_, with two improvements:
+
+1. Rules may be nested inside other rules.
+2. There are no at-rules (like @media or @import).
+
+CSX is also somewhat stricter than CSS (for example, you can't split a
+quoted string over more than one line, and comments must be terminated).
+
+See http://csx-style.org (or the file `README.txt` provided with this
+module) for a complete description of the differences between CSS and CSX.
+
+.. _CSS 2.1: http://www.w3.org/TR/CSS21
+
+"""
+
+import collections
+import copy
+import re
+
+__author__ = "Zero Piraeus <z@etiol.net>"
+__version__ = "0.09.07"
+
+DEFAULT_STYLE = "pretty"
+
+STYLES = ("bare", "compact", "pretty")
+
+TAB = "    "
+
+WIDTH = 80
+
+
+class Error(Exception):
+
+    """An error which may usefully be displayed by the csx utility."""
+
+    # Allows incorporation of filename and line no. for output to end-users
+    # by the csx utility - see doc/lib/error.txt for details.
+
+    def __init__(self, msg:str="", line:int=0, source:str=""):
+        self.msg = msg
+        self.line = line
+        self.source = source
+
+    def __str__(self):
+        if self.source == "-":
+            source = "<stdin>"
+        elif self.source:
+            source = repr(self.source)
+        else:
+            source = ""
+        if self.line:
+            line = "line {0}".format(self.line)
+        else:
+            line = ""
+        location = ", ".join(x for x in (source, line) if x)
+        return ": ".join(x for x in (location, self.msg) if x)
+
+
+class _Comparable(object):
+
+    """Base class for objects with sane comparison behaviour."""
+
+    # The following methods define comparisons other than `__lt__` in terms of
+    # `__lt__`, which is not otherwise the case for subclasses of e.g. `set`.
+
+    def __ge__(self, other):
+        less_than = (self < other)
+        return NotImplemented if less_than is NotImplemented else not less_than
+
+    def __gt__(self, other):
+        return other < self
+
+    def __le__(self, other):
+        more_than = (other < self)
+        return NotImplemented if more_than is NotImplemented else not more_than
+
+
+class _Renderable(object):
+
+    """Base class for renderable objects."""
+
+    def __repr__(self):
+        return "{0}({1!r})".format(self.__class__.__name__, str(self))
+
+    def __str__(self):
+        return self.render("compact", level=1) # `level=1` to prevent newlines.
+
+    def render(self, style:str=DEFAULT_STYLE, level:int=0) -> str:
+        """Return a textual representation of `self`.
+
+        Arguments:
+            :`style`: One of `STYLES`.
+            :`level`: Indentation level of "pretty" output.
+
+        Example::
+
+            >>> selector = Selector("ol li a")
+
+            >>> print(selector.render())
+            ol li a
+
+        """
+        # `SEP` is defined by the subclass.
+        return self.SEP[style].join(self)
+
+
+class _Renderable_Recursive(_Renderable):
+
+    """Base class for recursively renderable objects."""
+
+    def render(self, style:str=DEFAULT_STYLE, level:int=0) -> str:
+        """Return a textual representation of `self`.
+
+        Arguments:
+            :`style`: One of `STYLES`.
+            :`level`: Indentation level of "pretty" output.
+
+        Example::
+
+            >>> ds = Declarations("color: red; font-family: serif")
+
+            >>> print(ds.render())
+            color: red;
+            font-family: serif;
+
+        """
+        # `SEP` is defined by the subclass.
+        return self.SEP[style].join(x.render(style, level) for x in self)
+
+
+class Declaration(_Renderable, tuple):
+
+    """A CSX declaration; e.g. "color: red".
+
+    Examples::
+
+        >>> d1 = Declaration("color: red")
+
+        >>> d2 = Declaration(["color", "red"])
+
+        >>> assert d1 == d2
+
+    """
+
+    SEP = {
+        "bare": ":",
+        "compact": ": ",
+        "pretty": ": ",
+    }
+
+    def __new__(cls, arg:collections.Sequence):
+        if isinstance(arg, str):
+            try:
+                key, value = Text(arg).iterate_as(cls)
+            except ValueError as cause:
+                raise Error("invalid declaration {0!r}".format(arg)) from cause
+            else:
+                return tuple.__new__(cls, (key.lower(), value))
+        else:
+            return tuple.__new__(cls, arg)
+
+    def render(self, style:str=DEFAULT_STYLE, level:int=0) -> str:
+        """Return a textual representation of `self`.
+
+        Arguments:
+            :`style`: One of `STYLES`.
+            :`level`: Indentation level of "pretty" output.
+
+        Example::
+
+            >>> declaration = Declaration("color: red")
+
+            >>> print(declaration.render())
+            color: red;
+
+        """
+        if style == "pretty":
+            return (TAB * level) + super().render(style, level) + ";"
+        else:
+            return super().render(style, level)
+
+
+class Declarations(_Renderable_Recursive, _Comparable, dict):
+
+    """A CSX declaration block; e.g. "color: red; font-family: serif".
+
+    Examples::
+
+        >>> ds1 = Declarations("color: red; font-family: serif")
+
+        >>> ds2 = Declarations({
+        ...     "color": "red",
+        ...     "font-family": "serif",
+        ... })
+
+        >>> ds3 = Declarations([
+        ...     Declaration("color: red"),
+        ...     Declaration("font-family: serif"),
+        ... ])
+
+    Underscores are replaced by hyphens in keyword arguments::
+
+        >>> ds4 = Declarations(color="red", font_family="serif")
+
+        >>> assert ds1 == ds2 == ds3 == ds4
+
+    Iterating over a `Declarations` instance returns `Declaration`
+    instances, in order::
+
+        >>> [d for d in ds1]
+        [Declaration('color: red'), Declaration('font-family: serif')]
+
+    Unlike `dict`, `Declarations` is orderable::
+
+        >>> ds5 = Declarations("color: blue; font-family: serif")
+
+        >>> assert ds1 > ds5
+
+    """
+
+    SEP = {
+        "bare": ";",
+        "compact": "; ",
+        "pretty": "\n",
+    }
+
+    def __init__(self, arg:collections.Iterable=(), **kwargs):
+        if isinstance(arg, str):
+            arg = (Declaration(s) for s in Text(arg).iterate_as(Declarations))
+        elif isinstance(arg, collections.Mapping):
+            arg = arg.items()
+        kwargs = {k.replace("_", "-"): v for k, v in kwargs.items()}
+        self.update(dict(arg, **kwargs))
+
+    def __iter__(self):
+        return iter(sorted(self.items()))
+
+    def __lt__(self, other):
+        return sorted(self.items()) < sorted(other.items())
+
+    def items(self) -> set:
+        """Extend `dict.items` to return a set of `Declaration` instances.
+
+        Example::
+
+            >>> from pprint import pprint
+
+            >>> ds = Declarations("color: red; font-family: serif")
+
+            >>> pprint(ds.items())
+            {Declaration('color: red'), Declaration('font-family: serif')}
+
+        """
+        return {Declaration(x) for x in super().items()}
+
+
+class Rule(_Renderable, _Comparable):
+
+    """A CSX rule; e.g. "dt, dd { color: red; a { color: blue } }".
+
+    Attributes:
+        :`selectors`:    A `Selectors` instance.
+        :`declarations`: A `Declarations` instance.
+        :`rules`:        A `Rules` instance.
+
+    Examples::
+
+        >>> r1 = Rule("dt, dd { color: red; a { color: blue } }")
+
+        >>> ss = Selectors("dt, dd")
+        >>> ds = Declarations("color: red")
+        >>> rs = Rules("a { color: blue }")
+
+        >>> r2 = Rule(selectors=ss, declarations=ds, rules=rs)
+
+        >>> assert r1 == r2
+
+    If declarations specified in string and keyword arguments conflict,
+    the string argument takes precedence::
+
+        >>> ds = Declarations("background: yellow; color: red")
+
+        >>> Rule("dl { background: aqua }", declarations=ds)
+        Rule('dl { background: aqua; color: red }')
+
+    """
+
+    SEP = {
+        "bare": ";",
+        "compact": "; ",
+        "pretty": "\n",
+    }
+
+    FORMAT = {
+        "bare": "{selectors}{{{block}}}",
+        "compact": "{selectors} {{ {block} }}",
+        "pretty": "{selectors} {{\n{block}\n{indent}}}",
+    }
+
+    def __init__(self, text:str="", **kwargs):
+        self.selectors = kwargs.pop("selectors", Selectors())
+        self.declarations = kwargs.pop("declarations", Declarations())
+        self.rules = kwargs.pop("rules", Rules())
+        if kwargs:
+            invalid = kwargs.keys().pop()
+            raise TypeError("invalid keyword argument {0!r}".format(invalid))
+        text_rules = Text(text).extract()
+        if len(text_rules) > 1:
+            raise ValueError("string argument describes multiple rules")
+        elif text_rules:
+            rule = text_rules.pop()
+            self.selectors.update(rule.selectors)
+            self.declarations.update(rule.declarations)
+            self.rules.extend(rule.rules)
+
+    def __eq__(self, other):
+        return (
+                (self.selectors == other.selectors)
+            and (self.declarations == other.declarations)
+            and (self.rules == other.rules)
+        )
+
+    def __lt__(self, other):
+        if self.selectors != other.selectors:
+            return self.selectors < other.selectors
+        elif self.declarations != other.declarations:
+            return self.declarations < other.declarations
+        elif self.rules != other.rules:
+            return self.rules < other.rules
+        else:
+            return False
+
+    def collapse(self):
+        """Remove redundant nesting from `self`.
+
+        Example::
+
+            >>> rule = Rule("ol { li { a { color: blue } } }")
+
+            >>> rule.collapse()
+
+            >>> print(rule.render())
+            ol li a {
+                color: blue;
+            }
+
+        """
+        while (
+                (not self.declarations)
+            and (len(self.selectors) == 1)
+            and (len(self.rules) == 1)
+            and (len(self.rules[0].selectors) == 1)
+        ):
+            child = self.rules.pop()
+            self.selectors = child.selectors.prefix(self.selectors)
+            self.declarations = child.declarations
+            self.rules = child.rules
+        for rule in self.rules:
+            rule.collapse()
+
+    def render(self, style:str=DEFAULT_STYLE, level:int=0) -> str:
+        """Return a textual representation of `self`.
+
+        Arguments:
+            :`style`: One of `STYLES`.
+            :`level`: Indentation level of "pretty" output.
+
+        Example::
+
+            >>> rule = Rule("dt, dd { color: red; a { color: blue } }")
+
+            >>> print(rule.render())
+            dt, dd {
+                color: red;
+                a {
+                    color: blue;
+                }
+            }
+
+        """
+        selectors = self.selectors.render(style, level)
+        if self.declarations and self.rules:
+            block = self.SEP[style].join((
+                self.declarations.render(style, level + 1),
+                self.rules.render(style, level + 1),
+            ))
+        elif self.declarations:
+            block = self.declarations.render(style, level + 1)
+        elif self.rules:
+            block = self.rules.render(style, level + 1)
+        else:
+            block = ""
+        indent = TAB * level
+        return self.FORMAT[style].format(**locals())
+
+
+class Rules(_Renderable_Recursive, list):
+
+    """A CSX rule block; e.g. "ol { background: aqua }; li { color: red }".
+
+    Examples::
+
+        >>> rs1 = Rules('''
+        ...     ol { background: aqua }
+        ...     li { color: red }
+        ... ''')
+
+        >>> rs2 = Rules([
+        ...     Rule("ol { background: aqua }"),
+        ...     Rule("li { color: red }"),
+        ... ])
+
+        >>> assert rs1 == rs2
+
+    """
+
+    SEP = {
+        "bare": "",
+        "compact": "\n",
+        "pretty": "\n\n",
+    }
+
+    # Nested rules are delimited differently to top-level rules - see
+    # `Rules.render`.
+    ALT_SEP = {
+        "bare": ";",
+        "compact": "; ",
+        "pretty": "\n",
+    }
+
+    def __init__(self, arg:collections.Iterable=()):
+        if isinstance(arg, str):
+            self[:] = Text(arg).extract()
+        else:
+            self[:] = arg
+
+    def _graft(self, tree:"Rules") -> list:
+        """Merge `tree` into `self` and return a list of leaf rules.
+
+        Arguments:
+            :`tree`: As returned by `Selectors._sprout`.
+
+        Example::
+
+            >>> rules = Rules('''
+            ...     dl, ol, ul { margin: 1em; padding: 1em }
+            ...     dl { background: yellow }
+            ...     ol, ul { background: aqua }
+            ... ''')
+
+            >>> tree = Selectors("dl dt, dl dd, ol li, ul li")._sprout()
+
+            >>> leaves = rules._graft(tree)
+
+            >>> sorted(leaves)
+            [Rule('dt, dd {  }'), Rule('li {  }')]
+
+            >>> print(rules.render("compact"))
+            dl, ol, ul { margin: 1em; padding: 1em }
+            dl { background: yellow; dt, dd {  } }
+            ol, ul { background: aqua; li {  } }
+
+        """
+        # Used by `_merge_optimized` - somewhat voodoo, but the examples above
+        # should make it clear *what* is happening, if not *how*. Essentially
+        # we search for nodes in `self` that, in traditional CSS, would
+        # have the same selectors as those in `tree`, so we can insert
+        # declarations from `tree` at those nodes as appropriate. This is
+        # tricky stuff, though, and can only really be properly understood by
+        # reading `_merge_optimized` as well. Action by side-effect is not
+        # ideal, admittedly, but I can't see an easier way to do it.
+        leaves = []
+        target_selectors = [r.selectors for r in self]
+        for rule in tree:
+            if rule.selectors in target_selectors:
+                target = self[target_selectors.index(rule.selectors)]
+            else:
+                self.append(rule)
+                target = rule
+            if ("$", "leaf") in rule.declarations.items():
+                leaves.append(target)
+                del rule.declarations["$"]
+            if rule.rules:
+                leaves += target.rules._graft(rule.rules)
+        return leaves
+
+    def _merge_normalized(self, rule:Rule, _prefixes:set=set()):
+        """Merge a rule into `self` for each declaration in `rule`.
+
+        Arguments:
+            :`rule`:      Rule to be merged into `self`.
+            :`_prefixes`: Used internally - ***DO NOT SET***.
+
+        Example::
+
+            >>> normalized = Rules('''
+            ...     dl { background: yellow }
+            ...     dl { margin: 1em }
+            ...     dl { padding: 1em }
+            ...     dl dt, dl dd { color: red }
+            ... ''')
+
+            >>> rule = Rule('''
+            ...     ol, ul {
+            ...         background: aqua;
+            ...         margin: 1em;
+            ...         padding: 1em;
+            ...         li { color: red }
+            ...     }
+            ... ''')
+
+            >>> normalized._merge_normalized(rule)
+
+            >>> print(normalized.render("compact"))
+            dl { background: yellow }
+            dl, ol, ul { margin: 1em }
+            dl, ol, ul { padding: 1em }
+            dl dt, dl dd, ol li, ul li { color: red }
+            ol, ul { background: aqua }
+
+        """
+        # Used by `Rules.optimize`.
+        selectors = rule.selectors.prefix(_prefixes)
+        for dec in (Declarations({d}) for d in rule.declarations):
+            for candidate in self:
+                if dec == candidate.declarations:
+                    candidate.selectors.update(selectors)
+                    break
+            else:
+                self.append(Rule(selectors=selectors.copy(), declarations=dec))
+        for subrule in rule.rules:
+            self._merge_normalized(subrule, selectors)
+
+    def _merge_optimized(self, rule:Rule):
+        """Merge an optimized rule tree based on `rule` into `self`.
+
+        Arguments:
+            :`rule`: Rule to be merged into `self`.
+
+        Example::
+
+            >>> optimized = Rules('''
+            ...     dl { background: yellow }
+            ...     ol, ul { background: aqua }
+            ... ''')
+
+            >>> rule = Rule("dl dt, dl dd, ol li, ul li { color: red }")
+
+            >>> optimized._merge_optimized(rule)
+
+            >>> print(optimized.render("compact"))
+            dl { background: yellow; dt, dd { color: red } }
+            ol, ul { background: aqua; li { color: red } }
+
+        """
+        # Used by `Rules.optimize`.
+        for leaf in self._graft(rule.selectors._sprout()):
+            leaf.declarations.update(rule.declarations)
+            for subrule in rule.rules:
+                leaf.rules._merge_optimized(subrule)
+
+    def flatten(self, _prefixes:set=set()):
+        """Convert `self` to un-nested rules.
+
+        Arguments:
+            :`_prefixes`: Used internally - ***DO NOT SET***.
+
+        Example::
+
+            >>> rules = Rules('''
+            ...
+            ...     dl, ol, ul {
+            ...         margin: 1em;
+            ...         padding: 1em;
+            ...     }
+            ...
+            ...     ol, ul {
+            ...         background: aqua;
+            ...         li { color: red }
+            ...     }
+            ...
+            ...     dl {
+            ...         background: yellow;
+            ...         dt, dd { color: red }
+            ...     }
+            ...
+            ... ''')
+
+            >>> rules.flatten()
+
+            >>> print(rules.render("compact"))
+            dl, ol, ul { margin: 1em; padding: 1em }
+            ol, ul { background: aqua }
+            ol li, ul li { color: red }
+            dl { background: yellow }
+            dl dt, dl dd { color: red }
+
+        """
+        flattened = []
+        for rule in self:
+            selectors = rule.selectors.prefix(_prefixes)
+            if rule.declarations:
+                new = Rule(selectors=selectors, declarations=rule.declarations)
+                flattened.append(new)
+            rule.rules.flatten(selectors)
+            flattened += rule.rules
+        self[:] = flattened
+
+    def optimize(self, collapse:bool=True, normalize:bool=False):
+        """Optimize `self`.
+
+        Arguments:
+            :`collapse`:  If True, collapse redundant nesting.
+            :`normalize`: If True, normalize `self` before optimizing
+                          (dramatically alters rule order).
+
+        Example::
+
+            >>> rules = Rules('''
+            ...     dl { background: yellow }
+            ...     dl, ol, ul { margin: 1em }
+            ...     dl, ol, ul { padding: 1em }
+            ...     dl dt, dl dd, ol li, ul li { color: red }
+            ...     ol, ul { background: aqua }
+            ... ''')
+
+            >>> rules.optimize()
+
+            >>> print(rules.render("compact"))
+            dl, ol, ul { margin: 1em; padding: 1em }
+            dl { background: yellow; dt, dd { color: red } }
+            ol, ul { background: aqua; li { color: red } }
+
+        """
+        if normalize:
+            normalized = Rules()
+            for rule in self:
+                normalized._merge_normalized(rule)
+            rules = normalized
+        else:
+            rules = self
+        optimized = Rules()
+        for rule in rules:
+            optimized._merge_optimized(rule)
+        if collapse:
+            for rule in optimized:
+                rule.collapse()
+        optimized.sort()
+        self[:] = optimized
+
+    def render(self, style:str=DEFAULT_STYLE, level:int=0) -> str:
+        """Return a textual representation of `self`.
+
+        Arguments:
+            :`style`: One of `STYLES`.
+            :`level`: Indentation level of "pretty" output.
+
+        Example::
+
+            >>> rules = Rules('''
+            ...
+            ...     dl, ol, ul {
+            ...         margin: 1em;
+            ...         padding: 1em;
+            ...     }
+            ...
+            ...     ol, ul {
+            ...         background: aqua;
+            ...         li { color: red }
+            ...     }
+            ...
+            ...     dl {
+            ...         background: yellow;
+            ...         dt, dd { color: red }
+            ...     }
+            ...
+            ... ''')
+
+            >>> print(rules.render("compact"))
+            dl, ol, ul { margin: 1em; padding: 1em }
+            ol, ul { background: aqua; li { color: red } }
+            dl { background: yellow; dt, dd { color: red } }
+
+        """
+        if (level == 0) or (self.SEP is self.ALT_SEP):
+            return super().render(style, level)