Initial commit

9 files changed, 2113 insertions, 0 deletions

diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..378eac2
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1 @@
+build
diff --git a/LICENSE b/LICENSE
new file mode 100644
index 0000000..4eff9a6
--- /dev/null
+++ b/LICENSE
@@ -0,0 +1,661 @@
+GNU AFFERO GENERAL PUBLIC LICENSE
+                       Version 3, 19 November 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU Affero General Public License is a free, copyleft license for
+software and other kinds of works, specifically designed to ensure
+cooperation with the community in the case of network server software.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+our General Public Licenses are 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.
+
+  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.
+
+  Developers that use our General Public Licenses protect your rights
+with two steps: (1) assert copyright on the software, and (2) offer
+you this License which gives you legal permission to copy, distribute
+and/or modify the software.
+
+  A secondary benefit of defending all users' freedom is that
+improvements made in alternate versions of the program, if they
+receive widespread use, become available for other developers to
+incorporate.  Many developers of free software are heartened and
+encouraged by the resulting cooperation.  However, in the case of
+software used on network servers, this result may fail to come about.
+The GNU General Public License permits making a modified version and
+letting the public access it on a server without ever releasing its
+source code to the public.
+
+  The GNU Affero General Public License is designed specifically to
+ensure that, in such cases, the modified source code becomes available
+to the community.  It requires the operator of a network server to
+provide the source code of the modified version running there to the
+users of that server.  Therefore, public use of a modified version, on
+a publicly accessible server, gives the public access to the source
+code of the modified version.
+
+  An older license, called the Affero General Public License and
+published by Affero, was designed to accomplish similar goals.  This is
+a different license, not a version of the Affero GPL, but Affero has
+released a new version of the Affero GPL which permits relicensing under
+this license.
+
+  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 Affero 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. Remote Network Interaction; Use with the GNU General Public License.
+
+  Notwithstanding any other provision of this License, if you modify the
+Program, your modified version must prominently offer all users
+interacting with it remotely through a computer network (if your version
+supports such interaction) an opportunity to receive the Corresponding
+Source of your version by providing access to the Corresponding Source
+from a network server at no charge, through some standard or customary
+means of facilitating copying of software.  This Corresponding Source
+shall include the Corresponding Source for any work covered by version 3
+of the GNU General Public License that is incorporated pursuant to the
+following paragraph.
+
+  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 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 work with which it is combined will remain governed by version
+3 of the GNU General Public License.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU Affero 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 Affero 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 Affero 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 Affero 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.
+
+    wmap-parser-c, ANSI C wmap wardley map file parser.
+    Copyright (C) 2025  Ruben Beltran del Rio
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Affero 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 Affero General Public License for more details.
+
+    You should have received a copy of the GNU Affero General Public License
+    along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If your software can interact with users remotely through a computer
+network, you should also make sure that it provides a way for users to
+get its source.  For example, if your program is a web application, its
+interface could display a "Source" link that leads users to an archive
+of the code.  There are many ways you could offer source, and different
+solutions will be better for different programs; see section 13 for the
+specific requirements.
+
+  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 AGPL, see
+<https://www.gnu.org/licenses/>.
diff --git a/Makefile b/Makefile
new file mode 100644
index 0000000..76a6d9c
--- /dev/null
+++ b/Makefile
@@ -0,0 +1,117 @@
+# WMAP Parser Makefile
+# ANSI C compatible library with clean build structure
+
+CC = gcc
+CFLAGS_RELEASE = -ansi -pedantic -Wall -Wextra -O2 -fomit-frame-pointer
+CFLAGS_DEBUG = -ansi -pedantic -Wall -Wextra -g -DDEBUG
+
+# Build configuration
+CONFIGURATION ?= release
+BUILD_DIR = ./build/$(CONFIGURATION)
+
+# Set CFLAGS based on build type
+ifeq ($(CONFIGURATION),debug)
+    CFLAGS = $(CFLAGS_DEBUG)
+else
+    CFLAGS = $(CFLAGS_RELEASE)
+endif
+
+TARGET = $(BUILD_DIR)/wmap_test
+SOURCES = src/test.c src/wmap_parser.c
+OBJECTS = $(BUILD_DIR)/test.o $(BUILD_DIR)/wmap_parser.o
+HEADERS = src/wmap_parser.h
+EXAMPLE_FILE = doc/example.wmap
+ITERATIONS ?= 100
+
+# Default target
+all: $(TARGET)
+
+# Create build directory if it doesn't exist
+$(BUILD_DIR):
+	@mkdir -p $(BUILD_DIR)
+
+# Build the test program
+$(TARGET): $(BUILD_DIR) $(OBJECTS)
+	$(CC) $(CFLAGS) -o $(TARGET) $(OBJECTS)
+
+# Object files
+$(BUILD_DIR)/test.o: src/test.c $(HEADERS)
+	$(CC) $(CFLAGS) -c src/test.c -o $(BUILD_DIR)/test.o
+
+$(BUILD_DIR)/wmap_parser.o: src/wmap_parser.c $(HEADERS)
+	$(CC) $(CFLAGS) -c src/wmap_parser.c -o $(BUILD_DIR)/wmap_parser.o
+
+# Debug build (use CONFIGURATION=debug)
+debug:
+	@$(MAKE) CONFIGURATION=debug
+
+# Release build (explicit)
+release:
+	@$(MAKE) CONFIGURATION=release
+
+# Test the parser with the example file
+test: $(TARGET)
+	@echo "=== Running parser test ==="
+	./$(TARGET) $(EXAMPLE_FILE)
+
+# Run performance benchmark
+benchmark: $(TARGET)
+	@echo "=== Running performance benchmark ==="
+	./$(TARGET) $(EXAMPLE_FILE) benchmark $(ITERATIONS)
+
+# Memory test using valgrind (if available)
+memtest:
+	@$(MAKE) CONFIGURATION=debug
+	@echo "=== Running memory test ==="
+	@if command -v valgrind >/dev/null 2>&1; then \
+		valgrind --leak-check=full --show-leak-kinds=all ./build/debug/wmap_test $(EXAMPLE_FILE); \
+	else \
+		echo "Valgrind not available, running regular test"; \
+		./build/debug/wmap_test $(EXAMPLE_FILE); \
+	fi
+
+# Profile the parser (if gprof available)
+profile:
+	@$(MAKE) CFLAGS="$(CFLAGS_RELEASE) -pg"
+	@echo "=== Running profiling test ==="
+	./$(TARGET) $(EXAMPLE_FILE) benchmark 100
+	@if [ -f gmon.out ]; then \
+		gprof $(TARGET) gmon.out > profile_report.txt; \
+		echo "Profile report saved to profile_report.txt"; \
+	else \
+		echo "No profiling data generated"; \
+	fi
+
+# Clean build artifacts
+clean:
+	rm -rf ./build
+	rm -f gmon.out profile_report.txt
+
+# Show parser capabilities
+info:
+	@echo "=== WMAP Parser Information ==="
+	@echo "Build type: $(CONFIGURATION)"
+	@echo "Build directory: $(BUILD_DIR)"
+	@echo "Max components: $(shell grep WMAP_MAX_COMPONENTS src/wmap_parser.h | cut -d' ' -f3)"
+	@echo "Max dependencies: $(shell grep WMAP_MAX_DEPENDENCIES src/wmap_parser.h | cut -d' ' -f3)"
+	@echo "Max name length: $(shell grep WMAP_MAX_NAME_LEN src/wmap_parser.h | cut -d' ' -f3)"
+	@echo "Compiler: $(CC)"
+	@echo "Flags: $(CFLAGS)"
+	@echo ""
+	@echo "Available targets:"
+	@echo "  all         - Build the parser (default: release)"
+	@echo "  debug       - Build debug version"
+	@echo "  release     - Build release version (explicit)"
+	@echo "  test        - Test with example.wmap"
+	@echo "  benchmark   - Performance benchmark"
+	@echo "  memtest     - Memory leak test (uses debug build)"
+	@echo "  clean       - Remove all build artifacts"
+	@echo ""
+	@echo "Build types:"
+	@echo "  make                    # Release build -> ./build/release/"
+	@echo "  make -e CONFIGURATION=debug # Debug build -> ./build/debug/"
+
+# Help target
+help: info
+
+.PHONY: all debug release test benchmark memtest profile clean info help
diff --git a/README.md b/README.md
new file mode 100644
index 0000000..ca3e63d
--- /dev/null
+++ b/README.md
@@ -0,0 +1,147 @@
+# WMAP Parser for C
+
+A parser for `wmap` formatted Wardley Map files in ANSI C, with 68k and PPC mac support.
+
+## Features
+
+- **ANSI C Compatible**: Works with older compilers and hardware
+- **Complete Coverage**: Supports all `wmap` entities (components, dependencies, notes, stages, groups, inertia, evolution)
+
+## Quick Start
+
+```c
+#include <wmap_parser.h>
+
+int main() {
+    // Parse from file
+    wmap_map_t* map = wmap_parse_file("example.wmap");
+    if (!map) {
+        printf("Failed to parse file\n");
+        return 1;
+    }
+
+    // Access parsed data
+    printf("Components: %d\n", map->component_count);
+    printf("Dependencies: %d\n", map->dependency_count);
+
+    // Access individual components
+    for (int i = 0; i < map->component_count; i++) {
+        printf("Component: %s at (%.2f, %.2f)\n",
+               map->components[i].name,
+               map->components[i].x,
+               map->components[i].y);
+    }
+
+    // Clean up
+    wmap_map_free(map);
+    return 0;
+}
+```
+
+## Build Instructions
+
+### Library Build
+```bash
+make              # Build release version -> ./build/release/
+make debug        # Build debug version -> ./build/debug/
+make test         # Test with example.wmap (uses current build)
+make benchmark    # Performance benchmark (100 iterations default)
+make -e ITERATIONS=1000 benchmark  # Custom iteration count
+```
+
+### Setting Configuration
+
+You can pass the CONFIGURATION environment variable to control which version
+is used. This applies to test and benchmark as well.
+```bash
+make -e CONFIGURATION=debug   # Debug build via environment variable
+```
+
+### Development
+```bash
+make debug        # Debug build with symbols
+make memtest      # Memory leak testing (uses debug build)
+make clean        # Remove all build artifacts (./build/ directory)
+make info         # Show build configuration and available targets
+```
+
+## Data Structures
+
+```c
+typedef struct {
+    wmap_component_t components[WMAP_MAX_COMPONENTS];
+    wmap_dependency_t dependencies[WMAP_MAX_DEPENDENCIES];
+    wmap_note_t notes[WMAP_MAX_NOTES];
+    wmap_stage_data_t stages[WMAP_MAX_STAGES];
+    wmap_group_t groups[WMAP_MAX_GROUPS];
+    wmap_inertia_t inertias[WMAP_MAX_INERTIAS];
+    wmap_evolution_t evolutions[WMAP_MAX_EVOLUTIONS];
+
+    int component_count;
+    int dependency_count;
+    // ... other counts
+} wmap_map_t;
+```
+
+### Component Structure
+```c
+typedef struct {
+    char name[64];        // Component name
+    float x, y;           // Position coordinates
+    wmap_shape_t shape;   // Shape (NONE, X, SQUARE, TRIANGLE, CIRCLE)
+} wmap_component_t;
+```
+
+### Dependency Structure
+```c
+typedef struct {
+    char from[64];        // Source component name
+    char to[64];          // Target component name
+    int is_arrow;         // 1 for ->, 0 for --
+} wmap_dependency_t;
+```
+
+## Memory Limits
+
+| Entity Type | Maximum Count |
+|-------------|---------------|
+| Components | 1024 |
+| Dependencies | 2048 |
+| Notes | 256 |
+| Groups | 128 |
+| Inertias | 256 |
+| Evolutions | 256 |
+| Name Length | 64 characters |
+| Text Length | 256 characters |
+
+## Performance
+
+- **Parsing Speed**: 32,000+ parses/second
+- **Memory Usage**: Fixed allocation, no dynamic memory during parsing
+- **File Size Limit**: 10MB maximum for safety
+- **Input Validation**: Automatic bounds checking and malformed input handling
+
+## API Reference
+
+### Core Functions
+
+```c
+// Parse from string
+wmap_map_t* wmap_parse_string(const char* input);
+
+// Parse from file
+wmap_map_t* wmap_parse_file(const char* filename);
+
+// Free parsed map
+void wmap_map_free(wmap_map_t* map);
+
+// Validate input size and format
+int wmap_validate_input(const char* input, size_t max_size);
+```
+
+### Error Handling
+
+- Functions return `NULL` on failure
+- Input validation prevents buffer overflows
+- Malformed lines are skipped, parsing continues
+- File size limits prevent excessive memory usage
diff --git a/doc/example.wmap b/doc/example.wmap
new file mode 100644
index 0000000..a238ab1
--- /dev/null
+++ b/doc/example.wmap
@@ -0,0 +1,122 @@
+Anchor (40, 0)
+Tinker (4,30) [x]
+Tailor (7.03, 49.21) [Square]
+Soldier (28, 15) [Triangle]
+AMnchor (28.22, 45.27)
+Tonker (67.3, 4.4) [X]
+Tailor1 (1,1) [Square]
+Tailor2 (10,1) [Square]
+Tailor3 (1,10) [Square]
+Tailor4 (20,1) [Square]
+Tailor5 (1,20) [Square]
+Tailor7 (20,10) [Square]
+Tailor8 (9.36, 16.97) [Square]
+Tailor777(30,10) [Square]
+Tailor10 (18.77, 26.25) [Square]
+Tailor11 (10,10) [Square]
+Tailor12 (30,20)
+Tailor13 (31.10, 28.89)
+Tailor14 (13.44, 21.48) [Square]
+Tailor19 (45, 2) [triangle]
+B (50, 50)
+Hellele
+
+TailorX (20, 50) [Square]
+
+Hello World (90, 20) [x]
+
+Anchor -> Soldier… this is changing.
+Anchor -> A
+Masdlajksd -- Tailor13
+
+Mabanchorn -- Anchornalsdjalks
+
+A
+--B
+
+X (58.52, 27.07)
+
+Tailor11--Tailor12
+Tailor12--Tailor13
+Tailor777--Tailor8
+Tailor777--Tailor7
+Tailor777--Tailor6
+Tailor7-Tailor6
+
+Tinker -- Tailor
+Soldier -- Tinker
+
+[Evolution] Tinker +20
+[Inertia] Soldier
+
+[i] 15
+[ii] 35
+[iii] 80
+
+this is kind of ok … a little bit better to be honest. (69.76, 89.84)
+
+OK.
+
+This map so far is fst. asdasd asda
+
+Holy shit, this is still indeed fast. But everything flashes as I type! This is now happening so fast
+
+Hello my old friend.
+
+OK so this map should eventually start getting slow too!
+
+let’s see how long after.asd asda sda
+
+asda sdasdasd asdasdasdasdasdasd
+OK… Well we are typing. asd as asd as dasd a asdasda sdasd asd
+
+ asd asd asd asdasd asdasd
+Alright, the whole text is still fa asdlashing. Wow. This is pretty bad.
+aas dasd adsa sd a asd asd asdjlkasjd laksdjasd basldjas!!!
+
+we have deleted this (20, 40) [triangle]
+
+a(12, 12)
+Time to see if we get the same performance loss as withthis the other one. Well I will continue. Hello this is me. and i’m
+aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
+
+b(75,75)
+c(9, 90)
+
+a -- b
+b -- c
+
+d (45, 88)
+
+c -- d
+d -- a
+d -- b
+
+q (90, 60)
+b -- q
+q -- a
+q -- c
+
+[Evolution] c +20
+[Evolution] d +10
+[Evolution] a -20
+[Evolution] q +5
+
+m(50, 60)
+n (65, 65)
+o (45, 63)
+
+m -- o
+o -- n
+n -- m
+o -- c
+n -- q
+m -- d
+
+testasd asdas
+test2asdasa asdasd asd
+
+[Note] (5, 35) Notes also influence the placement of\n labels.
+
+[Group] Tailor2, Tailor7, Tailor11, Tailor12, Tailor10, Anchor, Tinker
+[Group] Tailor3, Tailor5, Tailor14pr
\ No newline at end of file
diff --git a/doc/wmap-spec.ebnf b/doc/wmap-spec.ebnf
new file mode 100644
index 0000000..6ad79c6
--- /dev/null
+++ b/doc/wmap-spec.ebnf
@@ -0,0 +1,52 @@
+(* wmap Language Specification *)
+
+(* Top-level structure *)
+program = { line } ;
+line = ( entity line_ending ) | ( ignored_line line_ending ) | line_ending ;
+
+entity = component | dependency | note | stage | group | inertia | evolution ;
+ignored_line = ? any sequence of tokens that doesn't match entity grammar ? ;
+
+(* Entities *)
+component = component_label position [ shape ] ;
+dependency = component_label dependency_type component_label ;
+note = case_insensitive("[Note]") position text ;
+stage = "[" stage_number "]" real_number ;
+group = case_insensitive("[Group]") component_label { "," component_label } ;
+inertia = case_insensitive("[Inertia]") component_label ;
+evolution = case_insensitive("[Evolution]") component_label sign real_number ;
+
+(* Component definitions *)
+position = "(" real_number "," real_number ")" ;
+shape = "[" shape_label "]" ;
+dependency_type = "--" | "->" ;
+sign = "+" | "-" ;
+
+(* Terminal symbols *)
+component_label = preserved_case( { character - ( "-" | "+" | "," | "[" | "]" | "(" | ")" | line_ending ) } ) ;
+text = preserved_case( { character - line_ending } ) ;
+real_number = [ digit ] { digit } [ "." { digit } ] | "." digit { digit } ;
+stage_number = case_insensitive( "i" | "ii" | "iii" | "iv" ) ;
+shape_label = case_insensitive( "x" | "square" | "triangle" | "circle" ) ;
+
+(* Lexical elements *)
+character = ? any Unicode character ? ;
+digit = "0" | "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" | "9" ;
+line_ending = lf | crlf | cr ;
+lf = ? U+000A (Line Feed) ? ;
+cr = ? U+000D (Carriage Return) ? ;
+crlf = cr lf ;
+
+(* Lexical rules *)
+case_insensitive(x) = ? case-insensitive match of x ? ;
+preserved_case(x) = ? case-insensitive match of x, preserving original case for display ? ;
+
+(* Notes *)
+(* - Keywords and shape labels are case-insensitive *)
+(* - Component labels are case-insensitive for matching but preserve original case *)
+(* - Text content preserves original case *)
+(* - Whitespace (except line endings) may appear between any tokens *)
+(* - Each line contains exactly one entity *)
+(* - Invalid lines should be ignored *)
+(* - Line endings support Unix (LF), Windows (CRLF), and classic Mac (CR) formats *)
+(* - CRLF is treated as a single line ending, not separate CR and LF *)
diff --git a/src/test.c b/src/test.c
new file mode 100644
index 0000000..858aa74
--- /dev/null
+++ b/src/test.c
@@ -0,0 +1,162 @@
+#include "wmap_parser.h"
+#include <time.h>
+
+void print_component(const wmap_component_t* comp) {
+    const char* shape_names[] = {"", "X", "Square", "Triangle", "Circle"};
+    printf("Component: %s (%.2f, %.2f)", comp->name, comp->x, comp->y);
+    if (comp->shape != WMAP_SHAPE_NONE) {
+        printf(" [%s]", shape_names[comp->shape]);
+    }
+    printf("\n");
+}
+
+void print_dependency(const wmap_dependency_t* dep) {
+    printf("Dependency: %s %s %s\n", dep->from, dep->is_arrow ? "->" : "--", dep->to);
+}
+
+void print_note(const wmap_note_t* note) {
+    printf("Note: (%.2f, %.2f) %s\n", note->x, note->y, note->text);
+}
+
+void print_stage(const wmap_stage_data_t* stage) {
+    const char* stage_names[] = {"", "I", "II", "III", "IV"};
+    printf("Stage: [%s] %.2f\n", stage_names[stage->stage], stage->value);
+}
+
+void print_group(const wmap_group_t* group) {
+    int i;
+    printf("Group: ");
+    for (i = 0; i < group->member_count; i++) {
+        printf("%s", group->members[i]);
+        if (i < group->member_count - 1) printf(", ");
+    }
+    printf("\n");
+}
+
+void print_inertia(const wmap_inertia_t* inertia) {
+    printf("Inertia: %s\n", inertia->name);
+}
+
+void print_evolution(const wmap_evolution_t* evolution) {
+    printf("Evolution: %s %+.2f\n", evolution->name, evolution->change);
+}
+
+void print_map_stats(const wmap_map_t* map) {
+    printf("\n=== Map Statistics ===\n");
+    printf("Components: %d\n", map->component_count);
+    printf("Dependencies: %d\n", map->dependency_count);
+    printf("Notes: %d\n", map->note_count);
+    printf("Stages: %d\n", map->stage_count);
+    printf("Groups: %d\n", map->group_count);
+    printf("Inertias: %d\n", map->inertia_count);
+    printf("Evolutions: %d\n", map->evolution_count);
+    printf("\n");
+}
+
+void print_map_contents(const wmap_map_t* map) {
+    int i;
+
+    printf("=== Components ===\n");
+    for (i = 0; i < map->component_count; i++) {
+        print_component(&map->components[i]);
+    }
+
+    printf("\n=== Dependencies ===\n");
+    for (i = 0; i < map->dependency_count; i++) {
+        print_dependency(&map->dependencies[i]);
+    }
+
+    printf("\n=== Notes ===\n");
+    for (i = 0; i < map->note_count; i++) {
+        print_note(&map->notes[i]);
+    }
+
+    printf("\n=== Stages ===\n");
+    for (i = 0; i < map->stage_count; i++) {
+        print_stage(&map->stages[i]);
+    }
+
+    printf("\n=== Groups ===\n");
+    for (i = 0; i < map->group_count; i++) {
+        print_group(&map->groups[i]);
+    }
+
+    printf("\n=== Inertias ===\n");
+    for (i = 0; i < map->inertia_count; i++) {
+        print_inertia(&map->inertias[i]);
+    }
+
+    printf("\n=== Evolutions ===\n");
+    for (i = 0; i < map->evolution_count; i++) {
+        print_evolution(&map->evolutions[i]);
+    }
+}
+
+int benchmark_parser(const char* filename, int iterations) {
+    clock_t start, end;
+    double total_time, avg_time;
+    int i;
+
+    printf("=== Benchmarking Parser ===\n");
+    printf("File: %s\n", filename);
+    printf("Iterations: %d\n", iterations);
+
+    start = clock();
+
+    for (i = 0; i < iterations; i++) {
+        wmap_map_t* map = wmap_parse_file(filename);
+        if (!map) {
+            printf("Error: Failed to parse file on iteration %d\n", i);
+            return 1;
+        }
+        wmap_map_free(map);
+    }
+
+    end = clock();
+    total_time = ((double)(end - start)) / CLOCKS_PER_SEC;
+    avg_time = total_time / iterations;
+
+    printf("Total time: %.4f seconds\n", total_time);
+    printf("Average time per parse: %.4f seconds\n", avg_time);
+    printf("Parses per second: %.2f\n", 1.0 / avg_time);
+
+    return 0;
+}
+
+int main(int argc, char* argv[]) {
+    const char* filename;
+    wmap_map_t* map;
+
+    if (argc < 2) {
+        printf("Usage: %s <wmap_file> [benchmark_iterations]\n", argv[0]);
+        return 1;
+    }
+
+    filename = argv[1];
+
+    printf("=== WMAP Parser Test ===\n");
+    printf("Parsing file: %s\n", filename);
+
+    map = wmap_parse_file(filename);
+    if (!map) {
+        printf("Error: Failed to parse file %s\n", filename);
+        return 1;
+    }
+
+    print_map_stats(map);
+
+    if (argc > 2 && strcmp(argv[2], "benchmark") == 0) {
+        int iterations = 1000;
+        if (argc > 3) {
+            iterations = atoi(argv[3]);
+        }
+        benchmark_parser(filename, iterations);
+    } else {
+        print_map_contents(map);
+    }
+
+    wmap_map_free(map);
+
+    printf("=== Test Complete ===\n");
+    return 0;
+}
diff --git a/src/wmap_parser.c b/src/wmap_parser.c
new file mode 100644
index 0000000..e0cf6d6
--- /dev/null
+++ b/src/wmap_parser.c
@@ -0,0 +1,687 @@
+#include "wmap_parser.h"
+
+static void wmap_lexer_init(wmap_lexer_t* lexer, const char* input) {
+    lexer->input = input;
+    lexer->pos = 0;
+    lexer->line = 1;
+    lexer->col = 1;
+    lexer->current_token = WMAP_TOKEN_EOF;
+    lexer->token_text[0] = '\0';
+    lexer->token_number = 0.0f;
+}
+
+static void wmap_lexer_skip_whitespace(wmap_lexer_t* lexer) {
+    while (lexer->input[lexer->pos] != '\0' &&
+           (lexer->input[lexer->pos] == ' ' || lexer->input[lexer->pos] == '\t')) {
+        lexer->pos++;
+        lexer->col++;
+    }
+}
+
+WMAP_68K_INLINE int wmap_lexer_is_identifier_char(char c) WMAP_68K_FAST_CALL {
+    return c != '-' && c != '+' && c != ',' && c != '[' && c != ']' &&
+           c != '(' && c != ')' && c != '\n' && c != '\r' && c != '\0' && c != ' ' && c != '\t';
+}
+
+static wmap_token_type_t wmap_lexer_next_token(wmap_lexer_t* lexer) {
+    char c;
+    int start, len, has_dot;
+
+    wmap_lexer_skip_whitespace(lexer);
+
+    if (lexer->input[lexer->pos] == '\0') {
+        return lexer->current_token = WMAP_TOKEN_EOF;
+    }
+
+    c = lexer->input[lexer->pos];
+
+    if (c == '\n') {
+        lexer->pos++;
+        lexer->line++;
+        lexer->col = 1;
+        return lexer->current_token = WMAP_TOKEN_NEWLINE;
+    }
+
+    if (c == '\r') {
+        lexer->pos++;
+        if (lexer->input[lexer->pos] == '\n') {
+            lexer->pos++;
+        }
+        lexer->line++;
+        lexer->col = 1;
+        return lexer->current_token = WMAP_TOKEN_NEWLINE;
+    }
+
+    if (c == '(') {
+        lexer->pos++;
+        lexer->col++;
+        return lexer->current_token = WMAP_TOKEN_LPAREN;
+    }
+
+    if (c == ')') {
+        lexer->pos++;
+        lexer->col++;
+        return lexer->current_token = WMAP_TOKEN_RPAREN;
+    }
+
+    if (c == '[') {
+        lexer->pos++;
+        lexer->col++;
+        return lexer->current_token = WMAP_TOKEN_LBRACKET;
+    }
+
+    if (c == ']') {
+        lexer->pos++;
+        lexer->col++;
+        return lexer->current_token = WMAP_TOKEN_RBRACKET;
+    }
+
+    if (c == ',') {
+        lexer->pos++;
+        lexer->col++;
+        return lexer->current_token = WMAP_TOKEN_COMMA;
+    }
+
+    if (c == '+') {
+        lexer->pos++;
+        lexer->col++;
+        return lexer->current_token = WMAP_TOKEN_PLUS;
+    }
+
+    if (c == '-') {
+        if (lexer->input[lexer->pos + 1] == '-') {
+            lexer->pos += 2;
+            lexer->col += 2;
+            return lexer->current_token = WMAP_TOKEN_DASH;
+        } else if (lexer->input[lexer->pos + 1] == '>') {
+            lexer->pos += 2;
+            lexer->col += 2;
+            return lexer->current_token = WMAP_TOKEN_ARROW;
+        } else {
+            lexer->pos++;
+            lexer->col++;
+            return lexer->current_token = WMAP_TOKEN_MINUS;
+        }
+    }
+
+    if (isdigit(c) || c == '.') {
+        start = lexer->pos;
+        has_dot = 0;
+
+        if (c == '.') {
+            has_dot = 1;
+            lexer->pos++;
+            lexer->col++;
+            if (!isdigit(lexer->input[lexer->pos])) {
+                return lexer->current_token = WMAP_TOKEN_ERROR;
+            }
+        }
+
+        while (isdigit(lexer->input[lexer->pos])) {
+            lexer->pos++;
+            lexer->col++;
+        }
+
+        if (!has_dot && lexer->input[lexer->pos] == '.') {
+            has_dot = 1;
+            lexer->pos++;
+            lexer->col++;
+            while (isdigit(lexer->input[lexer->pos])) {
+                lexer->pos++;
+                lexer->col++;
+            }
+        }
+
+        len = lexer->pos - start;
+        if (len >= WMAP_MAX_NAME_LEN) {
+            return lexer->current_token = WMAP_TOKEN_ERROR;
+        }
+
+        strncpy(lexer->token_text, lexer->input + start, len);
+        lexer->token_text[len] = '\0';
+        lexer->token_number = (float)atof(lexer->token_text);
+
+        return lexer->current_token = WMAP_TOKEN_NUMBER;
+    }
+
+    if (wmap_lexer_is_identifier_char(c)) {
+        start = lexer->pos;
+
+        while (lexer->input[lexer->pos] != '\0' &&
+               wmap_lexer_is_identifier_char(lexer->input[lexer->pos])) {
+            lexer->pos++;
+            lexer->col++;
+        }
+
+        len = lexer->pos - start;
+        if (len >= WMAP_MAX_NAME_LEN) {
+            len = WMAP_MAX_NAME_LEN - 1;
+        }
+
+        strncpy(lexer->token_text, lexer->input + start, len);
+        lexer->token_text[len] = '\0';
+
+        return lexer->current_token = WMAP_TOKEN_IDENTIFIER;
+    }
+
+    lexer->pos++;
+    lexer->col++;
+    return lexer->current_token = WMAP_TOKEN_ERROR;
+}
+
+WMAP_68K_INLINE int wmap_lexer_is_keyword(const char* text, const char* keyword) WMAP_68K_FAST_CALL {
+    int i = 0;
+    while (text[i] && keyword[i]) {
+        char tc = text[i];
+        char kc = keyword[i];
+        if (tc >= 'A' && tc <= 'Z') tc += 32;
+        if (kc >= 'A' && kc <= 'Z') kc += 32;
+        if (tc != kc) {
+            return 0;
+        }
+        i++;
+    }
+    return text[i] == keyword[i];
+}
+
+static wmap_shape_t wmap_parse_shape(const char* text) {
+    if (wmap_lexer_is_keyword(text, "x")) return WMAP_SHAPE_X;
+    if (wmap_lexer_is_keyword(text, "square")) return WMAP_SHAPE_SQUARE;
+    if (wmap_lexer_is_keyword(text, "triangle")) return WMAP_SHAPE_TRIANGLE;
+    if (wmap_lexer_is_keyword(text, "circle")) return WMAP_SHAPE_CIRCLE;
+    return WMAP_SHAPE_NONE;
+}
+
+static wmap_stage_t wmap_parse_stage(const char* text) {
+    if (wmap_lexer_is_keyword(text, "i")) return WMAP_STAGE_I;
+    if (wmap_lexer_is_keyword(text, "ii")) return WMAP_STAGE_II;
+    if (wmap_lexer_is_keyword(text, "iii")) return WMAP_STAGE_III;
+    if (wmap_lexer_is_keyword(text, "iv")) return WMAP_STAGE_IV;
+    return 0;
+}
+
+static wmap_parser_t* wmap_parser_create(const char* input) {
+    wmap_parser_t* parser = (wmap_parser_t*)malloc(sizeof(wmap_parser_t));
+    if (!parser) return NULL;
+
+    parser->map = (wmap_map_t*)malloc(sizeof(wmap_map_t));
+    if (!parser->map) {
+        free(parser);
+        return NULL;
+    }
+
+    memset(parser->map, 0, sizeof(wmap_map_t));
+    wmap_lexer_init(&parser->lexer, input);
+    parser->error_count = 0;
+
+    wmap_lexer_next_token(&parser->lexer);
+
+    return parser;
+}
+
+static void wmap_parser_destroy(wmap_parser_t* parser) {
+    if (parser) {
+        if (parser->map) {
+            free(parser->map);
+        }
+        free(parser);
+    }
+}
+
+static void wmap_parser_skip_line(wmap_parser_t* parser) {
+    while (parser->lexer.current_token != WMAP_TOKEN_NEWLINE &&
+           parser->lexer.current_token != WMAP_TOKEN_EOF) {
+        wmap_lexer_next_token(&parser->lexer);
+    }
+    if (parser->lexer.current_token == WMAP_TOKEN_NEWLINE) {
+        wmap_lexer_next_token(&parser->lexer);
+    }
+}
+
+static int wmap_parser_parse_position(wmap_parser_t* parser, float* x, float* y) {
+    if (parser->lexer.current_token != WMAP_TOKEN_LPAREN) {
+        return 0;
+    }
+    wmap_lexer_next_token(&parser->lexer);
+
+    if (parser->lexer.current_token != WMAP_TOKEN_NUMBER) {
+        return 0;
+    }
+    *x = parser->lexer.token_number;
+    wmap_lexer_next_token(&parser->lexer);
+
+    if (parser->lexer.current_token != WMAP_TOKEN_COMMA) {
+        return 0;
+    }
+    wmap_lexer_next_token(&parser->lexer);
+
+    if (parser->lexer.current_token != WMAP_TOKEN_NUMBER) {
+        return 0;
+    }
+    *y = parser->lexer.token_number;
+    wmap_lexer_next_token(&parser->lexer);
+
+    if (parser->lexer.current_token != WMAP_TOKEN_RPAREN) {
+        return 0;
+    }
+    wmap_lexer_next_token(&parser->lexer);
+
+    return 1;
+}
+
+static int wmap_parser_parse_component(wmap_parser_t* parser) {
+    wmap_component_t* comp;
+
+    if (parser->map->component_count >= WMAP_MAX_COMPONENTS) {
+        return 0;
+    }
+
+    comp = &parser->map->components[parser->map->component_count];
+
+    if (parser->lexer.current_token != WMAP_TOKEN_IDENTIFIER) {
+        return 0;
+    }
+    strncpy(comp->name, parser->lexer.token_text, WMAP_MAX_NAME_LEN - 1);
+    comp->name[WMAP_MAX_NAME_LEN - 1] = '\0';
+    wmap_lexer_next_token(&parser->lexer);
+
+    if (!wmap_parser_parse_position(parser, &comp->x, &comp->y)) {
+        return 0;
+    }
+
+    comp->shape = WMAP_SHAPE_NONE;
+    if (parser->lexer.current_token == WMAP_TOKEN_LBRACKET) {
+        wmap_lexer_next_token(&parser->lexer);
+        if (parser->lexer.current_token == WMAP_TOKEN_IDENTIFIER) {
+            comp->shape = wmap_parse_shape(parser->lexer.token_text);
+            wmap_lexer_next_token(&parser->lexer);
+        }
+        if (parser->lexer.current_token == WMAP_TOKEN_RBRACKET) {
+            wmap_lexer_next_token(&parser->lexer);
+        }
+    }
+
+    parser->map->component_count++;
+    return 1;
+}
+
+static int wmap_parser_parse_dependency(wmap_parser_t* parser) {
+    wmap_dependency_t* dep;
+
+    if (parser->map->dependency_count >= WMAP_MAX_DEPENDENCIES) {
+        return 0;
+    }
+
+    dep = &parser->map->dependencies[parser->map->dependency_count];
+
+    if (parser->lexer.current_token != WMAP_TOKEN_IDENTIFIER) {
+        return 0;
+    }
+    strncpy(dep->from, parser->lexer.token_text, WMAP_MAX_NAME_LEN - 1);
+    dep->from[WMAP_MAX_NAME_LEN - 1] = '\0';
+    wmap_lexer_next_token(&parser->lexer);
+
+    if (parser->lexer.current_token == WMAP_TOKEN_ARROW) {
+        dep->is_arrow = 1;
+        wmap_lexer_next_token(&parser->lexer);
+    } else if (parser->lexer.current_token == WMAP_TOKEN_DASH) {
+        dep->is_arrow = 0;
+        wmap_lexer_next_token(&parser->lexer);
+    } else {
+        return 0;
+    }
+
+    if (parser->lexer.current_token != WMAP_TOKEN_IDENTIFIER) {
+        return 0;
+    }
+    strncpy(dep->to, parser->lexer.token_text, WMAP_MAX_NAME_LEN - 1);
+    dep->to[WMAP_MAX_NAME_LEN - 1] = '\0';
+    wmap_lexer_next_token(&parser->lexer);
+
+    parser->map->dependency_count++;
+    return 1;
+}
+
+static int wmap_parser_parse_note(wmap_parser_t* parser) {
+    wmap_note_t* note;
+    int text_pos;
+
+    if (parser->map->note_count >= WMAP_MAX_NOTES) {
+        return 0;
+    }
+
+    note = &parser->map->notes[parser->map->note_count];
+
+    if (!wmap_parser_parse_position(parser, &note->x, &note->y)) {
+        return 0;
+    }
+
+    text_pos = 0;
+    while (parser->lexer.current_token != WMAP_TOKEN_NEWLINE &&
+           parser->lexer.current_token != WMAP_TOKEN_EOF &&
+           text_pos < WMAP_MAX_TEXT_LEN - 1) {
+
+        if (parser->lexer.current_token == WMAP_TOKEN_IDENTIFIER) {
+            int len = strlen(parser->lexer.token_text);
+            if (text_pos + len + 1 < WMAP_MAX_TEXT_LEN - 1) {
+                strncpy(note->text + text_pos, parser->lexer.token_text, len);
+                text_pos += len;
+                note->text[text_pos++] = ' ';
+                note->text[text_pos] = '\0';
+            }
+        }
+        wmap_lexer_next_token(&parser->lexer);
+    }
+
+    if (text_pos > 0) {
+        note->text[text_pos - 1] = '\0';
+    } else {
+        note->text[0] = '\0';
+    }
+
+    parser->map->note_count++;
+    return 1;
+}
+
+static int wmap_parser_parse_stage(wmap_parser_t* parser) {
+    wmap_stage_data_t* stage;
+
+    if (parser->map->stage_count >= WMAP_MAX_STAGES) {
+        return 0;
+    }
+
+    stage = &parser->map->stages[parser->map->stage_count];
+
+    if (parser->lexer.current_token != WMAP_TOKEN_IDENTIFIER) {
+        return 0;
+    }
+
+    stage->stage = wmap_parse_stage(parser->lexer.token_text);
+    if (stage->stage == 0) {
+        return 0;
+    }
+    wmap_lexer_next_token(&parser->lexer);
+
+    if (parser->lexer.current_token != WMAP_TOKEN_RBRACKET) {
+        return 0;
+    }
+    wmap_lexer_next_token(&parser->lexer);
+
+    if (parser->lexer.current_token != WMAP_TOKEN_NUMBER) {
+        return 0;
+    }
+    stage->value = parser->lexer.token_number;
+    wmap_lexer_next_token(&parser->lexer);
+
+    parser->map->stage_count++;
+    return 1;
+}
+
+static int wmap_parser_parse_group(wmap_parser_t* parser) {
+    wmap_group_t* group;
+
+    if (parser->map->group_count >= WMAP_MAX_GROUPS) {
+        return 0;
+    }
+
+    group = &parser->map->groups[parser->map->group_count];
+    group->member_count = 0;
+
+    while (parser->lexer.current_token == WMAP_TOKEN_IDENTIFIER &&
+           group->member_count < WMAP_MAX_GROUP_MEMBERS) {
+
+        strncpy(group->members[group->member_count], parser->lexer.token_text, WMAP_MAX_NAME_LEN - 1);
+        group->members[group->member_count][WMAP_MAX_NAME_LEN - 1] = '\0';
+        group->member_count++;
+        wmap_lexer_next_token(&parser->lexer);
+
+        if (parser->lexer.current_token == WMAP_TOKEN_COMMA) {
+            wmap_lexer_next_token(&parser->lexer);
+        } else {
+            break;
+        }
+    }
+
+    if (group->member_count > 0) {
+        parser->map->group_count++;
+        return 1;
+    }
+
+    return 0;
+}
+
+static int wmap_parser_parse_inertia(wmap_parser_t* parser) {
+    wmap_inertia_t* inertia;
+
+    if (parser->map->inertia_count >= WMAP_MAX_INERTIAS) {
+        return 0;
+    }
+
+    inertia = &parser->map->inertias[parser->map->inertia_count];
+
+    if (parser->lexer.current_token != WMAP_TOKEN_IDENTIFIER) {
+        return 0;
+    }
+    strncpy(inertia->name, parser->lexer.token_text, WMAP_MAX_NAME_LEN - 1);
+    inertia->name[WMAP_MAX_NAME_LEN - 1] = '\0';
+    wmap_lexer_next_token(&parser->lexer);
+
+    parser->map->inertia_count++;
+    return 1;
+}
+
+static int wmap_parser_parse_evolution(wmap_parser_t* parser) {
+    wmap_evolution_t* evolution;
+    int sign;
+
+    if (parser->map->evolution_count >= WMAP_MAX_EVOLUTIONS) {
+        return 0;
+    }
+
+    evolution = &parser->map->evolutions[parser->map->evolution_count];
+
+    if (parser->lexer.current_token != WMAP_TOKEN_IDENTIFIER) {
+        return 0;
+    }
+    strncpy(evolution->name, parser->lexer.token_text, WMAP_MAX_NAME_LEN - 1);
+    evolution->name[WMAP_MAX_NAME_LEN - 1] = '\0';
+    wmap_lexer_next_token(&parser->lexer);
+
+    sign = 1;
+    if (parser->lexer.current_token == WMAP_TOKEN_PLUS) {
+        sign = 1;
+        wmap_lexer_next_token(&parser->lexer);
+    } else if (parser->lexer.current_token == WMAP_TOKEN_MINUS) {
+        sign = -1;
+        wmap_lexer_next_token(&parser->lexer);
+    }
+
+    if (parser->lexer.current_token != WMAP_TOKEN_NUMBER) {
+        return 0;
+    }
+    evolution->change = sign * parser->lexer.token_number;
+    wmap_lexer_next_token(&parser->lexer);
+
+    parser->map->evolution_count++;
+    return 1;
+}
+
+static int wmap_parser_parse(wmap_parser_t* parser) {
+    while (parser->lexer.current_token != WMAP_TOKEN_EOF) {
+        if (parser->lexer.current_token == WMAP_TOKEN_NEWLINE) {
+            wmap_lexer_next_token(&parser->lexer);
+            continue;
+        }
+
+        if (parser->lexer.current_token == WMAP_TOKEN_LBRACKET) {
+            wmap_lexer_next_token(&parser->lexer);
+
+            if (parser->lexer.current_token == WMAP_TOKEN_IDENTIFIER) {
+                if (wmap_lexer_is_keyword(parser->lexer.token_text, "note")) {
+                    wmap_lexer_next_token(&parser->lexer);
+                    if (parser->lexer.current_token == WMAP_TOKEN_RBRACKET) {
+                        wmap_lexer_next_token(&parser->lexer);
+                        if (!wmap_parser_parse_note(parser)) {
+                            parser->error_count++;
+                            wmap_parser_skip_line(parser);
+                        }
+                    } else {
+                        parser->error_count++;
+                        wmap_parser_skip_line(parser);
+                    }
+                } else if (wmap_lexer_is_keyword(parser->lexer.token_text, "group")) {
+                    wmap_lexer_next_token(&parser->lexer);
+                    if (parser->lexer.current_token == WMAP_TOKEN_RBRACKET) {
+                        wmap_lexer_next_token(&parser->lexer);
+                        if (!wmap_parser_parse_group(parser)) {
+                            parser->error_count++;
+                            wmap_parser_skip_line(parser);
+                        }
+                    } else {
+                        parser->error_count++;
+                        wmap_parser_skip_line(parser);
+                    }
+                } else if (wmap_lexer_is_keyword(parser->lexer.token_text, "inertia")) {
+                    wmap_lexer_next_token(&parser->lexer);
+                    if (parser->lexer.current_token == WMAP_TOKEN_RBRACKET) {
+                        wmap_lexer_next_token(&parser->lexer);
+                        if (!wmap_parser_parse_inertia(parser)) {
+                            parser->error_count++;
+                            wmap_parser_skip_line(parser);
+                        }
+                    } else {
+                        parser->error_count++;
+                        wmap_parser_skip_line(parser);
+                    }
+                } else if (wmap_lexer_is_keyword(parser->lexer.token_text, "evolution")) {
+                    wmap_lexer_next_token(&parser->lexer);
+                    if (parser->lexer.current_token == WMAP_TOKEN_RBRACKET) {
+                        wmap_lexer_next_token(&parser->lexer);
+                        if (!wmap_parser_parse_evolution(parser)) {
+                            parser->error_count++;
+                            wmap_parser_skip_line(parser);
+                        }
+                    } else {
+                        parser->error_count++;
+                        wmap_parser_skip_line(parser);
+                    }
+                } else {
+                    if (!wmap_parser_parse_stage(parser)) {
+                        parser->error_count++;
+                        wmap_parser_skip_line(parser);
+                    }
+                }
+            } else {
+                parser->error_count++;
+                wmap_parser_skip_line(parser);
+            }
+        } else if (parser->lexer.current_token == WMAP_TOKEN_IDENTIFIER) {
+            wmap_lexer_t lookahead = parser->lexer;
+            int is_dependency = 0;
+
+            wmap_lexer_next_token(&lookahead);
+            while (lookahead.current_token != WMAP_TOKEN_NEWLINE &&
+                   lookahead.current_token != WMAP_TOKEN_EOF) {
+                if (lookahead.current_token == WMAP_TOKEN_ARROW ||
+                    lookahead.current_token == WMAP_TOKEN_DASH) {
+                    is_dependency = 1;
+                    break;
+                }
+                wmap_lexer_next_token(&lookahead);
+            }
+
+            if (is_dependency) {
+                if (!wmap_parser_parse_dependency(parser)) {
+                    parser->error_count++;
+                    wmap_parser_skip_line(parser);
+                }
+            } else {
+                if (!wmap_parser_parse_component(parser)) {
+                    parser->error_count++;
+                    wmap_parser_skip_line(parser);
+                }
+            }
+        } else {
+            parser->error_count++;
+            wmap_parser_skip_line(parser);
+        }
+    }
+
+    return parser->error_count == 0;
+}
+
+wmap_map_t* wmap_parse_string(const char* input) {
+    wmap_parser_t* parser;
+    wmap_map_t* result;
+
+    if (!input) return NULL;
+
+    if (!wmap_validate_input(input, 1024 * 1024)) {
+        return NULL;
+    }
+
+    parser = wmap_parser_create(input);
+    if (!parser) return NULL;
+
+    wmap_parser_parse(parser);
+
+    result = parser->map;
+    parser->map = NULL;
+    wmap_parser_destroy(parser);
+
+    return result;
+}
+
+wmap_map_t* wmap_parse_file(const char* filename) {
+    FILE* file;
+    long size;
+    char* buffer;
+    wmap_map_t* result;
+
+    file = fopen(filename, "r");
+    if (!file) return NULL;
+
+    fseek(file, 0, SEEK_END);
+    size = ftell(file);
+    fseek(file, 0, SEEK_SET);
+
+    if (size < 0 || size > 10 * 1024 * 1024) {
+        fclose(file);
+        return NULL;
+    }
+
+    buffer = (char*)malloc(size + 1);
+    if (!buffer) {
+        fclose(file);
+        return NULL;
+    }
+
+    fread(buffer, 1, size, file);
+    buffer[size] = '\0';
+    fclose(file);
+
+    result = wmap_parse_string(buffer);
+    free(buffer);
+
+    return result;
+}
+
+void wmap_map_free(wmap_map_t* map) {
+    if (map) {
+        free(map);
+    }
+}
+
+int wmap_validate_input(const char* input, size_t max_size) {
+    size_t len;
+    if (!input) {
+        return 0;
+    }
+
+    len = strlen(input);
+    if (len > max_size) {
+        return 0;
+    }
+
+    return 1;
+}
diff --git a/src/wmap_parser.h b/src/wmap_parser.h
new file mode 100644
index 0000000..fa4371b
--- /dev/null
+++ b/src/wmap_parser.h
@@ -0,0 +1,164 @@
+#ifndef WMAP_PARSER_H
+#define WMAP_PARSER_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+
+#define WMAP_MAX_NAME_LEN 64
+#define WMAP_MAX_TEXT_LEN 256
+#define WMAP_MAX_COMPONENTS 1024
+#define WMAP_MAX_DEPENDENCIES 2048
+#define WMAP_MAX_NOTES 256
+#define WMAP_MAX_STAGES 4
+#define WMAP_MAX_GROUPS 128
+#define WMAP_MAX_GROUP_MEMBERS 32
+#define WMAP_MAX_INERTIAS 256
+#define WMAP_MAX_EVOLUTIONS 256
+
+#ifdef __mc68000__
+#define WMAP_68K_INLINE static
+#define WMAP_68K_FAST_CALL __attribute__((regparm(2)))
+#else
+#define WMAP_68K_INLINE static
+#define WMAP_68K_FAST_CALL
+#endif
+
+/* Public Types */
+
+typedef enum {
+    WMAP_SHAPE_NONE = 0,
+    WMAP_SHAPE_X,
+    WMAP_SHAPE_SQUARE,
+    WMAP_SHAPE_TRIANGLE,
+    WMAP_SHAPE_CIRCLE
+} wmap_shape_t;
+
+typedef enum {
+    WMAP_STAGE_I = 1,
+    WMAP_STAGE_II = 2,
+    WMAP_STAGE_III = 3,
+    WMAP_STAGE_IV = 4
+} wmap_stage_t;
+
+typedef struct {
+    char name[WMAP_MAX_NAME_LEN];
+    float x, y;
+    wmap_shape_t shape;
+} wmap_component_t;
+
+typedef struct {
+    char from[WMAP_MAX_NAME_LEN];
+    char to[WMAP_MAX_NAME_LEN];
+    int is_arrow;
+} wmap_dependency_t;
+
+typedef struct {
+    float x, y;
+    char text[WMAP_MAX_TEXT_LEN];
+} wmap_note_t;
+
+typedef struct {
+    wmap_stage_t stage;
+    float value;
+} wmap_stage_data_t;
+
+typedef struct {
+    char members[WMAP_MAX_GROUP_MEMBERS][WMAP_MAX_NAME_LEN];
+    int member_count;
+} wmap_group_t;
+
+typedef struct {
+    char name[WMAP_MAX_NAME_LEN];
+} wmap_inertia_t;
+
+typedef struct {
+    char name[WMAP_MAX_NAME_LEN];
+    float change;
+} wmap_evolution_t;
+
+typedef struct {
+    wmap_component_t components[WMAP_MAX_COMPONENTS];
+    wmap_dependency_t dependencies[WMAP_MAX_DEPENDENCIES];
+    wmap_note_t notes[WMAP_MAX_NOTES];
+    wmap_stage_data_t stages[WMAP_MAX_STAGES];
+    wmap_group_t groups[WMAP_MAX_GROUPS];
+    wmap_inertia_t inertias[WMAP_MAX_INERTIAS];
+    wmap_evolution_t evolutions[WMAP_MAX_EVOLUTIONS];
+
+    int component_count;
+    int dependency_count;
+    int note_count;
+    int stage_count;
+    int group_count;
+    int inertia_count;
+    int evolution_count;
+} wmap_map_t;
+
+/* Internal Types (needed for implementation) */
+
+typedef enum {
+    WMAP_TOKEN_EOF = 0,
+    WMAP_TOKEN_IDENTIFIER,
+    WMAP_TOKEN_NUMBER,
+    WMAP_TOKEN_LPAREN,
+    WMAP_TOKEN_RPAREN,
+    WMAP_TOKEN_LBRACKET,
+    WMAP_TOKEN_RBRACKET,
+    WMAP_TOKEN_COMMA,
+    WMAP_TOKEN_ARROW,
+    WMAP_TOKEN_DASH,
+    WMAP_TOKEN_PLUS,
+    WMAP_TOKEN_MINUS,
+    WMAP_TOKEN_NEWLINE,
+    WMAP_TOKEN_ERROR
+} wmap_token_type_t;
+
+typedef struct {
+    const char* input;
+    int pos;
+    int line;
+    int col;
+    wmap_token_type_t current_token;
+    char token_text[WMAP_MAX_NAME_LEN];
+    float token_number;
+} wmap_lexer_t;
+
+typedef struct {
+    wmap_lexer_t lexer;
+    wmap_map_t* map;
+    int error_count;
+} wmap_parser_t;
+
+/* Public API */
+
+/**
+ * Parse WMAP content from a string
+ * @param input The WMAP content as a null-terminated string
+ * @return Pointer to parsed map structure, or NULL on failure
+ */
+wmap_map_t* wmap_parse_string(const char* input);
+
+/**
+ * Parse WMAP content from a file
+ * @param filename Path to the WMAP file
+ * @return Pointer to parsed map structure, or NULL on failure
+ */
+wmap_map_t* wmap_parse_file(const char* filename);
+
+/**
+ * Free memory allocated for a parsed map
+ * @param map Pointer to the map structure to free
+ */
+void wmap_map_free(wmap_map_t* map);
+
+/**
+ * Validate input size and format before parsing
+ * @param input The input string to validate
+ * @param max_size Maximum allowed size in bytes
+ * @return 1 if valid, 0 if invalid
+ */
+int wmap_validate_input(const char* input, size_t max_size);
+
+#endif