--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/AUTHORS	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,13 @@
+Founder:
+  Aziz Köksal <aziz.koeksal@gmail.com>
+  "All rights to the code I've written will pass over to Jari-Matti Mäkelä,
+  in case I catch the bus or the bus catches me.
+  My death will probably not be made known anywhere on the internet,
+  therefore my testament will become effective if I don't
+  show any signs of life for 6 months on the internet.
+  Within this time limit I may always revoke or edit this testament,
+  by committing to the hg repository at http://hg.sharesource.org/dil/
+  Only the latest revision of this file is to be considered valid."
+    - Aziz Köksal
+Contributors:
+  Jari-Matti Mäkelä <jmjmak@utu.fi>

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/COPYING	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,674 @@
+                    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>.

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/README	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,32 @@
+dil
+===
+Copyright (c) 2008 by Aziz Köksal <aziz.koeksal@gmail.com>
+This program is free software, licensed under the GPL3.
+Please, read the license file, COPYING, for further information.
+
+Description
+===========
+This software is a compiler written in D for the D programming language.
+
+How To Compile dil
+==================
+In order to compile dil you need to have:
+ *) DMD 1.028 (http://www.digitalmars.com/d/1.0/changelog.html)
+ *) Tango 0.99.5 (http://dsource.org/projects/tango/)
+ *) DSSS 0.71 (http://dsource.org/projects/dsss/)
+
+If you can't compile dil because you have a newer version of these programs
+then please report the problem to me (see Bugs section.)
+
+Before you run dil, make sure that the executable can find config.d and
+lang_en.d (which are located in trunk/src/.)
+The language can be configured in config.d.
+
+Bugs And Patches
+================
+"errare humanum est, ignoscere divinum" - to err is human, to forgive divine.
+ - Cicero
+
+Users can report problems with this software or submit patches by:
+ *) contacting me: aziz.koeksal@gmail.com
+ *) filing a bug report here: http://code.google.com/p/dil/issues/list

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/dsss.conf	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,10 @@
+name = dil
+version = 0.1
+[src/main.d]
+type = binary
+target = dil
+version(GNU) {
+  buildflags = -Isrc/ -Ldsss_objs/G/cmd.DDoc.o -Ldsss_objs/G/cmd.DDocXML.o
+} else {
+  buildflags = -Isrc/
+}

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/i18n/build.py	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,3 @@
+# -*- coding: utf-8 -*-
+# Author: Aziz Köksal
+# License: GPL2

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/i18n/de.cat	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,86 @@
+Authors:
+- {EMail: aziz.koeksal@gmail.com, Name: Aziz Köksal}
+LangCode: de
+License: GPL3
+Messages:
+- {Annot: '', ID: 0, LastEd: 0, Text: 'illegales Zeichen gefunden: ''{0}'''}
+- {Annot: '', ID: 1, LastEd: 0, Text: ungültiges Unicodezeichen.}
+- {Annot: '', ID: 2, LastEd: 0, Text: ungültige UTF-8-Sequenz.}
+- {Annot: '', ID: 3, LastEd: 0, Text: unterminiertes Zeichenliteral.}
+- {Annot: '', ID: 4, LastEd: 0, Text: leeres Zeichenliteral.}
+- {Annot: '', ID: 5, LastEd: 0, Text: erwartete 'line' nach '#'.}
+- {Annot: '', ID: 6, LastEd: 0, Text: 'Ganzzahl nach #line erwartet.'}
+- {Annot: '', ID: 7, LastEd: 0, Text: erwartete Dateispezifikation (z.B. "pfad\zur\datei".)}
+- {Annot: '', ID: 8, LastEd: 0, Text: unterminierte Dateispezifikation (filespec.)}
+- {Annot: '', ID: 9, LastEd: 0, Text: ein Special Token muss mit einem Zeilenumbruch
+    abgeschlossen werden.}
+- {Annot: '', ID: 10, LastEd: 0, Text: unterminiertes Zeichenkettenliteral.}
+- {Annot: '', ID: 11, LastEd: 0, Text: 'Nicht-Hexzeichen ''{0}'' in Hexzeichenkette
+    gefunden.'}
+- {Annot: '', ID: 12, LastEd: 0, Text: ungerade Anzahl von Hexziffern in Hexzeichenkette.}
+- {Annot: '', ID: 13, LastEd: 0, Text: unterminierte Hexzeichenkette.}
+- {Annot: '', ID: 14, LastEd: 0, Text: unterminierter Blockkommentar (/* */).}
+- {Annot: '', ID: 15, LastEd: 0, Text: unterminierter verschachtelter Kommentar (/+
+    +/).}
+- {Annot: '', ID: 16, LastEd: 0, Text: unterminierte rohe Zeichenkette.}
+- {Annot: '', ID: 17, LastEd: 0, Text: unterminierte Backquote-Zeichenkette.}
+- {Annot: '', ID: 18, LastEd: 0, Text: 'undefinierte Escapesequenz ''{0}'' gefunden.'}
+- {Annot: '', ID: 19, LastEd: 0, Text: 'ungültige Unicode-Escapesequenz ''{0}'' gefunden.'}
+- {Annot: '', ID: 20, LastEd: 0, Text: unzureichende Anzahl von Hexziffern in Escapesequenz.}
+- {Annot: '', ID: 21, LastEd: 0, Text: 'undefinierte HTML-Entität ''{0}'''}
+- {Annot: '', ID: 22, LastEd: 0, Text: 'unterminierte HTML-Entität ''{0}''.'}
+- {Annot: '', ID: 23, LastEd: 0, Text: HTML-Entitäten müssen mit einem Buchstaben
+    beginnen.}
+- {Annot: '', ID: 24, LastEd: 0, Text: Dezimalzahl überläuft im Vorzeichenbit.}
+- {Annot: '', ID: 25, LastEd: 0, Text: Überlauf in Dezimalzahl.}
+- {Annot: '', ID: 26, LastEd: 0, Text: Überlauf in Hexadezimalzahl.}
+- {Annot: '', ID: 27, LastEd: 0, Text: Überlauf in Binärzahl.}
+- {Annot: '', ID: 28, LastEd: 0, Text: Überlauf in Oktalzahl.}
+- {Annot: '', ID: 29, LastEd: 0, Text: Überlauf in Fließkommazahl.}
+- {Annot: '', ID: 30, LastEd: 0, Text: die Ziffern 8 und 9 sind in Oktalzahlen unzulässig.}
+- {Annot: '', ID: 31, LastEd: 0, Text: ungültige Hexzahl; mindestens eine Hexziffer
+    erforderlich.}
+- {Annot: '', ID: 32, LastEd: 0, Text: ungültige Binärzahl; mindestens eine Binärziffer
+    erforderlich.}
+- {Annot: '', ID: 33, LastEd: 0, Text: der Exponent einer hexadezimalen Fließkommazahl
+    ist erforderlich.}
+- {Annot: '', ID: 34, LastEd: 0, Text: Hexadezimal-Exponenten müssen mit einer Dezimalziffer
+    anfangen.}
+- {Annot: '', ID: 35, LastEd: 0, Text: Exponenten müssen mit einer Dezimalziffer anfangen.}
+- {Annot: '', ID: 36, LastEd: 0, Text: 'erwartete ''{0}'', fand aber ''{1}''.'}
+- {Annot: '', ID: 37, LastEd: 0, Text: '''{0}'' ist redundant.'}
+- {Annot: '', ID: 38, LastEd: 0, Text: Template-Tupel-Parameter dürfen nur am Ende
+    auftreten.}
+- {Annot: '', ID: 39, LastEd: 0, Text: der 'in'-Vertrag der Funktion wurde bereits
+    geparsed.}
+- {Annot: '', ID: 40, LastEd: 0, Text: der 'out'-Vertrag der Funktion wurde bereits
+    geparsed.}
+- {Annot: '', ID: 41, LastEd: 0, Text: es wurde kein Verbindungstyp angegeben.}
+- {Annot: '', ID: 42, LastEd: 0, Text: 'unbekannter Verbindungstyp ''{0}''; gültig
+    sind C, C++, D, Windows, Pascal und System.'}
+- {Annot: '', ID: 43, LastEd: 0, Text: 'erwartete eine oder mehrere Basisklassen,
+    nicht ''{0}''.'}
+- {Annot: '', ID: 44, LastEd: 0, Text: Basisklassen sind in Vorwärtsdeklarationen
+    nicht erlaubt.}
+- {Annot: '', ID: 45, LastEd: 0, Text: 'dil v{0}
+
+    Copyright (c) 2007, Aziz Köksal. Lizensiert unter der GPL3.
+
+
+    Befehle:
+
+    {1}
+
+    Geben Sie ''dil help <Befehl>'' ein, um mehr Hilfe zu einem bestimmten Befehl
+    zu
+
+    erhalten.
+
+
+    Kompiliert mit {2} v{3} am {4}.'}
+- {Annot: '', ID: 46, LastEd: 0, Text: "Generiere ein XML- oder HTML-Dokument aus\
+    \ einer D-Quelltextdatei.\nVerwendung:\n  dil gen datei.d [Optionen]\n\nOptionen:\n\
+    \  --syntax         : generiere Elemente für den Syntaxbaum\n  --xml         \
+    \   : verwende XML-Format (voreingestellt)\n  --html           : verwende HTML-Format\n\
+    \nBeispiel:\n  dil gen Parser.d --html --syntax > Parser.html"}
+- {Annot: '', ID: 47, LastEd: 0, Text: ''}

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/i18n/dil.tproj	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,54 @@
+BuildScript: build.py
+CreationDate: '2007-10-12 09:41:17.868084'
+LangFiles: [de.cat, tr.cat, fi.cat]
+MsgIDs:
+- {ID: 0, Name: IllegalCharacter, Order: 0}
+- {ID: 1, Name: InvalidUnicodeCharacter, Order: 1}
+- {ID: 2, Name: InvalidUTF8Sequence, Order: 2}
+- {ID: 3, Name: UnterminatedCharacterLiteral, Order: 3}
+- {ID: 4, Name: EmptyCharacterLiteral, Order: 4}
+- {ID: 5, Name: ExpectedIdentifierSTLine, Order: 5}
+- {ID: 6, Name: ExpectedIntegerAfterSTLine, Order: 6}
+- {ID: 7, Name: ExpectedFilespec, Order: 7}
+- {ID: 8, Name: UnterminatedFilespec, Order: 8}
+- {ID: 9, Name: UnterminatedSpecialToken, Order: 9}
+- {ID: 10, Name: UnterminatedString, Order: 10}
+- {ID: 11, Name: NonHexCharInHexString, Order: 11}
+- {ID: 12, Name: OddNumberOfDigitsInHexString, Order: 12}
+- {ID: 13, Name: UnterminatedHexString, Order: 13}
+- {ID: 14, Name: UnterminatedBlockComment, Order: 14}
+- {ID: 15, Name: UnterminatedNestedComment, Order: 15}
+- {ID: 16, Name: UnterminatedRawString, Order: 16}
+- {ID: 17, Name: UnterminatedBackQuoteString, Order: 17}
+- {ID: 18, Name: UndefinedEscapeSequence, Order: 18}
+- {ID: 19, Name: InvalidUnicodeEscapeSequence, Order: 19}
+- {ID: 20, Name: InsufficientHexDigits, Order: 20}
+- {ID: 21, Name: UndefinedHTMLEntity, Order: 21}
+- {ID: 22, Name: UnterminatedHTMLEntity, Order: 22}
+- {ID: 23, Name: InvalidBeginHTMLEntity, Order: 23}
+- {ID: 24, Name: OverflowDecimalSign, Order: 24}
+- {ID: 25, Name: OverflowDecimalNumber, Order: 25}
+- {ID: 26, Name: OverflowHexNumber, Order: 26}
+- {ID: 27, Name: OverflowBinaryNumber, Order: 27}
+- {ID: 28, Name: OverflowOctalNumber, Order: 28}
+- {ID: 29, Name: OverflowFloatNumber, Order: 29}
+- {ID: 30, Name: OctalNumberHasDecimals, Order: 30}
+- {ID: 31, Name: NoDigitsInHexNumber, Order: 31}
+- {ID: 32, Name: NoDigitsInBinNumber, Order: 32}
+- {ID: 33, Name: HexFloatExponentRequired, Order: 33}
+- {ID: 34, Name: HexFloatExpMustStartWithDigit, Order: 34}
+- {ID: 35, Name: FloatExpMustStartWithDigit, Order: 35}
+- {ID: 36, Name: ExpectedButFound, Order: 36}
+- {ID: 37, Name: RedundantStorageClass, Order: 37}
+- {ID: 38, Name: TemplateTupleParameter, Order: 38}
+- {ID: 39, Name: InContract, Order: 39}
+- {ID: 40, Name: OutContract, Order: 40}
+- {ID: 41, Name: MissingLinkageType, Order: 41}
+- {ID: 42, Name: UnrecognizedLinkageType, Order: 42}
+- {ID: 43, Name: ExpectedBaseClasses, Order: 43}
+- {ID: 44, Name: BaseClassInForwardDeclaration, Order: 44}
+- {ID: 45, Name: HelpMain, Order: 45}
+- {ID: 46, Name: HelpGenerate, Order: 46}
+- {ID: 47, Name: HelpImportGraph, Order: 47}
+Name: dil
+SourceLangFile: en.cat

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/i18n/en.cat	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,90 @@
+Authors:
+- {EMail: aziz.koeksal@gmail.com, Name: Aziz Köksal}
+LangCode: en
+License: GPL3
+Messages:
+- {Annot: '', ID: 0, LastEd: 0, Text: 'illegal character found: ''{0}'''}
+- {Annot: '', ID: 1, LastEd: 0, Text: invalid Unicode character.}
+- {Annot: '', ID: 2, LastEd: 0, Text: invalid UTF-8 sequence.}
+- {Annot: '', ID: 3, LastEd: 0, Text: unterminated character literal.}
+- {Annot: '', ID: 4, LastEd: 0, Text: empty character literal.}
+- {Annot: '', ID: 5, LastEd: 0, Text: expected 'line' after '#'.}
+- {Annot: '', ID: 6, LastEd: 0, Text: 'integer expected after #line'}
+- {Annot: '', ID: 7, LastEd: 0, Text: expected filespec string (e.g. "path\to\file".)}
+- {Annot: '', ID: 8, LastEd: 0, Text: unterminated filespec string.}
+- {Annot: '', ID: 9, LastEd: 0, Text: expected a terminating newline after special
+    token.}
+- {Annot: '', ID: 10, LastEd: 0, Text: unterminated string literal.}
+- {Annot: '', ID: 11, LastEd: 0, Text: 'non-hex character ''{0}'' found in hex string.'}
+- {Annot: '', ID: 12, LastEd: 0, Text: odd number of hex digits in hex string.}
+- {Annot: '', ID: 13, LastEd: 0, Text: unterminated hex string.}
+- {Annot: '', ID: 14, LastEd: 0, Text: unterminated block comment (/* */).}
+- {Annot: '', ID: 15, LastEd: 0, Text: unterminated nested comment (/+ +/).}
+- {Annot: '', ID: 16, LastEd: 0, Text: unterminated raw string.}
+- {Annot: '', ID: 17, LastEd: 0, Text: unterminated back quote string.}
+- {Annot: '', ID: 18, LastEd: 0, Text: 'found undefined escape sequence ''{0}''.'}
+- {Annot: '', ID: 19, LastEd: 0, Text: 'found invalid Unicode escape sequence ''{0}''.'}
+- {Annot: '', ID: 20, LastEd: 0, Text: insufficient number of hex digits in escape
+    sequence.}
+- {Annot: '', ID: 21, LastEd: 0, Text: 'undefined HTML entity ''{0}'''}
+- {Annot: '', ID: 22, LastEd: 0, Text: 'unterminated HTML entity ''{0}''.'}
+- {Annot: '', ID: 23, LastEd: 0, Text: HTML entities must begin with a letter.}
+- {Annot: '', ID: 24, LastEd: 0, Text: decimal number overflows sign bit.}
+- {Annot: '', ID: 25, LastEd: 0, Text: overflow in decimal number.}
+- {Annot: '', ID: 26, LastEd: 0, Text: overflow in hexadecimal number.}
+- {Annot: '', ID: 27, LastEd: 0, Text: overflow in binary number.}
+- {Annot: '', ID: 28, LastEd: 0, Text: overflow in octal number.}
+- {Annot: '', ID: 29, LastEd: 0, Text: overflow in float number.}
+- {Annot: '', ID: 30, LastEd: 0, Text: digits 8 and 9 are not allowed in octal numbers.}
+- {Annot: '', ID: 31, LastEd: 0, Text: invalid hex number; at least one hex digit
+    expected.}
+- {Annot: '', ID: 32, LastEd: 0, Text: invalid binary number; at least one binary
+    digit expected.}
+- {Annot: '', ID: 33, LastEd: 0, Text: the exponent of a hexadecimal float number
+    is required.}
+- {Annot: '', ID: 34, LastEd: 0, Text: hexadecimal float exponents must start with
+    a digit.}
+- {Annot: '', ID: 35, LastEd: 0, Text: exponents must start with a digit.}
+- {Annot: '', ID: 36, LastEd: 0, Text: 'expected ''{0}'', but found ''{1}''.'}
+- {Annot: '', ID: 37, LastEd: 0, Text: '''{0}'' is redundant.'}
+- {Annot: '', ID: 38, LastEd: 0, Text: template tuple parameters can only be last.}
+- {Annot: '', ID: 39, LastEd: 0, Text: the functions 'in' contract was already parsed.}
+- {Annot: '', ID: 40, LastEd: 0, Text: the functions 'out' contract was already parsed.}
+- {Annot: '', ID: 41, LastEd: 0, Text: no linkage type was specified.}
+- {Annot: '', ID: 42, LastEd: 0, Text: 'unrecognized linkage type ''{0}''; valid types
+    are C, C++, D, Windows, Pascal und System.'}
+- {Annot: '', ID: 43, LastEd: 0, Text: 'expected one or more base classes, not ''{0}''.'}
+- {Annot: '', ID: 44, LastEd: 0, Text: base classes are not allowed in forward declarations.}
+- {Annot: '', ID: 45, LastEd: 0, Text: 'dil v{0}
+
+    Copyright (c) 2007 by Aziz Köksal. Licensed under the GPL3.
+
+
+    Subcommands:
+
+    {1}
+
+    Type ''dil help <subcommand>'' for more help on a particular subcommand.
+
+
+    Compiled with {2} v{3} on {4}.'}
+- {Annot: '', ID: 46, LastEd: 0, Text: "Generate an XML or HTML document from a D\
+    \ source file.\nUsage:\n  dil gen file.d [Options]\n\nOptions:\n  --syntax   \
+    \      : generate tags for the syntax tree\n  --xml            : use XML format\
+    \ (default)\n  --html           : use HTML format\n\nExample:\n  dil gen Parser.d\
+    \ --html --syntax > Parser.html"}
+- {Annot: '', ID: 47, LastEd: 0, Text: "Parse a module and extract information from\
+    \ the resulting module dependency graph.\nUsage:\n  dil igraph file.d Format [Options]\n\
+    \n  The directory of file.d is implicitly added to the list of import paths.\n\
+    \nFormat:\n  --dot            : generate a dot document\n  Further options for\
+    \ --dot:\n  -gbp             : Group modules by package names\n  -gbf        \
+    \     : Group modules by full package name\n  -hle             : highlight cyclic\
+    \ edges in the graph\n  -hlv             : highlight modules in cyclic relationship\n\
+    \n  --paths          : print a list of paths to the modules imported by file.d\n\
+    \  --list           : print a list of the module names imported by file.d\n  Options\
+    \ common to --paths and --list:\n  -lN              : print N levels.\n  -m  \
+    \             : mark modules in cyclic relationships with a star.\n\nOptions:\n\
+    \  -Ipath           : add 'path' to the list of import paths where modules are\n\
+    \                     looked for\n  -rREGEXP         : exclude modules whose names\
+    \ match the regular expression\n                     REGEXP\n  -i            \
+    \   : include unlocatable modules\n\nExample:\n  dil igraph src/main.d"}

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/i18n/fi.cat	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,76 @@
+Authors:
+- {EMail: jmjm@iki.fi, Name: Jari-Matti Mäkelä}
+LangCode: fi
+License: GPL3
+Messages:
+- {Annot: '', ID: 0, LastEd: 0, Text: ''}
+- {Annot: '', ID: 1, LastEd: 0, Text: virheellinen Unicode-merkki.}
+- {Annot: '', ID: 2, LastEd: 0, Text: virheellinen UTF-8-merkkijono.}
+- {Annot: '', ID: 3, LastEd: 0, Text: päättämätön merkkiliteraali.}
+- {Annot: '', ID: 4, LastEd: 0, Text: tyhjä merkkiliteraali.}
+- {Annot: '', ID: 5, LastEd: 0, Text: 'odotettiin rivinumeroa ''#'':n jälkeen.'}
+- {Annot: '', ID: 6, LastEd: 0, Text: 'odotettiin kokonaislukua #line:n jälkeen'}
+- {Annot: '', ID: 7, LastEd: 0, Text: odotettiin tiedostomäärittelyn merkkijonoa (esim.
+    "polku\tiedostoon")}
+- {Annot: '', ID: 8, LastEd: 0, Text: päättämätön tiedostomäärittely.}
+- {Annot: '', ID: 9, LastEd: 0, Text: odotettiin päättävää rivinvaihtoa erikoismerkin
+    jälkeen.}
+- {Annot: '', ID: 10, LastEd: 0, Text: päättämätön merkkijonoliteraali.}
+- {Annot: '', ID: 11, LastEd: 0, Text: 'ei-heksamerkki ''{0}'' löytyi heksajonossa.'}
+- {Annot: '', ID: 12, LastEd: 0, Text: pariton määrä heksanumeroita heksajonossa.}
+- {Annot: '', ID: 13, LastEd: 0, Text: päättämätön heksajono.}
+- {Annot: '', ID: 14, LastEd: 0, Text: päättämätön lohkokommentti (/* */).}
+- {Annot: '', ID: 15, LastEd: 0, Text: päättämätön sisäkkäinen kommentti (/+ +/).}
+- {Annot: '', ID: 16, LastEd: 0, Text: päättämätön raakamerkkijono.}
+- {Annot: '', ID: 17, LastEd: 0, Text: päättämätön gravisaksenttimerkkijono.}
+- {Annot: '', ID: 18, LastEd: 0, Text: löydettiin määrittelemätön escape-sekvenssi.}
+- {Annot: '', ID: 19, LastEd: 0, Text: 'found invalid Unicode escape sequence ''{0}''.'}
+- {Annot: '', ID: 20, LastEd: 0, Text: riittämätön määrä heksanumeroita escape-sekvenssissä.}
+- {Annot: '', ID: 21, LastEd: 0, Text: 'määrittelemätön HTML-entiteetti ''{0}'''}
+- {Annot: '', ID: 22, LastEd: 0, Text: päättämätön HTML-entiteetti.}
+- {Annot: '', ID: 23, LastEd: 0, Text: HTML-entiteettien tulee alkaa kirjaimella.}
+- {Annot: '', ID: 24, LastEd: 0, Text: desimaaliluku ylivuotaa etumerkin.}
+- {Annot: '', ID: 25, LastEd: 0, Text: desimaaliluvun ylivuoto.}
+- {Annot: '', ID: 26, LastEd: 0, Text: heksadesimaaliluvun ylivuoto.}
+- {Annot: '', ID: 27, LastEd: 0, Text: binääriluvun ylivuoto.}
+- {Annot: '', ID: 28, LastEd: 0, Text: oktaaliluvun ylivuoto.}
+- {Annot: '', ID: 29, LastEd: 0, Text: liukuluvun ylivuoto.}
+- {Annot: '', ID: 30, LastEd: 0, Text: numerot 8 ja 9 eivät ole sallittuja oktaaliluvuissa.}
+- {Annot: '', ID: 31, LastEd: 0, Text: virheellinen heksaluku; odotettiin vähintään
+    yhtä heksanumeroa.}
+- {Annot: '', ID: 32, LastEd: 0, Text: virheellinen binääriluku; odotettiin vähintään
+    yhtä binäärinumeroa.}
+- {Annot: '', ID: 33, LastEd: 0, Text: heksadesimaalisen liukuluvun eksponentti vaaditaan.}
+- {Annot: '', ID: 34, LastEd: 0, Text: heksadesimaalisen liukuluvun eksponentista
+    puuttui numeroita.}
+- {Annot: '', ID: 35, LastEd: 0, Text: eksponenttien tulee alkaa numerolla.}
+- {Annot: '', ID: 36, LastEd: 0, Text: 'odotettiin ''{0}'':a, mutta löydettiin ''{1}''.'}
+- {Annot: '', ID: 37, LastEd: 0, Text: '''{0}'' on redundantti.'}
+- {Annot: '', ID: 38, LastEd: 0, Text: tupla voi esiintyä ainoastaan mallin viimeisenä
+    parametrina.}
+- {Annot: '', ID: 39, LastEd: 0, Text: funktion alkuehto jäsennettiin jo.}
+- {Annot: '', ID: 40, LastEd: 0, Text: funktion loppuehto jäsennettiin jo.}
+- {Annot: '', ID: 41, LastEd: 0, Text: linkitystyyppiä ei määritelty.}
+- {Annot: '', ID: 42, LastEd: 0, Text: 'tunnistamaton linkitystyyppi ''{0}''; sallittuja
+    tyyppejä ovat C, C++, D, Windows, Pascal ja System.'}
+- {Annot: '', ID: 43, LastEd: 0, Text: 'expected one or more base classes, not ''{0}''.'}
+- {Annot: '', ID: 44, LastEd: 0, Text: base classes are not allowed in forward declarations.}
+- {Annot: '', ID: 45, LastEd: 0, Text: 'dil v{0}
+
+    Copyright (c) 2007, Aziz Köksal. GPL3-lisensöity.
+
+
+    Alikomennot:
+
+    {1}
+
+    Lisäohjeita tietystä alitoiminnosta saa kirjoittamalla ''dil help <toiminto>''.
+
+
+    Käännetty {2}:n versiolla {3} {4}.'}
+- {Annot: '', ID: 46, LastEd: 0, Text: "Luo XML- tai HTML-dokumentti D-lähdekoodista.\n\
+    Käyttö:\n  dil gen tiedosto.d [Valinnat]\n\nValinnat:\n  --syntax         : luo\
+    \ elementtejä syntaksipuun mukaisesti\n  --xml            : käytä XML-muotoa (oletus)\n\
+    \  --html           : käytä HTML-muotoa\n\nEsimerkki:\n  dil gen Parser.d --html\
+    \ --syntax > Parser.html"}
+- {Annot: '', ID: 47, LastEd: 0, Text: ''}

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/i18n/tr.cat	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,73 @@
+Authors:
+- {EMail: aziz.koeksal@gmail.com, Name: Aziz Köksal}
+LangCode: tr
+License: GPL3
+Messages:
+- {Annot: '', ID: 0, LastEd: 0, Text: 'illegal karakter bulundu: ''{0}'''}
+- {Annot: '', ID: 1, LastEd: 0, Text: geçersiz Unikod karakteri.}
+- {Annot: '', ID: 2, LastEd: 0, Text: geçersiz UTF-8 serisi.}
+- {Annot: '', ID: 3, LastEd: 0, Text: kapanmamış karakter sabiti.}
+- {Annot: '', ID: 4, LastEd: 0, Text: boş karakter sabiti.}
+- {Annot: '', ID: 5, LastEd: 0, Text: '''#'' karakter''den sonra ''line'' beklendi.'}
+- {Annot: '', ID: 6, LastEd: 0, Text: '''#line''''den sonra rakam beklendi.'}
+- {Annot: '', ID: 7, LastEd: 0, Text: filespec dizgisi beklendi (e.g. "yol\dosya".)}
+- {Annot: '', ID: 8, LastEd: 0, Text: kapanmamış filespec dizgisi.}
+- {Annot: '', ID: 9, LastEd: 0, Text: özel belirtici'den (special token) sonra yeni
+    bir satır beklendi.}
+- {Annot: '', ID: 10, LastEd: 0, Text: kapanmamış çift tırnak dizgisi.}
+- {Annot: '', ID: 11, LastEd: 0, Text: 'heks sayı olmayan karakter ''{0}'' heks dizgisi
+    içinde bulundu.'}
+- {Annot: '', ID: 12, LastEd: 0, Text: heks dizginin içindeki sayılar çifter çifter
+    olmalıdır.}
+- {Annot: '', ID: 13, LastEd: 0, Text: kapanmamış heks dizgisi.}
+- {Annot: '', ID: 14, LastEd: 0, Text: kapanmamış blok açıklaması (/* */).}
+- {Annot: '', ID: 15, LastEd: 0, Text: kapanmamış iç içe koyulabilen açıklaması (/+
+    +/).}
+- {Annot: '', ID: 16, LastEd: 0, Text: kapanmamış çiğ dizgisi.}
+- {Annot: '', ID: 17, LastEd: 0, Text: kapanmamış ters tırnak dizgisi.}
+- {Annot: '', ID: 18, LastEd: 0, Text: 'tanımlanmamış çıkış serisi ''{0}'' bulundu.'}
+- {Annot: '', ID: 19, LastEd: 0, Text: 'geçersiz Unikod çıkış serisi ''{0}'' bulundu.'}
+- {Annot: '', ID: 20, LastEd: 0, Text: heksadesimal çıkış serisi sayıları yeterli
+    değil.}
+- {Annot: '', ID: 21, LastEd: 0, Text: 'tanımlanmamış HTML varlık ''{0}'''}
+- {Annot: '', ID: 22, LastEd: 0, Text: 'kapanmamış HTML varlık ''{0}''.'}
+- {Annot: '', ID: 23, LastEd: 0, Text: HTML varlık bir harf ile başlamalı.}
+- {Annot: '', ID: 24, LastEd: 0, Text: desimal rakamın bit işareti taşdı.}
+- {Annot: '', ID: 25, LastEd: 0, Text: desimal rakam taşması.}
+- {Annot: '', ID: 26, LastEd: 0, Text: heksadesimal rakam taşması.}
+- {Annot: '', ID: 27, LastEd: 0, Text: binari rakam taşması.}
+- {Annot: '', ID: 28, LastEd: 0, Text: oktal rakam taşması.}
+- {Annot: '', ID: 29, LastEd: 0, Text: float rakam taşması.}
+- {Annot: '', ID: 30, LastEd: 0, Text: 8 ve 9 sayılar oktal rakamlar'da geçersizdir.}
+- {Annot: '', ID: 31, LastEd: 0, Text: geçersiz heks rakam; minimum bir heks sayı
+    gereklidir.}
+- {Annot: '', ID: 32, LastEd: 0, Text: geçersiz binari rakam; minimum bir binari sayı
+    gereklidir.}
+- {Annot: '', ID: 33, LastEd: 0, Text: bir heksadesimal float rakamın üsü gereklidir.}
+- {Annot: '', ID: 34, LastEd: 0, Text: heksadesimal float üsler desimal sayı ile başlamalı.}
+- {Annot: '', ID: 35, LastEd: 0, Text: üsler desimal sayı ile başlamalı.}
+- {Annot: '', ID: 36, LastEd: 0, Text: '''{0}'' beklendi, ama ''{1}'' bulundu.'}
+- {Annot: '', ID: 37, LastEd: 0, Text: '''{0}'' lüzumsuz.'}
+- {Annot: '', ID: 38, LastEd: 0, Text: şablon tuple parametre son sırada olmalı.}
+- {Annot: '', ID: 39, LastEd: 0, Text: fonksiyonun 'in' kontratı daha önceden ayrıştırılmış.}
+- {Annot: '', ID: 40, LastEd: 0, Text: fonksiyonun 'out' kontratı daha önceden ayrıştırılmış.}
+- {Annot: '', ID: 41, LastEd: 0, Text: bağlantı tüp (linkage type) belirtilmedi.}
+- {Annot: '', ID: 42, LastEd: 0, Text: 'bilinmeyen bağlantı tüpü (linkage type) ''{0}'';
+    geçerli olanlar C, C++, D, Windows, Pascal ve System.'}
+- {Annot: '', ID: 43, LastEd: 0, Text: ''}
+- {Annot: '', ID: 44, LastEd: 0, Text: ''}
+- {Annot: '', ID: 45, LastEd: 0, Text: 'dil v{0}
+
+    Copyright (c) 2007, Aziz Köksal. Lisans GPL3.
+
+
+    Komutlar: {1} Belirli komut''a yardım edinmek için ''dil help <komut>'' yazınız.
+
+
+    Bu yazılım {2} v{3} ile {4} tarihinde derletilmiş.'}
+- {Annot: '', ID: 46, LastEd: 0, Text: "Bir D kaynak kodundan XML veya HTML dosyası\
+    \ oluştur.\nKullanım:\n  dil gen dosya.d [Seçenekler]\n\nSeçenekler:\n  --syntax\
+    \         : söz dizimi için etiketler yazdır\n  --xml            : XML biçimi\
+    \ kullan (varsayılır)\n  --html           : HTML biçimi kullan\n\nÖrnek:\n  dil\
+    \ gen Parser.d --html --syntax > Parser.html"}
+- {Annot: '', ID: 47, LastEd: 0, Text: ''}

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/release.py	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,8 @@
+# -*- coding: utf-8 -*-
+# Author: Aziz Köksal
+
+# TODO: port release.sh to Python
+
+# TODO: write subcommand that creates a Makefile
+def writeMakefile():
+  pass

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/release.sh	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,96 @@
+#!/bin/bash
+
+if [[ $1 != [0-9].[0-9][0-9][0-9] ]]; then
+  echo Wrong version format. Expected: d.ddd
+  exit;
+fi
+
+BUILD="./build"
+DIR="dil.$1"
+DEST="$BUILD/$DIR"
+FRESH_REPOS="$BUILD/fresh_repos"
+
+# Create build directory if it doesn't exist.
+[ ! -e $BUILD ] && mkdir $BUILD
+
+# Convert Unix newlines to Windows newlines
+# function unix2win
+# {
+#   sed {s/$/\\r/} $*
+# }
+
+# We need dil to get a list of all modules to be compiled.
+if [ ! -s ./dil ]; then
+  dsss build -full &> /dev/null
+fi
+
+if [ ! -s ./dil ]; then
+  echo "Couldn't build DIL. Can't get list of modules to be built."
+  exit;
+fi
+
+# Used by doc generation and winbuild function.
+SRC_FILES=`./dil igraph src/main.d --paths`
+
+# Recreate destination directory.
+rm -rf $DEST
+mkdir -p $DEST/{bin,doc/htmlsrc,src}
+
+# Create documentation.
+./dil ddoc $DEST/doc/ -v src/macros_dil.ddoc -version=DDoc src/config.d $SRC_FILES
+# Generate syntax highlighted HTML files.
+HTMLSRC="$DEST/doc/htmlsrc"
+for filepath in $SRC_FILES;
+do
+  htmlfile=`echo $filepath | sed -e 's@^src/@@' -e 's@/@.@g' -e 's@.d$@@'`.html
+  echo "FILE: $filepath > $HTMLSRC/$htmlfile";
+  ./dil gen --lines --syntax --html $filepath > "$HTMLSRC/$htmlfile";
+done
+
+# Linux Debug
+echo "***** Building Linux binaries *****"
+dsss build -clean -full -version=D2
+cp dil $DEST/bin/dil2_d
+dsss build -clean -full
+cp dil $DEST/bin/dil_d
+# Linux Release
+dsss build -clean -full -release -O -inline -version=D2
+cp dil $DEST/bin/dil2
+dsss build -clean -full -release -O -inline
+cp dil $DEST/bin/dil
+
+if [ -s ~/bin/dmd.exe ]; then
+  echo "***** Building Windows binaries *****"
+  function winbuild
+  { # obj dir is winobj. -op = don't strip paths from obj files.
+    wine ~/bin/dmd.exe -odwinobj -op -ofdil $* $SRC_FILES
+  }
+  # Windows Debug
+  winbuild -version=D2
+  cp dil.exe $DEST/bin/dil2_d.exe
+  winbuild
+  cp dil.exe $DEST/bin/dil_d.exe
+  # Windows Release
+  winbuild -release -O -inline -version=D2
+  cp dil.exe $DEST/bin/dil2.exe
+  winbuild -release -O -inline
+  cp dil.exe $DEST/bin/dil.exe
+fi
+
+# Copy source and other files.
+rm -rf $FRESH_REPOS
+hg archive -r tip -t files $FRESH_REPOS
+cp -r $FRESH_REPOS/trunk/* $DEST
+
+cp $FRESH_REPOS/trunk/src/config.d $DEST/bin/
+cp $FRESH_REPOS/trunk/src/lang_*.d $DEST/bin/
+cp $FRESH_REPOS/trunk/src/*_map.d $DEST/bin/
+cp $FRESH_REPOS/trunk/src/*.css $DEST/bin/
+cp $FRESH_REPOS/trunk/src/predefined.ddoc $DEST/bin/
+cp $FRESH_REPOS/trunk/src/html.css $HTMLSRC
+
+# Build archives
+# tar.gz doesn't compress well
+tar --owner root --group root -czf $DEST.tar.gz $DEST
+tar --owner root --group root --bzip2 -cf $DEST.tar.bz2 $DEST
+zip -q -9 -r $DEST.zip $DEST

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/src/Settings.d	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,29 @@
+/++
+  Author: Aziz Köksal
+  License: GPL3
++/
+module Settings;
+import common;
+
+/// Global application settings.
+struct GlobalSettings
+{
+static:
+  /// Predefined version identifiers.
+  string[] versionIds;
+  /// Path to the language file.
+  string langFile = "lang_en.d";
+  /// Language code of loaded messages catalogue.
+  string langCode = "en";
+  /// Table of localized compiler messages.
+  string[] messages;
+  /// Array of import paths to look for modules.
+  string[] importPaths;
+  /// Array of DDoc macro file paths.
+  string[] ddocFilePaths;
+  string xmlMapFile = "xml_map.d"; /// XML map file.
+  string htmlMapFile = "html_map.d"; /// HTML map file.
+  string lexerErrorFormat = "{0}({1},{2})L: {3}"; /// Lexer error.
+  string parserErrorFormat = "{0}({1},{2})P: {3}"; /// Parser error.
+  string semanticErrorFormat = "{0}({1},{2})S: {3}"; /// Semantic error.
+}

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/src/SettingsLoader.d	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,252 @@
+/++
+  Author: Aziz Köksal
+  License: GPL3
++/
+module SettingsLoader;
+
+import Settings;
+import dil.Messages;
+import dil.ast.Node, dil.ast.Declarations, dil.ast.Expressions;
+import dil.semantic.Module;
+import dil.semantic.Pass1;
+import dil.semantic.Symbol;
+import dil.semantic.Symbols;
+import dil.Information;
+import dil.Compilation;
+import common;
+
+import tango.io.FilePath;
+
+/// Loads settings from a D module file.
+class SettingsLoader
+{
+  InfoManager infoMan; /// Collects error messages.
+  Module mod; /// Current module.
+
+  this(InfoManager infoMan)
+  {
+    this.infoMan = infoMan;
+  }
+
+  static SettingsLoader opCall(InfoManager infoMan)
+  {
+    return new SettingsLoader(infoMan);
+  }
+
+  /// Creates an error report.
+  /// Params:
+  ///   token = where the error occurred.
+  ///   formatMsg = error message.
+  void error(Token* token, char[] formatMsg, ...)
+  {
+    auto location = token.getErrorLocation();
+    auto msg = Format(_arguments, _argptr, formatMsg);
+    infoMan ~= new SemanticError(location, msg);
+  }
+
+  T getValue(T)(char[] name)
+  {
+    auto var = mod.lookup(name);
+    if (!var) // Returning T.init instead of null, because dmd gives an error.
+      return error(mod.firstToken, "variable '{}' is not defined", name), T.init;
+    auto t = var.node.begin;
+    if (!var.isVariable)
+      return error(t, "'{}' is not a variable declaration", name), T.init;
+    auto value = var.to!(Variable).value;
+    if (!value)
+      return error(t, "'{}' variable has no value set", name), T.init;
+    T val = value.Is!(T); // Try casting to T.
+    if (!val)
+      error(value.begin, "the value of '{}' is not of type {}", name, typeof(T).stringof);
+    return val;
+  }
+
+  T castTo(T)(Node n)
+  {
+    char[] type;
+    is(T == StringExpression) && (type = "char[]");
+    if (!n.Is!(T))
+      error(n.begin, "expression is not of type {}", type);
+    return n.Is!(T);
+  }
+
+  void load()
+  {
+    scope execPath = new FilePath(GetExecutableFilePath());
+    execPath = new FilePath(execPath.folder());
+
+    // Load config.d
+    auto filePath = resolvePath(execPath, "config.d");
+    mod = new Module(filePath, infoMan);
+    mod.parse();
+
+    if (mod.hasErrors)
+      return;
+
+    auto context = new CompilationContext;
+    auto pass1 = new SemanticPass1(mod, context);
+    pass1.start();
+
+    if (auto array = getValue!(ArrayInitExpression)("version_ids"))
+      foreach (value; array.values)
+        if (auto str = castTo!(StringExpression)(value))
+          GlobalSettings.versionIds ~= str.getString();
+    if (auto val = getValue!(StringExpression)("langfile"))
+      GlobalSettings.langFile = val.getString();
+    if (auto array = getValue!(ArrayInitExpression)("import_paths"))
+      foreach (value; array.values)
+        if (auto str = castTo!(StringExpression)(value))
+          GlobalSettings.importPaths ~= str.getString();
+    if (auto array = getValue!(ArrayInitExpression)("ddoc_files"))
+      foreach (value; array.values)
+        if (auto str = castTo!(StringExpression)(value))
+          GlobalSettings.ddocFilePaths ~= resolvePath(execPath, str.getString());
+    if (auto val = getValue!(StringExpression)("xml_map"))
+      GlobalSettings.xmlMapFile = val.getString();
+    if (auto val = getValue!(StringExpression)("html_map"))
+      GlobalSettings.htmlMapFile = val.getString();
+    if (auto val = getValue!(StringExpression)("lexer_error"))
+      GlobalSettings.lexerErrorFormat = val.getString();
+    if (auto val = getValue!(StringExpression)("parser_error"))
+      GlobalSettings.parserErrorFormat = val.getString();
+    if (auto val = getValue!(StringExpression)("semantic_error"))
+      GlobalSettings.semanticErrorFormat = val.getString();
+
+    // Load language file.
+    filePath = resolvePath(execPath, GlobalSettings.langFile);
+    mod = new Module(filePath);
+    mod.parse();
+
+    if (mod.hasErrors)
+      return;
+
+    pass1 = new SemanticPass1(mod, context);
+    pass1.start();
+
+    if (auto array = getValue!(ArrayInitExpression)("messages"))
+    {
+      char[][] messages;
+      foreach (value; array.values)
+        if (auto str = castTo!(StringExpression)(value))
+          messages ~= str.getString();
+      if (messages.length != MID.max+1)
+        error(mod.firstToken,
+              "messages table in {} must exactly have {} entries, but not {}.",
+              filePath, MID.max+1, messages.length);
+      GlobalSettings.messages = messages;
+      dil.Messages.SetMessages(messages);
+    }
+    if (auto val = getValue!(StringExpression)("lang_code"))
+      GlobalSettings.langCode = val.getString();
+  }
+}
+
+/// Loads an associative array from a D module file.
+class TagMapLoader : SettingsLoader
+{
+  this(InfoManager infoMan)
+  {
+    super(infoMan);
+  }
+
+  static TagMapLoader opCall(InfoManager infoMan)
+  {
+    return new TagMapLoader(infoMan);
+  }
+
+  string[string] load(string filePath)
+  {
+    mod = new Module(filePath, infoMan);
+    mod.parse();
+    if (mod.hasErrors)
+      return null;
+
+    auto context = new CompilationContext;
+    auto pass1 = new SemanticPass1(mod, context);
+    pass1.start();
+
+    string[string] map;
+    if (auto array = getValue!(ArrayInitExpression)("map"))
+      foreach (i, value; array.values)
+      {
+        auto key = array.keys[i];
+        if (auto valExp = castTo!(StringExpression)(value))
+          if (!key)
+            error(value.begin, "expected key : value");
+          else if (auto keyExp = castTo!(StringExpression)(key))
+            map[keyExp.getString()] = valExp.getString();
+      }
+    return map;
+  }
+}
+
+/// Resolves the path to a file from the executable's dir path
+/// if it is relative.
+/// Returns: filePath if it is absolute or execPath + filePath.
+string resolvePath(FilePath execPath, string filePath)
+{
+  if ((new FilePath(filePath)).isAbsolute())
+    return filePath;
+  return execPath.dup.append(filePath).toString();
+}
+
+version(DDoc)
+{
+  /// Returns the fully qualified path to this executable.
+  char[] GetExecutableFilePath();
+}
+else version(Windows)
+{
+private extern(Windows) uint GetModuleFileNameA(void*, char*, uint);
+
+char[] GetExecutableFilePath()
+{
+  alias GetModuleFileNameA GetModuleFileName;
+  char[] buffer = new char[256];
+  uint count;
+
+  while (1)
+  {
+    if (buffer is null)
+      return null;
+
+    count = GetModuleFileName(null, buffer.ptr, buffer.length);
+    if (count == 0)
+      return null;
+    if (buffer.length != count && buffer[count] == 0)
+      break;
+    // Increase size of buffer
+    buffer.length = buffer.length * 2;
+  }
+  assert(buffer[count] == 0);
+  // Reduce buffer to the actual length of the string (excluding '\0'.)
+  if (count < buffer.length)
+    buffer.length = count;
+  return buffer;
+}
+}
+else version(linux)
+{
+private extern(C) size_t readlink(char* path, char* buf, size_t bufsize);
+
+char[] GetExecutableFilePath()
+{
+  char[] buffer = new char[256];
+  size_t count;
+
+  while (1)
+  {
+    // This won't work on very old Linux systems.
+    count = readlink("/proc/self/exe".ptr, buffer.ptr, buffer.length);
+    if (count == -1)
+      return null;
+    if (count < buffer.length)
+      break;
+    buffer.length = buffer.length * 2;
+  }
+  buffer.length = count;
+  return buffer;
+}
+}
+else
+  static assert(0, "GetExecutableFilePath() is not implemented on this platform.");

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/src/TypeRules.d	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,129 @@
+/++
+  Author: Aziz Köksal
+  License: GPL3
++/
+module TypeRules;
+
+import cmd.Generate : xml_escape;
+
+import TypeRulesData;
+import common;
+
+static const string[] basicTypes = [
+  "char"[],   "wchar",   "dchar", "bool",
+  "byte",   "ubyte",   "short", "ushort",
+  "int",    "uint",    "long",  "ulong",
+  /+"cent",   "ucent",+/
+  "float",  "double",  "real",
+  "ifloat", "idouble", "ireal",
+  "cfloat", "cdouble", "creal"/+, "void"+/
+];
+
+static const string[] unaryExpressions = [
+  "!x",
+  "&x",
+  "~x",
+  "+x",
+  "-x",
+  "++x",
+  "--x",
+  "x++",
+  "x--",
+];
+
+static const string[] binaryExpressions = [
+  "x!<>=y",
+  "x!<>y",
+  "x!<=y",
+  "x!<y",
+  "x!>=y",
+  "x!>y",
+  "x<>=y",
+  "x<>y",
+
+  "x=y", "x==y", "x!=y",
+  "x<=y", "x<y",
+  "x>=y", "x>y",
+  "x<<=y", "x<<y",
+  "x>>=y","x>>y",
+  "x>>>=y", "x>>>y",
+  "x|=y", "x||y", "x|y",
+  "x&=y", "x&&y", "x&y",
+  "x+=y", "x+y",
+  "x-=y", "x-y",
+  "x/=y", "x/y",
+  "x*=y", "x*y",
+  "x%=y", "x%y",
+  "x^=y", "x^y",
+  "x~=y",
+  "x~y",
+  "x,y"
+];
+
+void genHTMLTypeRulesTables()
+{
+  Stdout(
+    `<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">`\n
+    `<html>`\n
+    `<head>`\n
+    `  <meta http-equiv="Content-Type" content="text/html; charset=utf-8">`\n
+    `  <link href="" rel="stylesheet" type="text/css">`\n
+    `  <style type="text/css">`\n
+    `    .E { color: darkred; } /* Error */`\n
+    `    .R { font-size: 0.8em; } /* Result */`\n
+    `    .X { color: darkorange; }`\n
+    `    .Y { color: darkblue; }`\n
+    `  </style>`\n
+    `</head>`\n
+    `<body>`\n
+    `<p>These tables show what the type results of certain expressions are.</p>`\n
+  );
+
+  Stdout.format("<table>\n<tr><th colspan=\"{}\">Unary Expressions</th></tr>\n", unaryExpressions.length);
+  Stdout("<tr><td><!--typecol--></td>");
+  foreach (unaryExpression; unaryExpressions)
+    Stdout.format("<td>{}</td>", {
+      if (unaryExpression[0] == 'x')
+        return `<span class="X">x</span>` ~ xml_escape(unaryExpression[1..$]);
+      else
+        return xml_escape(unaryExpression[0..$-1]) ~ `<span class="X">x</span>`;
+    }());
+  Stdout("</tr>\n");
+  foreach (i, basicType; basicTypes)
+  {
+    Stdout.format("<tr>\n"`<td class="X">{}</td>`, basicType);
+    foreach (expResults; unaryExpsResults)
+    {
+      auto result =  expResults[i];
+      Stdout.format(`<td class="R">{}</td>`, result[0] == 'E' ? `<span class="E">Error</span>`[] : result);
+    }
+    Stdout("\n<tr>\n");
+  }
+  Stdout("</table>\n");
+
+  foreach (i, expResults; binaryExpsResults)
+  {
+    auto binaryExpression = binaryExpressions[i];
+    binaryExpression = `<span class="X">x</span> ` ~
+                       xml_escape(binaryExpression[1..$-1]) ~
+                       ` <span class="Y">y</span>`;
+    Stdout.format("<table>\n<tr><th colspan=\"{}\">{}</th></tr>\n", basicTypes.length, binaryExpression);
+    Stdout.format("<tr><td><!--typecol--></td>");
+    foreach (basicType; basicTypes)
+      Stdout.format(`<td class="Y">{}</td>`, basicType);
+    Stdout("\n<tr>\n");
+    foreach (j, results; expResults)
+    {
+      Stdout.format("<tr>\n"`<td class="X">{}</td>`, basicTypes[j]);
+      foreach (result; results)
+        Stdout.format(`<td class="R">{}</td>`, result[0] == 'E' ? `<span class="E">Error</span>`[] : result);
+      Stdout("\n<tr>\n");
+    }
+    Stdout("</table>\n");
+  }
+
+  Stdout(
+    "\n</body>"
+    "\n</html>"
+  );
+}

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/src/TypeRulesData.d	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,1 @@
+// Run TypeRulesGenerator.d

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/src/TypeRulesGenerator.d	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,174 @@
+#! /usr/bin/rdmd
+/++
+  Author: Aziz Köksal
+  License: GPL3
++/
+module TypeRulesGenerator;
+
+import tango.io.File;
+import tango.io.FilePath;
+
+alias char[] string;
+
+void main(char[][] args)
+{
+  char[] text = "// Generated by TypeRulesGenerator.d\n"
+                "module TypeRules.d;\n\n";
+  text ~= "char[][][] unaryExpsResults = [\n";
+  foreach (results; unaryExpsResults)
+  {
+    text ~= "  [";
+    foreach (result; results)
+      text ~= '"' ~ result ~ '"' ~ ", ";
+    text[$-2] = ']';
+    text[$-1] = ',';
+    text ~= \n;
+  }
+  text[$-2] = '\n';
+  text[$-1] = ']';
+  text ~= ";\n\n";
+
+  text ~= "char[][][][] binaryExpsResults = [\n";
+  foreach (expResults; binaryExpsResults)
+  {
+    text ~= "  [\n";
+    foreach (results; expResults)
+    {
+      text ~= "    [";
+      foreach (result; results)
+        text ~= '"' ~ result ~ '"' ~ ", ";
+      text[$-2] = ']';
+      text[$-1] = ',';
+      text ~= \n;
+    }
+    text[$-2] = '\n';
+    text[$-1] = ' ';
+    text ~= " ],\n";
+  }
+  text[$-2] = '\n';
+  text[$-1] = ']';
+  text ~= ";\n";
+
+  // Write the text to a D module.
+  auto file = new File("TypeRulesData.d");
+  file.write(text);
+}
+
+template ExpressionType(char[] T1, char[] T2, char[] expression)
+{
+  mixin("alias "~T1~" X;");
+  mixin("alias "~T2~" Y;");
+  X x;
+  Y y;
+  static if(is(typeof(mixin(expression)) ResultType))
+    const char[] result = ResultType.stringof;
+  else
+    const char[] result = "Error";
+}
+alias ExpressionType EType;
+
+// pragma(msg, EType!("char", "int", "&x").result);
+
+static const string[] basicTypes = [
+  "char"[],   "wchar",   "dchar", "bool",
+  "byte",   "ubyte",   "short", "ushort",
+  "int",    "uint",    "long",  "ulong",
+  /+"cent",   "ucent",+/
+  "float",  "double",  "real",
+  "ifloat", "idouble", "ireal",
+  "cfloat", "cdouble", "creal"/+, "void"+/
+];
+
+static const string[] unaryExpressions = [
+  "!x",
+  "&x",
+  "~x",
+  "+x",
+  "-x",
+  "++x",
+  "--x",
+  "x++",
+  "x--",
+];
+
+static const string[] binaryExpressions = [
+  "x!<>=y",
+  "x!<>y",
+  "x!<=y",
+  "x!<y",
+  "x!>=y",
+  "x!>y",
+  "x<>=y",
+  "x<>y",
+
+  "x=y", "x==y", "x!=y",
+  "x<=y", "x<y",
+  "x>=y", "x>y",
+  "x<<=y", "x<<y",
+  "x>>=y","x>>y",
+  "x>>>=y", "x>>>y",
+  "x|=y", "x||y", "x|y",
+  "x&=y", "x&&y", "x&y",
+  "x+=y", "x+y",
+  "x-=y", "x-y",
+  "x/=y", "x/y",
+  "x*=y", "x*y",
+  "x%=y", "x%y",
+  "x^=y", "x^y",
+  "x~=y",
+  "x~y",
+  "x,y"
+];
+
+char[] genBinaryExpArray(char[] expression)
+{
+  char[] result = "[\n";
+  foreach (t1; basicTypes)
+  {
+    result ~= "[\n";
+    foreach (t2; basicTypes)
+      result ~= `EType!("`~t1~`", "`~t2~`", "`~expression~`").result,`\n;
+    result[result.length-2] = ']'; // Overwrite last comma.
+    result[result.length-1] = ','; // Overwrite last \n.
+  }
+  result[result.length-1] = ']'; // Overwrite last comma.
+  return result;
+}
+// pragma(msg, mixin(genBinaryExpArray("x%y")).stringof);
+
+char[] genBinaryExpsArray()
+{
+  char[] result = "[\n";
+  foreach (expression; binaryExpressions)
+  {
+    result ~= genBinaryExpArray(expression);
+    result ~= ",\n";
+  }
+  result[result.length-2] = ']';
+  return result;
+}
+
+// pragma(msg, mixin(genBinaryExpsArray()).stringof);
+
+char[] genUnaryExpArray(char[] expression)
+{
+  char[] result = "[\n";
+  foreach (t1; basicTypes)
+    result ~= `EType!("`~t1~`", "int", "`~expression~`").result,`\n;
+  result[result.length-2] = ']'; // Overwrite last comma.
+  return result;
+}
+
+char[] genUnaryExpsArray()
+{
+  char[] result = "[\n";
+  foreach (expression; unaryExpressions)
+    result ~= genUnaryExpArray(expression) ~ ",\n";
+  result[result.length-2] = ']';
+  return result;
+}
+
+// pragma(msg, mixin(genUnaryExpsArray()).stringof);
+
+auto unaryExpsResults = mixin(genUnaryExpsArray());
+auto binaryExpsResults = mixin(genBinaryExpsArray());

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/src/cmd/ASTStats.d	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,33 @@
+/++
+  Author: Aziz Köksal
+  License: GPL3
++/
+module cmd.ASTStats;
+
+import dil.ast.DefaultVisitor;
+import dil.ast.Node,
+       dil.ast.Declaration,
+       dil.ast.Statement,
+       dil.ast.Expression,
+       dil.ast.Types;
+
+/// Counts the nodes in a syntax tree.
+class ASTStats : DefaultVisitor
+{
+  uint[] table; /// Table for counting nodes.
+
+  /// Starts counting.
+  uint[] count(Node root)
+  {
+    table = new uint[g_classNames.length];
+    super.visitN(root);
+    return table;
+  }
+
+  // Override dispatch function.
+  override Node dispatch(Node n)
+  {
+    table[n.kind]++;
+    return super.dispatch(n);
+  }
+}

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/src/cmd/DDoc.d	Sun Mar 09 00:12:19 2008 +0100
@@ -0,0 +1,849 @@
+/++
+  Author: Aziz Köksal
+  License: GPL3
++/
+module cmd.DDoc;
+
+import cmd.DDocXML;
+import cmd.Generate;
+import dil.doc.Parser;
+import dil.doc.Macro;
+import dil.doc.Doc;
+import dil.ast.Node;
+import dil.ast.Declarations,
+       dil.ast.Statements,
+       dil.ast.Expression,
+       dil.ast.Parameters,
+       dil.ast.Types;
+import dil.ast.DefaultVisitor;
+import dil.lexer.Token;
+import dil.lexer.Funcs;
+import dil.semantic.Module;
+import dil.semantic.Pass1;
+import dil.semantic.Symbol;
+import dil.semantic.Symbols;
+import dil.Compilation;
+import dil.Information;
+import dil.Converter;
+import dil.SourceText;
+import dil.Enums;
+import dil.Time;
+import common;
+
+import tango.text.Ascii : toUpper;
+import tango.io.File;
+import tango.io.FilePath;
+
+/// Executes the doc generation command.
+void execute(string[] filePaths, string destDir, string[] macroPaths,
+             bool writeXML, bool incUndoc, bool verbose,
+             CompilationContext context, InfoManager infoMan)
+{
+  // Parse macro files.
+  MacroTable mtable;
+  MacroParser mparser;
+  foreach (macroPath; macroPaths)
+  {
+    auto macros = mparser.parse(loadMacroFile(macroPath, infoMan));
+    mtable = new MacroTable(mtable);
+    mtable.insert(macros);
+  }
+
+//   foreach (k, v; mtable.table)
+//     Stdout(k)("=")(v.text);
+
+  // For DDoc code sections.
+  auto tokenHL = new TokenHighlighter(infoMan, writeXML == false);
+
+  // Process D files.
+  foreach (filePath; filePaths)
+  {
+    auto mod = new Module(filePath, infoMan);
+    // Parse the file.
+    mod.parse();
+    if (mod.hasErrors)
+      continue;
+
+    // Start semantic analysis.
+    auto pass1 = new SemanticPass1(mod, context);
+    pass1.start();
+
+    // Generate documentation.
+    auto dest = new FilePath(destDir);
+    dest.append(mod.getFQN() ~ (writeXML ? ".xml" : ".html"));
+
+    InfoManager infoMan2; // Collects warnings from the macro expander.
+    if (verbose)
+    {
+      Stdout.formatln("{} > {}", mod.filePath, dest);
+      infoMan2 = new InfoManager();
+    }
+
+    writeDocFile(dest.toString(), mod, mtable, writeXML, incUndoc, tokenHL, infoMan2);
+
+    if (infoMan2)
+      infoMan ~= infoMan2.info;
+  }
+}
+
+void writeDocFile(string dest, Module mod, MacroTable mtable,
+                  bool writeXML, bool incUndoc,
+                  TokenHighlighter tokenHL, InfoManager infoMan)
+{
+  // Create a macro environment for this module.
+  mtable = new MacroTable(mtable);
+  // Define runtime macros.
+  // MODPATH is not in the specs.
+  mtable.insert("MODPATH", mod.getFQNPath() ~ "." ~ mod.fileExtension());
+  mtable.insert("TITLE", mod.getFQN());
+  mtable.insert("DOCFILENAME", mod.getFQN() ~ (writeXML ? ".xml" : ".html"));
+  auto timeStr = Time.toString();
+  mtable.insert("DATETIME", timeStr);
+  mtable.insert("YEAR", Time.year(timeStr));
+
+  DDocEmitter docEmitter;
+  if (writeXML)
+    docEmitter = new DDocXMLEmitter(mod, mtable, incUndoc, tokenHL);
+  else
+    docEmitter = new DDocEmitter(mod, mtable, incUndoc, tokenHL);
+  docEmitter.emit();
+  // Set BODY macro to the text produced by the DDocEmitter.
+  mtable.insert("BODY", docEmitter.text);
+  // Do the macro expansion pass.
+  auto fileText = MacroExpander.expand(mtable, "$(DDOC)", mod.filePath, infoMan);
+// fileText ~= "\n<pre>\n" ~ doc.text ~ "\n</pre>";
+  // Finally write the file out to the harddisk.
+  auto file = new File(dest);
+  file.write(fileText);
+}
+
+/// Loads a macro file. Converts any Unicode encoding to UTF-8.
+string loadMacroFile(string filePath, InfoManager infoMan)
+{
+  auto src = new SourceText(filePath);
+  src.load(infoMan);
+  auto text = src.data[0..$-1]; // Exclude '\0'.
+  return sanitizeText(text);
+}
+
+/// Traverses the syntax tree and writes DDoc macros to a string buffer.
+class DDocEmitter : DefaultVisitor
+{
+  char[] text; /// The buffer that is written to.
+  bool includeUndocumented;
+  MacroTable mtable;
+  Module modul;
+  TokenHighlighter tokenHL;
+
+  /// Constructs a DDocEmitter object.
+  /// Params:
+  ///   modul = the module to generate text for.
+  ///   mtable = the macro table.
+  ///   includeUndocumented = whether to include undocumented symbols.
+  ///   tokenHL = used to highlight code sections.
+  this(Module modul, MacroTable mtable, bool includeUndocumented,
+       TokenHighlighter tokenHL)
+  {
+    this.mtable = mtable;
+    this.includeUndocumented = includeUndocumented;
+    this.modul = modul;
+    this.tokenHL = tokenHL;
+  }
+
+  /// Entry method.
+  char[] emit()
+  {
+    if (auto d = modul.moduleDecl)
+    {
+      if (ddoc(d))
+      {
+        if (auto copyright = cmnt.takeCopyright())
+          mtable.insert(new Macro("COPYRIGHT", copyright.text));
+        writeComment();
+      }
+    }
+    MEMBERS("MODULE", { visitD(modul.root); });
+    return text;
+  }
+
+  char[] textSpan(Token* left, Token* right)
+  {
+    //assert(left && right && (left.end <= right.start || left is right));
+    //char[] result;
+    //TODO: filter out whitespace tokens.
+    return Token.textSpan(left, right);
+  }
+
+  TemplateParameters tparams; /// The template parameters of the current declaration.
+
+  DDocComment cmnt; /// Current comment.
+  DDocComment prevCmnt; /// Previous comment in scope.
+  /// An empty comment. Used for undocumented symbols.
+  static const DDocComment emptyCmnt;
+
+  /// Initializes the empty comment.
+  static this()
+  {
+    this.emptyCmnt = new DDocComment(null, null, null);
+  }
+
+  /// Keeps track of previous comments in each scope.
+  scope class Scope
+  {
+    DDocComment saved_prevCmnt;
+    bool saved_cmntIsDitto;
+    uint saved_prevDeclOffset;
+    this()
+    { // Save the previous comment of the parent scope.
+      saved_prevCmnt = this.outer.prevCmnt;
+      saved_cmntIsDitto = this.outer.cmntIsDitto;
+      saved_prevDeclOffset = this.outer.prevDeclOffset; 
+      // Entering a new scope. Clear variables.
+      this.outer.prevCmnt = null;
+      this.outer.cmntIsDitto = false;
+      this.outer.prevDeclOffset = 0;
+    }
+
+    ~this()
+    { // Restore the previous comment of the parent scope.
+      this.outer.prevCmnt = saved_prevCmnt;
+      this.outer.cmntIsDitto = saved_cmntIsDitto;
+      this.outer.prevDeclOffset = saved_prevDeclOffset;
+    }
+  }
+
+  bool cmntIsDitto; /// True if current comment is "ditto".
+
+  /// Returns the DDocComment for node.
+  DDocComment ddoc(Node node)
+  {
+    auto c = getDDocComment(node);
+    this.cmnt = null;
+    if (c)
+    {
+      if (c.isDitto)
+      {
+        this.cmnt = this.prevCmnt;
+        this.cmntIsDitto = true;
+      }
+      else
+      {
+        this.cmntIsDitto = false;
+        this.cmnt = c;
+        this.prevCmnt = c;
+      }
+    }
+    else if (includeUndocumented)
+      this.cmnt = this.emptyCmnt;
+    return this.cmnt;
+  }
+
+  /// List of predefined, special sections.
+  static char[][char[]] specialSections;
+  static this()
+  {
+    foreach (name; ["AUTHORS", "BUGS", "COPYRIGHT", "DATE", "DEPRECATED",
+                    "EXAMPLES", "HISTORY", "LICENSE", "RETURNS", "SEE_ALSO",
+                    "STANDARDS", "THROWS", "VERSION"])
+      specialSections[name] = name;
+  }
+
+  /// Writes the DDoc comment to the text buffer.
+  void writeComment()
+  {
+    auto c = this.cmnt;
+    assert(c !is null);
+    if (c.sections.length == 0)
+      return;
+    write("$(DDOC_SECTIONS ");
+      foreach (s; c.sections)
+      {
+        if (s is c.summary)
+          write("\n$(DDOC_SUMMARY ");
+        else if (s is c.description)
+          write("\n$(DDOC_DESCRIPTION ");
+        else if (auto name = toUpper(s.name.dup) in specialSections)
+          write("\n$(DDOC_" ~ *name ~ " ");
+        else if (s.Is("params"))
+        { // Process parameters section.
+          auto ps = new ParamsSection(s.name, s.text);
+          write("\n$(DDOC_PARAMS ");
+          foreach (i, paramName; ps.paramNames)
+            write("\n$(DDOC_PARAM_ROW ",
+                    "$(DDOC_PARAM_ID $(DDOC_PARAM ", paramName, "))",
+                    "$(DDOC_PARAM_DESC ", ps.paramDescs[i], ")",
+                  ")");
+          write(")");
+          continue;
+        }
+        else if (s.Is("macros"))
+        { // Declare the macros in this section.
+          auto ms = new MacrosSection(s.name, s.text);
+          mtable.insert(ms.macroNames, ms.macroTexts);
+          continue;
+        }
+        else
+          write("\n$(DDOC_SECTION $(DDOC_SECTION_H " ~ s.name ~ ":)");
+        write(scanCommentText(s.text), ")");
+      }
+    write(")");
+  }
+
+  /// Scans the comment text and:
+  /// $(UL
+  /// $(LI skips and leaves macro invocations unchanged)
+  /// $(LI skips HTML tags)
+  /// $(LI escapes '(', ')', '<', '>' and '&')
+  /// $(LI inserts $&#40;DDOC_BLANKLINE&#41; in place of \n\n)
+  /// $(LI highlights code in code sections)
+  /// )
+  char[] scanCommentText(char[] text)
+  {
+    char* p = text.ptr;
+    char* end = p + text.length;
+    char[] result = new char[text.length]; // Reserve space.
+    result.length = 0;
+
+    while (p < end)
+    {
+      switch (*p)
+      {
+      case '$':
+        if (auto macroEnd = MacroParser.scanMacro(p, end))
+        {
+          result ~= makeString(p, macroEnd); // Copy macro invocation as is.
+          p = macroEnd;
+          continue;
+        }
+        goto default;
+      case '<':
+        auto begin = p;
+        p++;
+        if (p+2 < end && *p == '!' && p[1] == '-' && p[2] == '-') // <!--
+        {
+          p += 2; // Point to 2nd '-'.
+          // Scan to closing "-->".
+          while (++p < end)
+            if (p+2 < end && *p == '-' && p[1] == '-' && p[2] == '>')
+            {
+              p += 3; // Point one past '>'.
+              break;
+            }
+          result ~= makeString(begin, p);
+        } // <tag ...> or </tag>
+        else if (p < end && (isalpha(*p) || *p == '/'))
+        {
+          while (++p < end && *p != '>') // Skip to closing '>'.
+          {}
+          if (p == end)
+          { // No closing '>' found.
+            p = begin + 1;
+            result ~= "&lt;";
+            continue;
+          }
+          p++; // Skip '>'.
+          result ~= makeString(begin, p);
+        }
+        else
+          result ~= "&lt;";
+        continue;
+      case '(': result ~= "&#40;"; break;
+      case ')': result ~= "&#41;"; break;
+      // case '\'': result ~= "&apos;"; break; // &#39;
+      // case '"': result ~= "&quot;"; break;
+      case '>': result ~= "&gt;"; break;
+      case '&':
+        if (p+1 < end && (isalpha(p[1]) || p[1] == '#'))
+          goto default;
+        result ~= "&amp;";
+        break;
+      case '\n':
+        if (!(p+1 < end && p[1] == '\n'))
+          goto default;
+        ++p;
+        result ~= "$(DDOC_BLANKLINE)";
+        break;
+      case '-':
+        if (p+2 < end && p[1] == '-' && p[2] == '-')
+        {
+          while (p < end && *p == '-')
+            p++;
+          auto codeBegin = p;
+          p--;
+          while (++p < end)
+            if (p+2 < end && *p == '-' && p[1] == '-' && p[2] == '-')
+              break;
+          auto codeText = makeString(codeBegin, p);
+          result ~= tokenHL.highlight(codeText, modul.filePath);
+          while (p < end && *p == '-')
+            p++;
+          continue;
+        }
+        //goto default;
+      default:
+        result ~= *p;
+      }
+      p++;
+    }
+    return result;
+  }
+
+  /// Escapes '<', '>' and '&' with named HTML entities.
+  char[] escape(char[] text)
+  {
+    char[] result = new char[text.length]; // Reserve space.
+    result.length = 0;
+    foreach(c; text)
+      switch(c)
+      {
+        case '<': result ~= "&lt;";  break;
+        case '>': result ~= "&gt;";  break;
+        case '&': result ~= "&amp;"; break;
+        default:  result ~= c;
+      }
+    if (result.length != text.length)
+      return result;
+    // Nothing escaped. Return original text.
+    delete result;
+    return text;
+  }
+
+  /// Writes an array of strings to the text buffer.
+  void write(char[][] strings...)
+  {
+    foreach (s; strings)
+      text ~= s;
+  }
+
+  /// Writes params to the text buffer.
+  void writeParams(Parameters params)
+  {
+    if (!params.items.length)
+      return write("()");
+    write("(");
+    auto lastParam = params.items[$-1];
+    foreach (param; params.items)
+    {
+      if (param.isCVariadic)
+        write("...");
+      else
+      {
+        assert(param.type);
+        // Write storage classes.
+        auto typeBegin = param.type.baseType.begin;
+        if (typeBegin !is param.begin) // Write storage classes.
+          write(textSpan(param.begin, typeBegin.prevNWS), " ");
+        write(escape(textSpan(typeBegin, param.type.end))); // Write type.
+        if (param.name)
+          write(" $(DDOC_PARAM ", param.name.str, ")");
+        if (param.isDVariadic)
+          write("...");
+        if (param.defValue)
+          write(" = ", escape(textSpan(param.defValue.begin, param.defValue.end)));
+      }
+      if (param !is lastParam)
+        write(", ");
+    }
+    write(")");
+  }
+
+  /// Writes the current template parameters to the text buffer.
+  void writeTemplateParams()
+  {
+    if (!tparams)
+      return;
+    write(escape(textSpan(tparams.begin, tparams.end)));
+    tparams = null;
+  }
+
+  /// Writes bases to the text buffer.
+  void writeInheritanceList(BaseClassType[] bases)
+  {
+    if (bases.length == 0)
+      return;
+    auto basesBegin = bases[0].begin.prevNWS;
+    if (basesBegin.kind == TOK.Colon)
+      basesBegin = bases[0].begin;
+    write(" : ", escape(textSpan(basesBegin, bases[$-1].end)));
+  }
+
+  /// Writes a symbol to the text buffer. E.g: $&#40;SYMBOL Buffer, 123&#41;
+  void SYMBOL(char[] name, Declaration d)
+  {
+    auto loc = d.begin.getRealLocation();
+    auto str = Format("$(SYMBOL {}, {})", name, loc.lineNum);
+    write(str);
+    // write("$(DDOC_PSYMBOL ", name, ")");
+  }
+
+  /// Offset at which to insert a declaration which have a "ditto" comment.
+  uint prevDeclOffset;
+
+  /// Writes a declaration to the text buffer.
+  void DECL(void delegate() dg, Declaration d, bool writeSemicolon = true)
+  {
+    if (cmntIsDitto)
+    { alias prevDeclOffset offs;
+      assert(offs != 0);
+      auto savedText = text;
+      text = "";
+      write("\n$(DDOC_DECL ");
+      dg();
+      writeSemicolon && write(";");
+      writeAttributes(d);
+      write(")");
+      // Insert text at offset.
+      auto len = text.length;
+      text = savedText[0..offs] ~ text ~ savedText[offs..$];
+      offs += len; // Add length of the inserted text to the offset.
+      return;
+    }
+    write("\n$(DDOC_DECL ");
+    dg();
+    writeSemicolon && write(";");
+    writeAttributes(d);
+    write(")");
+    prevDeclOffset = text.length;
+  }
+
+  /// Wraps the DDOC_DECL_DD macro around the text written by dg().
+  void DESC(void delegate() dg)
+  {
+    if (cmntIsDitto)
+      return;
+    write("\n$(DDOC_DECL_DD ");
+    dg();
+    write(")");
+  }
+
+  /// Wraps the DDOC_kind_MEMBERS macro around the text written by dg().
+  void MEMBERS(char[] kind, void delegate() dg)
+  {
+    write("\n$(DDOC_"~kind~"_MEMBERS ");
+    dg();
+    write(")");
+  }
+
+  /// Writes a class or interface declaration.
+  void writeClassOrInterface(T)(T d)
+  {
+    if (!ddoc(d))
+      return d;
+    DECL({
+      write(d.begin.srcText, " ");
+      SYMBOL(d.name.str, d);
+      writeTemplateParams();
+      writeInheritanceList(d.bases);
+    }, d);
+    DESC({
+      writeComment();
+      MEMBERS(is(T == ClassDeclaration) ? "CLASS" : "INTERFACE", {
+        scope s = new Scope();
+        d.decls && super.visit(d.decls);
+      });
+    });
+  }
+
+  // templated decls are not virtual so we need these:
+
+  /// Writes a class declaration.
+  void writeClass(ClassDeclaration d) {
+    writeClassOrInterface(d);
+  }
+
+  /// Writes an interface declaration.
+  void writeInterface(InterfaceDeclaration d) {
+    writeClassOrInterface(d);
+  }
+
+  /// Writes a struct or union declaration.
+  void writeStructOrUnion(T)(T d)
+  {
+    if (!ddoc(d))
+      return d;
+    DECL({
+      write(d.begin.srcText, d.name ? " " : "");
+      if (d.name)
+        SYMBOL(d.name.str, d);
+      writeTemplateParams();
+    }, d);
+    DESC({
+      writeComment();
+      MEMBERS(is(T == StructDeclaration) ? "STRUCT" : "UNION", {
+        scope s = new Scope();
+        d.decls && super.visit(d.decls);
+      });
+    });
+  }
+
+  // templated decls are not virtual so we need these:
+
+  /// Writes a struct declaration.
+  void writeStruct(StructDeclaration d) {
+    writeStructOrUnion(d);
+  }
+
+  /// Writes an union declaration.
+  void writeUnion(UnionDeclaration d) {
+    writeStructOrUnion(d);
+  }
+
+  /// Writes an alias or typedef declaration.
+  void writeAliasOrTypedef(T)(T d)
+  {
+    auto prefix = is(T == AliasDeclaration) ? "alias " : "typedef ";
+    if (auto vd = d.decl.Is!(VariablesDeclaration))
+    {
+      auto type = textSpan(vd.typeNode.baseType.begin, vd.typeNode.end);
+      foreach (name; vd.names)
+        DECL({ write(prefix); write(escape(type), " "); SYMBOL(name.str, d); }, d);
+    }
+    else if (auto fd = d.decl.Is!(FunctionDeclaration))
+    {}
+    // DECL({ write(textSpan(d.begin, d.end)); }, false);
+    DESC({ writeComment(); });
+  }
+
+  /// Writes the attributes of a declaration in brackets.
+  void writeAttributes(Declaration d)
+  {
+    char[][] attributes;
+
+    if (d.prot != Protection.None)
+      attributes ~= "$(PROT " ~ .toString(d.prot) ~ ")";
+
+    auto stc = d.stc;
+    stc &= ~StorageClass.Auto; // Ignore auto.
+    foreach (stcStr; .toStrings(stc))
+      attributes ~= "$(STC " ~ stcStr ~ ")";
+
+    LinkageType ltype;
+    if (auto vd = d.Is!(VariablesDeclaration))
+      ltype = vd.linkageType;
+    else if (auto fd = d.Is!(FunctionDeclaration))
+      ltype = fd.linkageType;
+
+    if (ltype != LinkageType.None)
+      attributes ~= "$(LINKAGE extern(" ~ .toString(ltype) ~ "))";
+
+    if (!attributes.length)
+      return;
+
+    write(" $(ATTRIBUTES ");
+    write(attributes[0]);
+    foreach (attribute; attributes[1..$])
+      write(", ", attribute);
+    write(")");
+  }
+
+  alias Declaration D;
+
+override:
+  D visit(AliasDeclaration d)
+  {
+    if (!ddoc(d))
+      return d;
+    writeAliasOrTypedef(d);
+    return d;
+  }
+
+  D visit(TypedefDeclaration d)
+  {
+    if (!ddoc(d))
+      return d;
+    writeAliasOrTypedef(d);
+    return d;
+  }
+
+  D visit(EnumDeclaration d)
+  {
+    if (!ddoc(d))
+      return d;
+    DECL({
+      write("enum", d.name ? " " : "");
+      d.name && SYMBOL(d.name.str, d);
+    }, d);
+    DESC({
+      writeComment();
+      MEMBERS("ENUM", { scope s = new Scope(); super.visit(d); });
+    });
+    return d;
+  }
+
+  D visit(EnumMemberDeclaration d)
+  {
+    if (!ddoc(d))
+      return d;
+    DECL({ SYMBOL(d.name.str, d); }, d, false);
+    DESC({ writeComment(); });
+    return d;
+  }
+
+  D visit(TemplateDeclaration d)
+  {
+    this.tparams = d.tparams;
+    if (d.begin.kind != TOK.Template)
+    { // This is a templatized class/interface/struct/union/function.
+      super.visit(d.decls);
+      this.tparams = null;
+      return d;
+    }
+    if (!ddoc(d))
+      return d;
+    DECL({
+      write("template ");
+      SYMBOL(d.name.str, d);
+      writeTemplateParams();
+    }, d);
+    DESC({
+      writeComment();
+      MEMBERS("TEMPLATE", {
+        scope s = new Scope();
+        super.visit(d.decls);
+      });
+    });
+    return d;
+  }
+
+  D visit(ClassDeclaration d)
+  {
+    writeClass(d);
+    return d;
+  }
+
+  D visit(InterfaceDeclaration d)
+  {
+    writeInterface(d);
+    return d;
+  }
+
+  D visit(StructDeclaration d)
+  {
+    writeStruct(d);
+    return d;
+  }
+
+  D visit(UnionDeclaration d)
+  {
+    writeUnion(d);
+    return d;
+  }
+
+  D visit(ConstructorDeclaration d)
+  {
+    if (!ddoc(d))
+      return d;
+    DECL({ SYMBOL("this", d); writeParams(d.params); }, d);
+    DESC({ writeComment(); });
+    return d;
+  }
+
+  D visit(StaticConstructorDeclaration d)
+  {
+    if (!ddoc(d))
+      return d;
+    DECL({ write("static "); SYMBOL("this", d); write("()"); }, d);
+    DESC({ writeComment(); });
+    return d;
+  }
+
+  D visit(DestructorDeclaration d)
+  {
+    if (!ddoc(d))
+      return d;
+    DECL({ write("~"); SYMBOL("this", d); write("()"); }, d);
+    DESC({ writeComment(); });
+    return d;
+  }
+
+  D visit(StaticDestructorDeclaration d)
+  {
+    if (!ddoc(d))
+      return d;
+    DECL({ write("static ~"); SYMBOL("this", d); write("()"); }, d);
+    DESC({ writeComment(); });
+    return d;
+  }
+
+  D visit(FunctionDeclaration d)
+  {
+    if (!ddoc(d))
+      return d;
+    auto type = textSpan(d.returnType.baseType.begin, d.returnType.end);
+    DECL({
+      write(escape(type), " ");
+      SYMBOL(d.name.str, d);
+      writeTemplateParams();
+      writeParams(d.params);
+    }, d);
+    DESC({ writeComment(); });
+    return d;
+  }
+
+  D visit(NewDeclaration d)
+  {
+    if (!ddoc(d))
+      return d;
+    DECL({ SYMBOL("new", d); writeParams(d.params); }, d);
+    DESC({ writeComment(); });
+    return d;
+  }
+
+  D visit(DeleteDeclaration d)
+  {
+    if (!ddoc(d))
+      return d;
+    DECL({ SYMBOL("delete", d); writeParams(d.params); }, d);
+    DESC({ writeComment(); });
+    return d;
+  }
+
+  D visit(VariablesDeclaration d)
+  {
+    if (!ddoc(d))
+      return d;
+    char[] type = "auto";
+    if (d.typeNode)
+      type = textSpan(d.typeNode.baseType.begin, d.typeNode.end);
+    foreach (name; d.names)
+      DECL({ write(escape(type), " "); SYMBOL(name.str, d); }, d);
+    DESC({ writeComment(); });
+    return d;
+  }
+
+  D visit(InvariantDeclaration d)
+  {
+    if (!ddoc(d))
+      return d;
+    DECL({ SYMBOL("invariant", d); }, d);
+    DESC({ writeComment(); });
+    return d;
+  }
+
+  D visit(UnittestDeclaration d)
+  {
+    if (!ddoc(d))
+      return d;
+    DECL({ SYMBOL("unittest", d); }, d);
+    DESC({ writeComment(); });
+    return d;
+  }
+
+  D visit(DebugDeclaration d)
+  {
+    d.compiledDecls && visitD(d.compiledDecls);
+    return d;
+  }
+
+  D visit(VersionDeclaration d)
+  {
+    d.compiledDecls && visitD(d.compiledDecls);
+    return d;
+  }
+
+  D visit(StaticIfDeclaration d)
+  {
+    d.ifDecls && visitD(d.ifDecls);
+    return d;
+  }
+}