kesterel2lustre

compile Kernel Esterel to Lustre
git clone https://a3nm.net/git/kesterel2lustre/
Log | Files | Refs | README
commit d54eac8b9f541c421c3e49724d5fead1a2480cea
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Fri, 16 Dec 2011 01:51:35 +0100

Initial commit (school project).

Diffstat:

COPYING | 674+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++


Makefile | 8++++++++


README | 165+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++


checker.hs | 17+++++++++++++++++


compile.hs | 348+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++


esterel.hs | 43+++++++++++++++++++++++++++++++++++++++++++


label.hs | 45+++++++++++++++++++++++++++++++++++++++++++++


lustre.hs | 31+++++++++++++++++++++++++++++++


main.hs | 34++++++++++++++++++++++++++++++++++


parse.hs | 129+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++


produce.hs | 48++++++++++++++++++++++++++++++++++++++++++++++++


rungolden.sh | 81+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++


runtest.sh | 54++++++++++++++++++++++++++++++++++++++++++++++++++++++


scope.hs | 51+++++++++++++++++++++++++++++++++++++++++++++++++++


test/alwayssuspend.in | 21+++++++++++++++++++++


test/alwayssuspend.strl | 8++++++++


test/asuspend.in | 21+++++++++++++++++++++


test/asuspend.strl | 6++++++


test/at0.in | 27+++++++++++++++++++++++++++


test/at0.strl | 5+++++


test/at1.in | 27+++++++++++++++++++++++++++


test/at1.strl | 6++++++


test/at2.in | 27+++++++++++++++++++++++++++


test/at2.strl | 7+++++++


test/booleanf.in | 4++++


test/booleanf.strl | 20++++++++++++++++++++


test/communication.in | 4++++


test/communication.strl | 8++++++++


test/communication2.in | 4++++


test/communication2.strl | 6++++++


test/communication3.in | 4++++


test/communication3.strl | 8++++++++


test/id.in | 8++++++++


test/id.strl | 5+++++


test/id2.in | 8++++++++


test/id2.strl | 8++++++++


test/inputsuspend.in | 29+++++++++++++++++++++++++++++


test/inputsuspend.strl | 8++++++++


test/inputsuspend2.in | 29+++++++++++++++++++++++++++++


test/inputsuspend2.strl | 8++++++++


test/inputsuspend3.in | 29+++++++++++++++++++++++++++++


test/inputsuspend3.strl | 8++++++++


test/inputsuspend4.in | 29+++++++++++++++++++++++++++++


test/inputsuspend4.strl | 8++++++++


test/inputsuspend5.in | 4++++


test/inputsuspend5.strl | 7+++++++


test/isolation.in | 4++++


test/isolation.strl | 5+++++


test/logical.in | 8++++++++


test/logical.strl | 13+++++++++++++


test/looploop.in | 30++++++++++++++++++++++++++++++


test/looploop.strl | 7+++++++


test/looppause.in | 27+++++++++++++++++++++++++++


test/looppause.strl | 5+++++


test/multipar.in | 8++++++++


test/multipar.strl | 14++++++++++++++


test/multiple.in | 2++


test/multiple.strl | 6++++++


test/myabort.in | 29+++++++++++++++++++++++++++++


test/myabort.strl | 15+++++++++++++++


test/myabort2.in | 3+++


test/myabort2.strl | 10++++++++++


test/nestedsignal.in | 4++++


test/nestedsignal.strl | 9+++++++++


test/nestedsuspend.in | 21+++++++++++++++++++++


test/nestedsuspend.strl | 11+++++++++++


test/nothing11.in | 27+++++++++++++++++++++++++++


test/nothing11.strl | 5+++++


test/nothing23.in | 4++++


test/nothing23.strl | 5+++++


test/oneofthree.in | 27+++++++++++++++++++++++++++


test/oneofthree.strl | 7+++++++


test/oneoftwo.in | 27+++++++++++++++++++++++++++


test/oneoftwo.strl | 9+++++++++


test/order.in | 21+++++++++++++++++++++


test/order.strl | 5+++++


test/orinputsuspend.in | 21+++++++++++++++++++++


test/orinputsuspend.strl | 9+++++++++


test/othertraps.in | 8++++++++


test/othertraps.strl | 8++++++++


test/parallel1.in | 4++++


test/parallel1.strl | 5+++++


test/parallel2.in | 4++++


test/parallel2.strl | 5+++++


test/parallelpause.in | 8++++++++


test/parallelpause.strl | 8++++++++


test/priority.in | 8++++++++


test/priority.strl | 7+++++++


test/signalscope.in | 4++++


test/signalscope.strl | 5+++++


test/simplesuspend.in | 21+++++++++++++++++++++


test/simplesuspend.strl | 8++++++++


test/simplesuspend2.in | 21+++++++++++++++++++++


test/simplesuspend2.strl | 8++++++++


test/suspendnothing.in | 10++++++++++


test/suspendnothing.strl | 5+++++


test/traps.in | 8++++++++


test/traps.strl | 14++++++++++++++


test/trivialsuspend.in | 21+++++++++++++++++++++


test/trivialsuspend.strl | 5+++++


testall.sh | 39+++++++++++++++++++++++++++++++++++++++


101 files changed, 2761 insertions(+), 0 deletions(-)

diff --git a/COPYING b/COPYING
@@ -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>.
diff --git a/Makefile b/Makefile
@@ -0,0 +1,8 @@
+SOURCE=esterel.hs lustre.hs produce.hs main.hs checker.hs parse.hs scope.hs label.hs compile.hs
+
+all: $(SOURCE)
+	ghc -W -o kesterel2lustre --make $(SOURCE)
+
+clean:	
+	rm -f *.o *.hi project
+
diff --git a/README b/README
@@ -0,0 +1,165 @@
+kesterel2lustre -- compile Kernel Esterel to Lustre
+Copyright (C) 2011 by Antoine Amarilli
+
+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, version 3.
+
+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 (see file "COPYING").  If not, see <http://www.gnu.org/licenses/>.
+
+
+
+== 0. Description ==
+
+kesterel2lustre FILE parses the Kernel Esterel file FILE, compiles it to the
+Lustre language and displays the result on standard output.
+
+Kernel Esterel is the subset of Esterel defined in [Ber99] p. 21 (quoted in
+[Wik11]). It is complete, in the sense that other Esterel constructs can be
+expressed with it. It is defined as follows:
+
+FILE ::= module NAME: input SIGS; output SIGS; EXPR end module
+SIGS ::= SIG | SIG, SIGS
+EXPR ::=   nothing
+         | pause
+         | EXPR; EXPR
+         | EXPR || EXPR
+         | loop EXPR end
+         | signal SIG in EXPR end
+         | emit SIG
+         | present SIG then EXPR else EXPR end
+         | suspend EXPR when SIG
+         | trap TRAP in EXPR end
+         | exit TRAP
+
+The abort construct is not supported because it can be implemented from those
+base constructs (see [Wik11], provided as test case test/myabort.strl).
+
+
+== 1. Dependencies ==
+
+kesterel2lustre requires a working Haskell installation along with the Parsec
+monadic parser combinator library (package libghc-parsec3-dev on Debian
+systems). The automated testing suite requires working Esterel and Lustre
+installations (see section 4).
+
+To compile kesterel2lustre, run:
+
+  make
+
+
+== 2. Structure ==
+
+- main.hs: Main program.
+  The main program reads the file and calls each of the subsequent steps in
+  turn.
+- esterel.hs: Esterel.
+  The Esterel AST.
+- lustre.hs: Lustre.
+  The Lustre AST.
+- parse.hs: Parser.
+  The parser (using Parsec) parses the input file to produce the Esterel AST (or
+  an error). 
+- checker.hs: Instantaneous dependencies.
+  The checker is called by the parser to detect loops with instantaneous paths.
+- scope.hs: Compute input and output signals and traps.
+  The scope module recursively computes which signals can be emitted or read by
+  a subexpression and produces an AST tagged with this information.
+- label.hs: Compute unique node identifiers.
+  The label module recursively assigns a unique identifier to each AST node and
+  produces an AST tagged with this information.
+- compile.hs: Perform the compilation.
+  The compile module produces the Lustre AST from the Esterel AST.
+- produce.hs: Lustre code production.
+  The produce module renders the Lustre AST to a string.
+
+
+== 3. Limitations ==
+
+- The program does not check that output signals can be raised and that input
+  signals are read and are not raised.
+- The program requires exactly one "input" declaration and exactly one "output"
+  declaration; furthermore, these declarations cannot be empty.
+- The program does not require signals to be declared with a Signal construct.
+- Signals and Traps live in the same namespace and no check is performed to
+  ensure that one isn't used in place of the other. Undefined behavior will
+  result if both are mixed.
+- The compile.hs file is ugly and messy.
+- There is no support for signal S1, ..., Sn in ... end. To achieve this, use n
+  nested signal blocks.
+- present clauses must have a then branch and an else branch.
+- Instantaneous loops are detected, but there is no detection of cyclic
+  constructs like present A then emit A else nothing end. Compilation of such
+  programs will yield a Lustre program with causality loops.
+
+
+== 4. Testing ==
+
+kesterel2lustre comes with an automated testing suite to compare the behavior
+of the Esterel code (tested with the [Est11] distribution) and the behavior of
+the Lustre code produced by kesterel2lustre (tested with the [Lus11]
+distribution).
+
+The tests are the .strl files in the test/ directory, which will be run on the
+corresponding .in input files. Because of technical limitations, the test files
+should declare their input and output signals in alphabetical order. The test
+commands assume that a working Esterel and Lustre environment is available and
+properly set up. Some test cases were taken from examples in [Ber99].
+
+To run file test/at0.strl on input test/at0.in using the Esterel distribution,
+run:
+  
+  ./rungolden.sh at0
+
+To run it using the kesterel2lustre compilation and Lustre distribution, run:
+
+  ./runtest.sh at0
+
+To run all tests and compare the output of the two evaluation mechanisms, run:
+
+  ./testall.sh
+
+
+== 5. Translation mechanism ==
+
+Each AST node is compiled to a Lustre node. All nodes have a control, suspend
+and reset input wire, and a control output wire. They also have input wires
+corresponding to the signals and traps that descendents of the AST are reading,
+and output wires for those that are produced. for those that are produced.
+
+In addition, a root node is produced to initialize the control and suspend
+wires.
+
+The suspend wire is only used for the suspend construct. It is initialized to
+false in the root node, transmitted from each node to its descendents, and
+set to interesting stuff at the suspend nodes. Each node has two local variables
+to (1) store the information that the node has been suspended and (2) compute
+the real input control from this information.
+
+The translation of nothing, pause, emit, ';', present and loop is performed as
+in [Pou08]. The translation of '||' is performed as in [Pou08] with a slight
+change to allow signals from the two child nodes of the '||' to be propagated to
+their siblings.
+
+The translation of exit is to see the trap as a signal and emit it without
+relinquishing control. The translation of trap is to yield control when the trap
+signal is emitted, without propagating it to father nodes, and set the reset
+wire of the sub nodes to disable input control everywhere.
+
+The translation of signal is to propagate all information except the signal that
+was declared as local.
+
+
+== 6. Sources ==
+
+[Ber99] http://rw4.cs.uni-sb.de/teaching/esd07/papers/constructiveness3.ps
+[Pou08] http://www.di.ens.fr/~pouzet/cours/mpri/MPRI08SolExamMP.pdf
+[Est11] http://www.di.ens.fr/~pouzet/cours/mpri/esterelv5_92.linux.tar
+[Lus11] http://www-verimag.imag.fr/~raymond/m2p/distrib/linux64/index.html
+[Wik11] https://en.wikipedia.org/wiki/Esterel
+
diff --git a/checker.hs b/checker.hs
@@ -0,0 +1,17 @@
+module Checker where
+
+import Esterel
+
+instantaneous (Annotated p _) = case p of
+    Present _ e1 e2 -> instantaneous e1 || instantaneous e2
+    Esterel.Nothing -> True
+    Pause -> False
+    Emit _ -> True
+    Exit _ -> False -- does not relinquish control
+    Suspend p _ -> instantaneous p
+    Signal _ p -> instantaneous p
+    Trap _ p -> instantaneous p
+    Loop _ -> False -- does not relinquish control
+    Seq e1 e2 -> instantaneous e1 && instantaneous e2
+    Par e1 e2 -> instantaneous e1 || instantaneous e2
+
diff --git a/compile.hs b/compile.hs
@@ -0,0 +1,348 @@
+module Compile where
+
+import Esterel
+import Lustre
+
+import qualified Data.Set as Set
+
+import Data.List
+
+-- compile a module
+compile (Module name inputs outputs x) =
+  let Annotated _ ((i, o), n) = x in 
+  reverse (
+    -- generate the root node
+    Node name x
+      (map toISignal inputs)
+      (map toOSignal outputs)
+      -- create local variables for undeclared input signals
+      (toIControl ++ [toOControl]
+        ++ map toISignal (toList $ Set.difference i (Set.fromList inputs)))
+      (
+      -- input control is passed at the first tick and isn't passed afterwards
+         [Decl [toIControlO] (Binop Fby Lustre.True Lustre.False)]
+      -- input suspend is initially false
+      ++ [Decl [toISuspendO] Lustre.False]
+      -- input reset is initially false
+      ++ [Decl [toIResetO] Lustre.False]
+      -- call the node for the root AST element
+      ++ [Decl (toOArgs o) $ Call (toNode n) $ toIArgs i]
+      -- set unused output signals to false
+      ++ map (\x -> Decl [x] Lustre.False)
+            (toOArgsS $ Set.difference (Set.fromList outputs) o)
+      -- initialize undeclared input signals to false
+      ++ map (\x -> Decl [toISignal x] $ Var $ toOSignal x)
+            (toList $ Set.difference i $ Set.fromList inputs)
+      )
+  :compileExp x)
+
+  where
+
+  -- functions to generate argument names
+  -- most of these functions exist with a trailing P to add a prefix to the name
+  
+  -- name of an argument for an input signal (ie. received by the node)
+  toISignalP pref sig = pref ++ "input_signal_" ++ sig
+  toISignal = toISignalP ""
+  -- name of an argument for an output signal (ie. produced by the node)
+  toOSignalP pref sig = pref ++ "output_signal_" ++ sig
+  toOSignal = toOSignalP ""
+  -- name of the input control
+  toIControlOP pref = pref ++ "input_control"
+  toIControlO = toIControlOP ""
+  -- name of the raw input control (ie. before using suspend and reset)
+  toIControlNROP pref = pref ++ "input_raw_control"
+  -- name of the suspend wire
+  toISuspendOP pref = pref ++ "input_suspend"
+  toISuspendO = toISuspendOP ""
+  -- name of the reset wire
+  toIResetOP pref = pref ++ "input_reset"
+  toIResetO = toIResetOP ""
+  -- combine the input control, reset and suspend
+  toIControlP pref = toIControlMP pref pref pref
+  toIControlMP pref1 pref2 pref3 =
+      toIControlOP pref1:toIResetOP pref2:[toISuspendOP pref3]
+  toIControl = toIControlP ""
+  -- name of the output control
+  toOControlP pref = pref ++ "output_control"
+  toOControl = toOControlP ""
+  -- prepare the input signals
+  toIArgsSP pref sigs = map (toISignalP pref) $ toList sigs
+  -- prepare the output signals
+  toOArgsSP pref sigs = map (toOSignalP pref) $ toList sigs
+  toOArgsS = toOArgsSP ""
+  -- combine the input control, reset, suspend, and input signals
+  toIArgsP pref = toIArgsMP pref pref pref pref
+  toIArgsMP pref1 pref2 pref3 pref4 sigs =
+      toIControlMP pref1 pref2 pref3 ++ toIArgsSP pref4 sigs
+  toIArgs = toIArgsP ""
+  -- combine the output control and output signals
+  toOArgsP pref sigs = toOControlP pref:toOArgsSP pref sigs
+  toOArgs = toOArgsP ""
+  -- clumsy hack to combine the raw input control, reset and suspend
+  toIControlNRP pref = [toIControlNROP pref, toIResetOP pref, toISuspendOP pref]
+  toIArgsNRP pref sigs = toIControlNRP pref ++ toIArgsSP pref sigs
+  toIArgsNR = toIArgsNRP ""
+
+  -- local variables for all nodes
+  defaultLocal = [toIControlO, "irsuspended"]
+
+  -- declarations for all nodes
+  -- these declarations set irsuspended and the input control taking into
+  -- account input_suspend, input_raw_control, and input_reset
+  defaultDecls = [
+    Decl ["irsuspended"] $ Binop Fby Lustre.False $
+      Binop And (Unop Not $ Var toIResetO) $
+        Binop Or (Binop And (Var toISuspendO) (Var $ toIControlNROP "")) $
+          Binop And (Unop Pre $ Var "irsuspended") (Var toISuspendO),
+    Decl [toIControlO] $
+      Binop And (Unop Not $ Var toIResetO) $
+        Binop And (Unop Not $ Var toISuspendO) $
+          Binop Or
+            (Var $ toIControlNROP "") (Unop Pre $ Var "irsuspended")]
+
+  -- convert a set (used in the AST annotation for input and output signals) to
+  -- a list (used for the nodes), ensuring that the order is reasonable
+  toList = Data.List.sort . Set.toList
+
+  -- convert the unique node identifier to a lustre node name
+  toNode i = name ++ show i
+
+  -- compute the or of one or two signals
+  orSignal l = case l of
+    [x] -> x
+    [x,y] -> Binop Or x y
+    _ -> error "assertion failed"
+    
+  -- define output signals (without prefix) of s as the or of output signals in
+  -- s1 with prefix p1 and s2 with prefix p2
+  orSignals :: String -> Set.Set Sig -> String -> Set.Set Sig -> [Decl]
+  orSignals p1 s1 p2 s2 = 
+    map (\s -> Decl [toOSignal s] $
+      orSignal ([Var $ toOSignalP p1 s | s `Set.member` s1]
+          ++ [Var $ toOSignalP p2 s | s `Set.member` s2])) $
+      toList $ Set.union s1 s2
+
+  -- compile an AST node to a list of local variables, a list of declarations
+  -- and a list of child nodes
+  -- this is where the actual work is performed
+  compileDecls (Annotated e ((_, o), _)) = 
+    case e of
+
+    Esterel.Nothing ->
+      (defaultLocal,
+        defaultDecls
+          -- output control is input control
+          ++ [Decl [toOControl] $ Var toIControlO],
+        [])
+
+    Esterel.Pause ->
+      (defaultLocal,
+        defaultDecls
+          -- output control is false -> pre(input control)
+          ++ [Decl [toOControl] (Binop Fby Lustre.False $
+            Unop Pre $ Var toIControlO)],
+        [])
+
+    Esterel.Emit s ->
+      (defaultLocal,
+        defaultDecls
+          -- output control is input control
+          ++ [Decl [toOControl] $ Var toIControlO]
+          -- output signal is input control
+          ++ [Decl [toOSignal s] (Var toIControlO)],
+        [])
+
+    Esterel.Exit t ->
+      (defaultLocal,
+        defaultDecls
+          -- output control is false
+          ++ [Decl [toOControl] Lustre.False]
+          -- output trap (aka. signal) is input control
+          ++ [Decl [toOSignal t] $ Var toIControlO],
+        [])
+
+    Esterel.Signal s e@(Annotated _ ((i', o'), n')) ->
+      let others = compileExp e in
+      let in_o = s `Set.member` o' in
+      let in_i = s `Set.member` i' in
+      (defaultLocal ++ [toOSignal s | in_o] ++ [toISignal s | in_i],
+        defaultDecls
+          -- nothing to do except creating local variables to store s without
+          -- propagating it, and set it to false without receiving it
+          ++ [Decl (toOArgs o') $ Call (toNode n') (toIArgs i')]
+          ++ [Decl [toISignal s] Lustre.False | in_i],
+        others)
+
+    Esterel.Suspend e@(Annotated _ ((i', o'), n')) s ->
+      let others = compileExp e in
+      (defaultLocal ++ [toISuspendOP "sub"],
+        defaultDecls
+          -- nothing to do except pass a modified suspend which takes our own
+          -- suspend and signal s into account
+          ++ [Decl (toOArgs o') $
+                Call (toNode n') $
+                  toIArgsMP "" "" "sub" "" i']
+          ++ [Decl [toISuspendOP "sub"] $
+                Binop Fby Lustre.False $
+                Binop Or (Var toISuspendO) (Var $ toISignal s)],
+        others)
+
+    Esterel.Trap t e@(Annotated _ ((i', o'), n')) ->
+      let others = compileExp e in
+      let in_o = t `Set.member` o' in
+      let in_i = t `Set.member` i' in
+      (defaultLocal
+        ++ [toIResetOP "sub"]
+        ++ [toOSignal t | in_o] ++ [toISignal t | in_i]
+        ++ [toOControlP "sub"],
+        defaultDecls
+          -- call the child node with a modified reset and produce a modified
+          -- output control
+          ++ [Decl (toOControlP "sub":toOArgsSP "" o') $
+                Call (toNode n') $
+                  toIArgsMP "" "sub" "" "" i']
+          -- initialize variables if needed
+          ++ [Decl [toISignal t] Lustre.False | in_i]
+          -- we yield output control either when doing so naturally or when t is
+          -- raised
+          ++ [Decl [toOControl] $
+                Binop Or (Var $ toOControlP "sub") (Var $ toOSignal t)]
+          -- we pass reset to our child nodes either when we get it from our
+          -- father or when t was raised
+          ++ [Decl [toIResetOP "sub"] $
+                Binop Or (Var toIResetO) (Unop Pre $
+                  Var $ toOSignal t)],
+        others)
+
+    Esterel.Loop e@(Annotated _ ((i', o'), n')) ->
+      let others = compileExp e in
+      (defaultLocal ++ [toIControlOP "sub"] ++ [toOControlP "sub"],
+        defaultDecls
+          -- we never yield control
+          ++ [Decl [toOControl] Lustre.False]
+          -- the input control of the loop body either when we get input
+          -- control or when the loop body yields output control
+          ++ [Decl [toIControlOP "sub"] $
+                Binop Or (Var toIControlO) (Var $ toOControlP "sub")]
+          -- perform the call
+          ++ [Decl (toOControlP "sub":toOArgsSP "" o') $
+                Call (toNode n') $
+                  toIArgsMP "sub" "" "" "" i'],
+        others)
+
+    Esterel.Seq
+        e1@(Annotated _ ((i1', o1'), n1'))
+        e2@(Annotated _ ((i2', o2'), n2')) ->
+      let others1 = compileExp e1 in
+      let others2 = compileExp e2 in
+      (defaultLocal
+        ++ [toOControlP "sub1"]
+        ++ toIControlP "sub2"
+        ++ toOArgsSP "sub1" o1'
+        ++ toOArgsSP "sub2" o2',
+        defaultDecls
+          -- call the first child
+          ++ [Decl (toOArgsP "sub1" o1') $
+              Call (toNode n1') (toIArgs i1')]
+          -- call the second child
+          ++ [Decl (toOControl:toOArgsSP "sub2" o2') $
+              Call (toNode n2') $
+                toIArgsMP "sub2" "" "" "" i2']
+          -- input control of second node is output control of first node
+          ++ [Decl [toIControlOP "sub2"] $ Var $ toOControlP "sub1"]
+          -- signals are raised if one of the children raised them
+          ++ orSignals "sub1" o1' "sub2" o2',
+        others1 ++ others2)
+
+    Esterel.Present s
+        e1@(Annotated _ ((i1', o1'), n1'))
+        e2@(Annotated _ ((i2', o2'), n2')) ->
+      let others1 = compileExp e1 in
+      let others2 = compileExp e2 in
+      let subcall input output node pref =
+            [Decl (toOArgsP pref output) $
+              Call (toNode node) $
+                toIArgsMP pref "" "" "" input] in
+      (defaultLocal
+        ++ [toIControlOP "sub1", toIControlOP "sub2"]
+        ++ toOArgsP "sub1" o1'
+        ++ toOArgsP "sub2" o2',
+        defaultDecls
+          -- control should pass to the then branch
+          ++ [Decl [toIControlOP "sub1"] $
+               Binop And (Var toIControlO) (Var $ toISignal s)]
+          -- control should pass to the else branch
+          ++ [Decl [toIControlOP "sub2"] $
+               Binop And (Var toIControlO) (Unop Not $ Var $ toISignal s)]
+          -- we yield control when either branch yields control
+          ++ [Decl [toOControl] $
+               Binop Or (Var $ toOControlP "sub1") (Var $ toOControlP "sub2")]
+          -- call for the then branch
+          ++ subcall i1' o1' n1' "sub1"
+          -- call for the else branch
+          ++ subcall i2' o2' n2' "sub2"
+          -- signals are raised if one of the branches raised them
+          ++ orSignals "sub1" o1' "sub2" o2',
+        others1 ++ others2)
+
+    Esterel.Par
+        e1@(Annotated _ ((i1', o1'), n1'))
+        e2@(Annotated _ ((i2', o2'), n2')) ->
+      let others1 = compileExp e1 in
+      let others2 = compileExp e2 in
+      let subcall input output node pref = 
+            [Decl (toOArgsP pref output) $
+              Call (toNode node) (toIControl ++ map
+                (\x -> "combined_signal_" ++ x)
+                  (toList input))] in
+      let termination pref1 pref2 =
+            [Decl [pref1 ++ "_finished"] $
+              Binop Or (Var $ toOControlP pref2) $
+                Binop Fby Lustre.False $
+                  Unop Pre $
+                    Binop And (Var $ pref1 ++ "_finished") $
+                      Unop Not $ Var $ pref2 ++ "_finished"] in
+      -- we declare local variables for each signal and to indicate whether the
+      -- branches have finished, and combined_signals variable to allow the two
+      -- branches to communicate
+      (defaultLocal
+        ++ ("sub1_finished":"sub2_finished":(
+          toOArgsP "sub1" o1' ++ toOArgsP "sub2" o2')
+          ++ map (\x -> "combined_signal_" ++ x)
+                (toList $ i1' `Set.union` i2')),
+        defaultDecls
+          -- store the termination of the first branch
+          ++ termination "sub1" "sub2"
+          -- store the termination of the second branch
+          ++ termination "sub2" "sub1"
+          -- we yield control if both branches have yielded control
+          ++ [Decl [toOControl] $
+                Binop And (Var "sub1_finished") $
+                  Var "sub2_finished"]
+          -- call the first branch
+          ++ subcall i1' o1' n1' "sub1"
+          -- call the second branch
+          ++ subcall i2' o2' n2' "sub2"
+          -- signals are raised if one of the branches raised them
+          ++ orSignals "sub1" o1' "sub2" o2'
+          -- define the signal combinations
+          ++ map (\x -> Decl ["combined_signal_" ++ x] $
+            if x `Set.member` o
+              then Binop Or (Var $ toISignal x) (Var $ toOSignal x)
+                else Var $ toISignal x) (toList $
+              Set.union i1' i2'),
+        others1 ++ others2)
+
+  -- compile an AST node with annotations, using compileDecls and adding
+  -- boilerplate
+  compileExp x@(Annotated _ ((i, o), n)) =
+    let (lvars, decls, others) = compileDecls x in
+      Node (toNode n)
+        x
+        (toIArgsNR i)
+        (toOArgs o)
+        lvars 
+        decls
+      :others
+
diff --git a/esterel.hs b/esterel.hs
@@ -0,0 +1,43 @@
+module Esterel where
+
+import qualified Data.Set as Set
+
+-- an Esterel module, polymorphic on the type of expression annotations
+data PModule e = Module Name [Sig] [Sig] (PExp e)
+-- the module name
+type Name = String
+
+-- the polymorphic expressions, with an annotation of type e
+data PExp e = Annotated (PExp2 e) e deriving (Show)
+-- the expressions themselves
+data PExp2 e = 
+    Nothing
+  | Emit Sig
+  | Pause
+  | Present Sig (PExp e) (PExp e)
+  | Suspend (PExp e) Sig
+  | Seq (PExp e) (PExp e)
+  | Loop (PExp e)
+  | Par (PExp e) (PExp e)
+  | Trap Trap (PExp e)
+  | Exit Trap
+  | Signal Sig (PExp e)
+  deriving (Show)
+
+-- the traps and signals
+type Sig = String
+type Trap = String
+
+-- expressions with no annotations
+type Exp = PExp ()
+
+-- a set of signals and traps that can be emitted or received
+type Scope = Set.Set Sig
+-- expressions annotated with their input and output signals (and traps)
+type ScopeExp = PExp (Scope, Scope)
+-- expressions further annotated with a unique identifier
+type ScopeLabelExp = PExp ((Scope, Scope), Int)
+
+-- the parsing environnement, which is unused
+data Environment = Empty
+
diff --git a/label.hs b/label.hs
@@ -0,0 +1,45 @@
+module Label where
+
+import Esterel
+
+addLabel :: Int -> (Scope, Scope) -> PExp2 ((Scope, Scope), Int) -> ScopeLabelExp
+addLabel i a x = Annotated x (a, i)
+
+doBinop i e1 e2 =
+  let (ni1, ne1) = doLabel i e1 in
+  let (ni2, ne2) = doLabel ni1 e2 in
+  (ni2, ne1, ne2)
+
+doLabel :: Int -> ScopeExp -> (Int, ScopeLabelExp)
+doLabel i (Annotated x a) = case x of
+    Esterel.Nothing -> (i+1, addLabel i a Esterel.Nothing)
+    Pause -> (i+1, addLabel i a Pause)
+    Loop e ->
+        let (ni, ne) = doLabel (i+1) e in
+        (ni, addLabel i a (Loop ne))
+    Present s e1 e2 ->
+        let (ni, ne1, ne2) = doBinop (i+1) e1 e2 in
+        (ni, addLabel i a (Present s ne1 ne2))
+    Seq e1 e2 ->
+        let (ni, ne1, ne2) = doBinop (i+1) e1 e2 in
+        (ni, addLabel i a (Seq ne1 ne2))
+    Par e1 e2 ->
+        let (ni, ne1, ne2) = doBinop (i+1) e1 e2 in
+        (ni, addLabel i a (Par ne1 ne2))
+    Suspend e s ->
+        let (ni, ne) = doLabel (i+1) e in
+        (ni, addLabel i a (Suspend ne s))
+    Signal s e ->
+        let (ni, ne) = doLabel (i+1) e in
+        (ni, addLabel i a (Signal s ne))
+    Trap t e ->
+        let (ni, ne) = doLabel (i+1) e in
+        (ni, addLabel i a (Trap t ne))
+    Emit s ->
+        (i+1, addLabel i a (Emit s))
+    Exit t ->
+        (i+1, addLabel i a (Exit t))
+
+label :: ScopeExp -> ScopeLabelExp
+label e = let (_, r) = doLabel 0 e in r
+
diff --git a/lustre.hs b/lustre.hs
@@ -0,0 +1,31 @@
+module Lustre where
+
+-- a lustre node, carrying annotation e
+-- annotations will be rendered as comments in the produced code and can be used
+-- for debugging
+data Node e = Node Name e [Input] [Output] [Variable] [Decl] deriving (Show)
+-- node name
+type Name = String
+-- boolean local variable
+type Variable = Name
+-- boolean argument
+type Input = Name
+-- boolean output
+type Output = Name
+
+-- a declaration mapping LValues to the result of an expression
+data Decl = Decl [LValue] Expr deriving (Show)
+-- lvalue
+type LValue = Name
+data Expr =
+    False
+  | True
+  | Var Name
+  | Unop Unop Expr
+  | Binop Binop Expr Expr
+  | Call Name [Name]
+  deriving (Show)
+-- binary operations
+data Binop = Or | And | Fby deriving (Show)
+-- unary operations
+data Unop = Not | Pre deriving (Show)
diff --git a/main.hs b/main.hs
@@ -0,0 +1,34 @@
+module Main where
+
+import Text.Parsec
+import System.Environment
+import Compile
+import Produce
+import Esterel
+import qualified Parse
+import qualified Scope
+import qualified Label
+import System.IO
+import System.Exit
+import Text.Show.Pretty
+
+main = do
+  args <- getArgs
+  case args of
+    [filename] -> do
+      file <- readFile filename
+      let parsed = runP Parse.parseFile Esterel.Empty "" file
+      either
+          (\error -> do
+              hPutStrLn stderr $ "Parse error " ++ ppShow error
+              exitFailure)
+          (\(Module name inputs outputs expr) -> putStr ((
+            let nexpr = Label.label $ Scope.scope expr in 
+            Produce.produceNodes $ Compile.compile $ Module name inputs outputs nexpr
+            )
+          ++ "\n")) parsed;
+    _ -> do
+      name <- getProgName
+      hPutStrLn stderr $ "Usage: " ++ name ++ " FILE"
+      exitFailure
+
diff --git a/parse.hs b/parse.hs
@@ -0,0 +1,129 @@
+{-# LANGUAGE NoMonomorphismRestriction #-}
+
+module Parse where
+
+import Esterel
+import Text.Parsec
+import Char
+import Checker
+
+idChar = satisfy (\ x -> not (elem x ":;|[]()-,\"") && not (isSpace x))
+spaced = between spaces spaces
+parenthesized = between (char '[') (char ']')
+
+parseName = spaced $ (do
+    id <- many1 $ idChar
+    return $ id
+    )
+
+parseFile = spaced $ do
+    string "module"
+    name <- parseModuleName
+    string ":"
+    input <- parseModuleIO "input"
+    output <- parseModuleIO "output"
+    expr <- parseExpr
+    string "end module"
+    space
+    eof
+    return $ Module name input output expr
+
+parseModuleName = parseName
+
+parseSignals = spaced $ do
+    signals <- sepBy1 parseSignal (char ',')
+    return signals
+
+parseModuleIO decl = spaced $ do
+    string decl
+    args <- parseSignals
+    string ";"
+    return args
+    
+parseSimpleExpr = spaced $ (do
+    x <- parenthesized $ parseExpr
+    return x
+    )
+  <|> (try $ do
+    string "pause"
+    return $ Annotated (Pause) ()
+    )
+  <|> (try $ do
+    string "present" 
+    signal <- parseSignal
+    string "then" 
+    e1 <- parseExpr
+    string "else" 
+    e2 <- parseExpr
+    string "end" 
+    return $ Annotated (Present signal e1 e2) ()
+    )
+  <|> (do
+    string "nothing"
+    return $ Annotated (Esterel.Nothing) ()
+    )
+  <|> (do
+    p <- between (string "loop") (string "end") $ parseExpr
+    if instantaneous p
+    then fail "loop block ending here has unbounded looping"
+    else return $ Annotated (Loop p) ()
+    )
+  <|> (try $ do
+    string "emit" 
+    s <- parseSignal
+    return $ Annotated (Emit s) ()
+    )
+  <|> (try $ do
+    string "exit" 
+    t <- parseTrap
+    return $ Annotated (Exit t) ()
+    )
+  <|> (do
+    string "trap" 
+    t <- parseTrap
+    string "in" 
+    p <- parseExpr
+    string "end" 
+    return $ Annotated (Trap t p) ()
+    )
+  <|> (try $ do
+    string "signal" 
+    s <- parseSignal
+    string "in" 
+    p <- parseExpr
+    string "end" 
+    return $ Annotated (Signal s p) ()
+    )
+  <|> (do
+    string "suspend" 
+    p <- parseExpr
+    string "when" 
+    s <- parseSignal
+    return $ Annotated (Suspend p s) ()
+    )
+
+parseExpr = (try $ do
+    p1 <- parseScExpr
+    spaced $ string "||"
+    p2 <- parseExpr
+    return $ Annotated (Par p1 p2) ()
+    )
+  <|> (do
+    x <- parseScExpr
+    return x
+    )
+
+parseScExpr = spaced $ (try $ do
+    p1 <- parseSimpleExpr
+    spaced $ string ";"
+    p2 <- parseScExpr
+    return $ Annotated (Seq p1 p2) ()
+    )
+  <|> (do
+    x <- parseSimpleExpr
+    return x
+    )
+
+parseSignal = parseName
+parseTrap = parseName
+
diff --git a/produce.hs b/produce.hs
@@ -0,0 +1,48 @@
+module Produce where
+
+import Lustre
+import Data.String.Utils
+import Text.Show.Pretty
+
+parenthesize x = "(" ++ x ++ ")"
+produceList = join ", "
+produceListP names = (if length names > 1 then parenthesize else id) $
+  produceList names
+produceArgs names = parenthesize $ produceList names
+produceArgsB names = produceList names ++ (if null names then "" else " : bool")
+produceArgsPB = parenthesize . produceArgsB
+
+produceMultiple f xs = foldl (++) "" $ map f xs
+produceBinop o = case o of
+  Lustre.Or -> " or "
+  Lustre.And -> " and "
+  Lustre.Fby -> " -> "
+produceUnop o = case o of
+  Lustre.Not -> " not "
+  Lustre.Pre -> " pre "
+produceExpr e = case e of
+  Lustre.False -> "false"
+  Lustre.True -> "true"
+  Lustre.Var name -> name
+  Lustre.Binop o e1 e2 ->
+    parenthesize (produceExpr e1) ++ produceBinop o ++
+      parenthesize (produceExpr e2)
+  Lustre.Unop o e ->
+    produceUnop o ++ parenthesize (produceExpr e)
+  Lustre.Call x ys -> x ++ produceArgs ys
+produceDecl (Decl lvalues expr) =
+  produceListP lvalues ++ " = " ++ produceExpr expr ++ ";\n"
+produceDecls = produceMultiple produceDecl
+
+produceNode (Node name comment i o lvars decls) = 
+  unlines (map (\x -> "-- "++x) $ lines $ ppShow comment)
+  ++ "node " ++ name ++ produceArgsPB i
+  ++ " returns " ++ produceArgsPB o ++ ";\n"
+  ++ if null lvars then "" else "var " ++ produceArgsB lvars ++ ";\n"
+  ++ "let\n"
+  ++ produceDecls decls
+  ++ "tel\n"
+
+produceNodes :: Show a => [Node a] -> String
+produceNodes nodes = join "\n\n" $ map produceNode nodes
+
diff --git a/rungolden.sh b/rungolden.sh
@@ -0,0 +1,81 @@
+#!/bin/bash
+
+NAME="$1"
+INPUT="test/$NAME.in"
+PROG="test/$NAME.strl"
+C1="test/$NAME.c"
+C2="test/$NAME.2.c"
+OUT="test/$NAME.out"
+BIN="test/$NAME.bin"
+
+# parse an "input" or "output" statement
+function theline() {
+  cat $PROG |
+    grep "^$1" |
+    sed 's/  */ /g' |
+    tr -d ',;' |
+    cut -d ' ' -f 2- |
+    tr ' ' '\n'
+}
+
+hash esterel 2>&- || {
+  echo >&2 "No \"esterel\" command in path. Abort.";
+  exit 1; }
+
+rm -f $C1 $C2
+
+esterel -B $NAME -D test/ $PROG || {
+  echo >&2 "Running esterel failed. Abort.";
+  exit 2; }
+
+cat > $C2 << EOF
+#include <stdio.h>
+#include <stdlib.h>
+
+int signal() {
+  char buf[10];
+  int r = scanf("%s", &buf);
+  if (r != 1) exit(1);
+  return (buf[0] == 'T');
+}
+EOF
+theline output | while read output; do
+  echo "void ${NAME}_O_$output () { printf(\"$output \");} "
+done >> $C2
+cat >> $C2 << EOF
+int main (int argc, char **argv) {
+  while (1) {
+EOF
+
+theline input | while read input; do
+  echo "if (signal()) ${NAME}_I_$input ();" >> $C2
+done >> $C2
+echo "$NAME();" >> $C2
+cat >> $C2 << EOF
+    printf("\n");
+  }
+  return 0;
+}
+EOF
+
+rm -f $BIN
+cc -o $BIN $C1 $C2 || {
+    echo >&2 "Compiling the interfacing code didn't work. Abort";
+    exit 2; }
+
+rm -f $OUT
+cat $INPUT | $BIN | while read cycle
+do
+  echo $cycle | tr ' ' '\n' | sort | uniq > $OUT
+  theline output | while read output
+  do
+    if `cat $OUT | grep $output > /dev/null`
+    then
+      echo -n "true "
+    else
+      echo -n "false "
+    fi
+  done | sed 's/ *$//'
+  echo
+done | head -n `wc -l $INPUT | cut -d ' ' -f 1`
+
diff --git a/runtest.sh b/runtest.sh
@@ -0,0 +1,54 @@
+#!/bin/bash
+
+NAME="$1"
+INPUT="test/$NAME.in"
+PROG="test/$NAME.strl"
+LUSTRE="test/$NAME.lus"
+KESTEREL2LUSTRE="./kesterel2lustre"
+
+# check for presence of required tools
+# from http://stackoverflow.com/q/592620/414272
+hash lustre 2>&- ||
+  { echo >&2 "No \"lustre\" command in path. Abort."; exit 1; }
+hash lux 2>&- ||
+  { echo >&2 "No \"lustre\" command in path. Abort."; exit 1; }
+if [ ! -x $KESTEREL2LUSTRE ]
+then
+  echo "Could not find the executable \"$KESTEREL2LUSTRE\". Did you \"make\"?"
+  exit 1
+fi
+
+# convert esterel to lustre
+rm -f $LUSTRE
+$KESTEREL2LUSTRE $PROG > test/$NAME.lus ||
+  { echo >&2 "$KESTEREL2LUSTRE $PROG returned non-zero exit status. Abort."
+    exit 2;
+  }
+
+
+# compile to an executable
+cd test
+rm -f $NAME.oc
+rm -f $NAME.ec
+lustre $NAME.lus $NAME 1>&2 ||
+  { echo >&2 "Running lustre failed. Abort."
+    exit 2;
+  }
+rm -f $NAME $NAME.xlus
+lux $NAME.oc 1>&2 ||
+  { echo >&2 "Running lux failed. Abort."
+    exit 2;
+  }
+mv $NAME $NAME.xlus
+cd ..
+
+# pass input to the executable, parse output
+cat $INPUT |
+  tr ' ' '\n' |
+  sed 's/True/1/;s/False/0/' |
+  ./test/$NAME.xlus |
+  awk 'BEGIN { y = 0} (y) {print $1} /^###/ { y = 1 } ' |
+  tr '\n' ' ' |
+  sed 's/##*/\n/g' |
+  sed 's/^ *//;s/ *$//'
+
diff --git a/scope.hs b/scope.hs
@@ -0,0 +1,51 @@
+module Scope where
+
+import Esterel
+import qualified Data.Set as Set
+
+scope :: Exp -> ScopeExp
+scope (Annotated x ()) = case x of
+    Esterel.Nothing ->
+      Annotated Esterel.Nothing (Set.empty, Set.empty)
+    Pause ->
+      Annotated Pause (Set.empty, Set.empty)
+    Loop e ->
+      let ne@(Annotated _ (i, o)) = scope e in
+        Annotated (Loop ne) (i, o)
+    Present s e1 e2 ->
+      -- inputs and outputs of the two branches, adding s
+      let (ne1, ne2, (i, o)) = doBinop e1 e2 in
+        Annotated (Present s ne1 ne2) (i `Set.union` Set.singleton s, o)
+    Seq e1 e2 ->
+      let (ne1, ne2, sc) = doBinop e1 e2 in
+        Annotated (Seq ne1 ne2) sc
+    Par e1 e2 -> let (ne1, ne2, sc) = doBinop e1 e2 in
+        Annotated (Par ne1 ne2) sc
+    Suspend e s -> let (ne, sc) = doUnop addInput e s in
+        Annotated (Suspend ne s) sc
+    Signal s e ->
+      -- remove s from the input and output
+      let (ne, sc) = doUnop removeBoth e s in
+      Annotated (Signal s ne) sc
+    Trap t e ->
+      -- remove s from the input and output
+      let (ne, sc) = doUnop removeBoth e t in
+      Annotated (Trap t ne) sc
+    Emit s ->
+      Annotated (Emit s) (Set.empty, Set.singleton s)
+    Exit t ->
+      Annotated (Exit t) (Set.empty, Set.singleton t)
+  where
+  -- take the union of the two branches
+  doBinop e1 e2 =
+    let ne1@(Annotated _ (i1, o1)) = scope e1 in
+    let ne2@(Annotated _ (i2, o2)) = scope e2 in
+    (ne1, ne2, (i1 `Set.union` i2, o1 `Set.union` o2))
+  -- take the result of the branch and apply f
+  doUnop f e s =
+    let ne@(Annotated _ (i, o)) = scope e in
+    (ne, f (i, o, s))
+  addInput (i, o, s) =
+    (i `Set.union` Set.singleton s, o)
+  removeBoth (i, o, s) =
+    (i `Set.difference` Set.singleton s, o `Set.difference` Set.singleton s)
diff --git a/test/alwayssuspend.in b/test/alwayssuspend.in
@@ -0,0 +1,21 @@
+True
+True
+True
+True
+True
+True
+True
+True
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
diff --git a/test/alwayssuspend.strl b/test/alwayssuspend.strl
@@ -0,0 +1,8 @@
+module alwayssuspend:
+input S;
+output T1, Ta, Tb, Tc;
+loop emit T1; pause end || suspend
+    loop
+      emit Ta; pause; emit Tb; pause; emit Tc; pause
+    end when T1
+end module
diff --git a/test/asuspend.in b/test/asuspend.in
@@ -0,0 +1,21 @@
+True
+True
+True
+True
+True
+True
+True
+True
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
diff --git a/test/asuspend.strl b/test/asuspend.strl
@@ -0,0 +1,6 @@
+module asuspend:
+input T2;
+output T1;
+signal S in [pause ; emit S || suspend pause ; pause when S
+]; emit T1 end
+end module
diff --git a/test/at0.in b/test/at0.in
@@ -0,0 +1,27 @@
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
diff --git a/test/at0.strl b/test/at0.strl
@@ -0,0 +1,5 @@
+module at0:
+input T;
+output S;
+emit S
+end module
diff --git a/test/at1.in b/test/at1.in
@@ -0,0 +1,27 @@
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
diff --git a/test/at1.strl b/test/at1.strl
@@ -0,0 +1,6 @@
+module at1:
+input T;
+output S;
+pause;
+emit S
+end module
diff --git a/test/at2.in b/test/at2.in
@@ -0,0 +1,27 @@
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
diff --git a/test/at2.strl b/test/at2.strl
@@ -0,0 +1,7 @@
+module at2:
+input T;
+output S;
+pause;
+pause;
+emit S
+end module
diff --git a/test/booleanf.in b/test/booleanf.in
@@ -0,0 +1,4 @@
+False False
+False True
+True False
+True True
diff --git a/test/booleanf.strl b/test/booleanf.strl
@@ -0,0 +1,20 @@
+module booleanf:
+input I1, I2;
+output A, O;
+loop
+  present I1 then
+    present I2 then
+      emit A; emit O
+    else
+      emit O
+    end
+  else
+    present I2 then
+      emit O
+    else
+      nothing
+    end
+  end;
+  pause
+end
+end module
diff --git a/test/communication.in b/test/communication.in
@@ -0,0 +1,4 @@
+True
+True
+True
+True
diff --git a/test/communication.strl b/test/communication.strl
@@ -0,0 +1,8 @@
+module communication:
+input S;
+output T;
+signal E in
+  emit E ||
+  present E then emit T else nothing end
+end
+end module
diff --git a/test/communication2.in b/test/communication2.in
@@ -0,0 +1,4 @@
+True
+True
+True
+True
diff --git a/test/communication2.strl b/test/communication2.strl
@@ -0,0 +1,6 @@
+module communication2:
+input S;
+output T, E;
+emit E ||
+present E then emit T else nothing end
+end module
diff --git a/test/communication3.in b/test/communication3.in
@@ -0,0 +1,4 @@
+True
+True
+True
+True
diff --git a/test/communication3.strl b/test/communication3.strl
@@ -0,0 +1,8 @@
+module communication3:
+input S;
+output T;
+signal E in
+  emit E ||
+  emit T
+end
+end module
diff --git a/test/id.in b/test/id.in
@@ -0,0 +1,8 @@
+True
+False
+True
+False
+False
+True
+True
+False
diff --git a/test/id.strl b/test/id.strl
@@ -0,0 +1,5 @@
+module id:
+input X;
+output Y;
+loop present X then emit Y else nothing end; pause end
+end module
diff --git a/test/id2.in b/test/id2.in
@@ -0,0 +1,8 @@
+True True
+True True
+True False
+True False
+False False
+False True
+False True
+False False
diff --git a/test/id2.strl b/test/id2.strl
@@ -0,0 +1,8 @@
+module id2:
+input x1, x2;
+output y1, y2;
+loop
+  [present x1 then emit y1 else nothing end; pause] ||
+  [present x2 then emit y2 else nothing end; pause]
+end
+end module
diff --git a/test/inputsuspend.in b/test/inputsuspend.in
@@ -0,0 +1,29 @@
+True
+True
+True
+True
+True
+True
+True
+True
+False
+False
+False
+False
+False
+True
+True
+True
+True
+False
+False
+False
+False
+False
+False
+True
+True
+True
+True
+False
+False
diff --git a/test/inputsuspend.strl b/test/inputsuspend.strl
@@ -0,0 +1,8 @@
+module inputsuspend:
+input S;
+output Ta, Tb, Tc;
+suspend
+  loop
+    emit Ta; pause; emit Tb; pause; emit Tc; pause
+  end when S
+end module
diff --git a/test/inputsuspend2.in b/test/inputsuspend2.in
@@ -0,0 +1,29 @@
+True
+True
+True
+True
+True
+True
+True
+True
+False
+False
+False
+False
+False
+True
+True
+True
+True
+False
+False
+False
+False
+False
+False
+True
+True
+True
+True
+False
+False
diff --git a/test/inputsuspend2.strl b/test/inputsuspend2.strl
@@ -0,0 +1,8 @@
+module inputsuspend2:
+input S;
+output Ta;
+suspend
+  loop
+    emit Ta; pause
+  end when S
+end module
diff --git a/test/inputsuspend3.in b/test/inputsuspend3.in
@@ -0,0 +1,29 @@
+True
+True
+True
+True
+True
+True
+True
+True
+False
+False
+False
+False
+False
+True
+True
+True
+True
+False
+False
+False
+False
+False
+False
+True
+True
+True
+True
+False
+False
diff --git a/test/inputsuspend3.strl b/test/inputsuspend3.strl
@@ -0,0 +1,8 @@
+module inputsuspend3:
+input S;
+output Ta, Tb;
+suspend
+  loop
+    emit Ta; pause; emit Tb; pause
+  end when S
+end module
diff --git a/test/inputsuspend4.in b/test/inputsuspend4.in
@@ -0,0 +1,29 @@
+True
+True
+True
+True
+True
+True
+True
+True
+False
+False
+False
+False
+False
+True
+True
+True
+True
+False
+False
+False
+False
+False
+False
+True
+True
+True
+True
+False
+False
diff --git a/test/inputsuspend4.strl b/test/inputsuspend4.strl
@@ -0,0 +1,8 @@
+module inputsuspend4:
+input S;
+output Ta, Tb;
+suspend
+  loop
+    emit Ta; emit Tb; pause
+  end when S
+end module
diff --git a/test/inputsuspend5.in b/test/inputsuspend5.in
@@ -0,0 +1,4 @@
+False
+True
+False
+False
diff --git a/test/inputsuspend5.strl b/test/inputsuspend5.strl
@@ -0,0 +1,7 @@
+module inputsuspend5:
+input S;
+output T;
+suspend
+  pause; emit T; pause; pause; emit T
+when S
+end module
diff --git a/test/isolation.in b/test/isolation.in
@@ -0,0 +1,4 @@
+True
+True
+True
+True
diff --git a/test/isolation.strl b/test/isolation.strl
@@ -0,0 +1,5 @@
+module isolation:
+input S;
+output T;
+signal T in emit T end
+end module
diff --git a/test/logical.in b/test/logical.in
@@ -0,0 +1,8 @@
+True
+True
+True
+False
+False
+True
+True
+False
diff --git a/test/logical.strl b/test/logical.strl
@@ -0,0 +1,13 @@
+module logical:
+input I;
+output O;
+signal S1 in
+signal S2 in
+present I then emit S1 else nothing end
+||
+present S1 then nothing else emit S2 end
+||
+present S2 then emit O else nothing end
+end
+end
+end module
diff --git a/test/looploop.in b/test/looploop.in
@@ -0,0 +1,30 @@
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
diff --git a/test/looploop.strl b/test/looploop.strl
@@ -0,0 +1,7 @@
+module looploop:
+input S;
+output T;
+loop
+  pause; pause; pause; emit T; pause; pause || pause; pause; emit T; pause
+end
+end module
diff --git a/test/looppause.in b/test/looppause.in
@@ -0,0 +1,27 @@
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
diff --git a/test/looppause.strl b/test/looppause.strl
@@ -0,0 +1,5 @@
+module looppause:
+input T;
+output S;
+loop pause end
+end module
diff --git a/test/multipar.in b/test/multipar.in
@@ -0,0 +1,8 @@
+True
+True
+True
+True
+False
+False
+False
+False
diff --git a/test/multipar.strl b/test/multipar.strl
@@ -0,0 +1,14 @@
+module multipar:
+input S;
+output S1, S2, S3, S4, S9, T;
+present S1 then emit S2 else nothing end ||
+  present S2 then emit S3 else nothing end ||
+  present S9 then nothing else emit S4 end ||
+  present S then
+    present S4 then
+      present S3 then
+        emit T
+      else nothing end
+    else nothing end
+  else nothing end
+end module
diff --git a/test/multiple.in b/test/multiple.in
@@ -0,0 +1,2 @@
+False
+False
diff --git a/test/multiple.strl b/test/multiple.strl
@@ -0,0 +1,6 @@
+module multiple:
+input I;
+output O;
+emit O;
+emit O
+end module
diff --git a/test/myabort.in b/test/myabort.in
@@ -0,0 +1,29 @@
+True
+True
+True
+True
+True
+True
+True
+True
+False
+False
+False
+False
+False
+True
+True
+True
+True
+False
+False
+False
+False
+False
+False
+True
+True
+True
+True
+False
+False
diff --git a/test/myabort.strl b/test/myabort.strl
@@ -0,0 +1,15 @@
+module myabort:
+input S;
+output S2;
+trap T in
+  suspend [loop emit S2; pause end] when S;
+  exit T
+|| [ trap T2 in
+  loop
+    pause; present S then
+      exit T2 else nothing
+    end
+  end
+end]; exit T
+end
+end module
diff --git a/test/myabort2.in b/test/myabort2.in
@@ -0,0 +1,3 @@
+True
+True
+False
diff --git a/test/myabort2.strl b/test/myabort2.strl
@@ -0,0 +1,10 @@
+module myabort2:
+input S;
+output S2;
+trap T in
+  suspend
+    loop emit S2; pause end
+  when S
+  || exit T
+end
+end module
diff --git a/test/nestedsignal.in b/test/nestedsignal.in
@@ -0,0 +1,4 @@
+True
+True
+True
+True
diff --git a/test/nestedsignal.strl b/test/nestedsignal.strl
@@ -0,0 +1,9 @@
+module nestedsignal:
+input S;
+output T;
+signal T1 in
+signal T2 in
+emit T; emit T1; emit T2
+end
+end
+end module
diff --git a/test/nestedsuspend.in b/test/nestedsuspend.in
@@ -0,0 +1,21 @@
+True
+True
+True
+True
+True
+True
+True
+True
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
diff --git a/test/nestedsuspend.strl b/test/nestedsuspend.strl
@@ -0,0 +1,11 @@
+module nestedsuspend:
+input S;
+output T1, Ta, Tb, Tc;
+pause;
+loop emit T1; pause; pause end || suspend
+  suspend
+    loop
+      emit Ta; pause; emit Tb; pause; emit Tc; pause
+    end when T1
+when T1
+end module
diff --git a/test/nothing11.in b/test/nothing11.in
@@ -0,0 +1,27 @@
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
diff --git a/test/nothing11.strl b/test/nothing11.strl
@@ -0,0 +1,5 @@
+module nothing11:
+input T;
+output S;
+nothing
+end module
diff --git a/test/nothing23.in b/test/nothing23.in
@@ -0,0 +1,4 @@
+True True
+True False
+False True
+False False
diff --git a/test/nothing23.strl b/test/nothing23.strl
@@ -0,0 +1,5 @@
+module nothing23:
+input E1, E2;
+output S1, S2, S3;
+nothing
+end module
diff --git a/test/oneofthree.in b/test/oneofthree.in
@@ -0,0 +1,27 @@
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
diff --git a/test/oneofthree.strl b/test/oneofthree.strl
@@ -0,0 +1,7 @@
+module oneofthree:
+input T;
+output S;
+loop
+  emit S; pause; pause; pause
+end
+end module
diff --git a/test/oneoftwo.in b/test/oneoftwo.in
@@ -0,0 +1,27 @@
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
+True
diff --git a/test/oneoftwo.strl b/test/oneoftwo.strl
@@ -0,0 +1,9 @@
+module oneoftwo:
+input T;
+output S;
+loop
+  emit S;
+  pause;
+  pause
+end
+end module
diff --git a/test/order.in b/test/order.in
@@ -0,0 +1,21 @@
+True
+True
+True
+True
+True
+True
+True
+True
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
diff --git a/test/order.strl b/test/order.strl
@@ -0,0 +1,5 @@
+module order:
+input S;
+output Ta, Tb, Tc, T1;
+loop emit T1; pause; emit Ta; pause; emit Tb; pause; emit Tc; pause end
+end module
diff --git a/test/orinputsuspend.in b/test/orinputsuspend.in
@@ -0,0 +1,21 @@
+True False
+True False
+True False
+True True
+True True
+True True
+True False
+True False
+False True
+False True
+False True
+False True
+False True
+True True
+True True
+False False
+False False
+False False
+True True
+True True
+False False
diff --git a/test/orinputsuspend.strl b/test/orinputsuspend.strl
@@ -0,0 +1,9 @@
+module orinputsuspend:
+input S1, S2;
+output Ta, Tb;
+suspend
+suspend
+  loop
+    emit Ta; pause; emit Tb; pause
+  end when S1 when S2
+end module
diff --git a/test/othertraps.in b/test/othertraps.in
@@ -0,0 +1,8 @@
+True
+True
+True
+False
+False
+True
+True
+False
diff --git a/test/othertraps.strl b/test/othertraps.strl
@@ -0,0 +1,8 @@
+module othertraps:
+input I;
+output O;
+trap T in
+  loop emit O; pause end
+  || exit T
+end
+end module
diff --git a/test/parallel1.in b/test/parallel1.in
@@ -0,0 +1,4 @@
+True
+True
+True
+True
diff --git a/test/parallel1.strl b/test/parallel1.strl
@@ -0,0 +1,5 @@
+module parallel1:
+input S;
+output T;
+emit T || nothing
+end module
diff --git a/test/parallel2.in b/test/parallel2.in
@@ -0,0 +1,4 @@
+True
+True
+True
+True
diff --git a/test/parallel2.strl b/test/parallel2.strl
@@ -0,0 +1,5 @@
+module parallel2:
+input S;
+output T;
+nothing || emit T
+end module
diff --git a/test/parallelpause.in b/test/parallelpause.in
@@ -0,0 +1,8 @@
+True
+True
+True
+False
+False
+True
+True
+False
diff --git a/test/parallelpause.strl b/test/parallelpause.strl
@@ -0,0 +1,8 @@
+module parallelpause:
+input I;
+output O;
+[pause || pause ; pause];
+[pause; pause || pause ; pause];
+[pause; pause || pause];
+emit O
+end module
diff --git a/test/priority.in b/test/priority.in
@@ -0,0 +1,8 @@
+True
+True
+True
+False
+False
+True
+True
+False
diff --git a/test/priority.strl b/test/priority.strl
@@ -0,0 +1,7 @@
+module priority:
+input I;
+output O;
+signal S in
+pause; emit S; pause || pause ; present S then emit O else nothing end
+end
+end module
diff --git a/test/signalscope.in b/test/signalscope.in
@@ -0,0 +1,4 @@
+True
+True
+True
+True
diff --git a/test/signalscope.strl b/test/signalscope.strl
@@ -0,0 +1,5 @@
+module signalscope:
+input S;
+output T;
+signal E in emit E; emit T end
+end module
diff --git a/test/simplesuspend.in b/test/simplesuspend.in
@@ -0,0 +1,21 @@
+True
+True
+True
+True
+True
+True
+True
+True
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
diff --git a/test/simplesuspend.strl b/test/simplesuspend.strl
@@ -0,0 +1,8 @@
+module simplesuspend:
+input S;
+output T1, Ta, Tb, Tc;
+loop emit T1; pause; pause end || suspend
+    loop
+      emit Ta; pause; emit Tb; pause; emit Tc; pause
+    end when T1
+end module
diff --git a/test/simplesuspend2.in b/test/simplesuspend2.in
@@ -0,0 +1,21 @@
+True
+True
+True
+True
+True
+True
+True
+True
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
diff --git a/test/simplesuspend2.strl b/test/simplesuspend2.strl
@@ -0,0 +1,8 @@
+module simplesuspend2:
+input S;
+output T1, Ta, Tb, Tc;
+loop pause; emit T1; pause end || suspend
+    loop
+      emit Ta; pause; emit Tb; pause; emit Tc; pause
+    end when T1
+end module
diff --git a/test/suspendnothing.in b/test/suspendnothing.in
@@ -0,0 +1,10 @@
+True
+True
+False
+False
+True
+True
+True
+False
+False
+False
diff --git a/test/suspendnothing.strl b/test/suspendnothing.strl
@@ -0,0 +1,5 @@
+module suspendnothing:
+input S;
+output T;
+suspend nothing when S
+end module
diff --git a/test/traps.in b/test/traps.in
@@ -0,0 +1,8 @@
+True
+True
+True
+False
+False
+True
+True
+False
diff --git a/test/traps.strl b/test/traps.strl
@@ -0,0 +1,14 @@
+module traps:
+input I;
+output O;
+trap T in
+  loop
+    present I then
+      emit O;
+      pause
+    else
+      exit T
+    end
+  end
+end
+end module
diff --git a/test/trivialsuspend.in b/test/trivialsuspend.in
@@ -0,0 +1,21 @@
+True
+True
+True
+True
+True
+True
+True
+True
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
+False
diff --git a/test/trivialsuspend.strl b/test/trivialsuspend.strl
@@ -0,0 +1,5 @@
+module trivialsuspend:
+input S;
+output Ta, Tb, Tc, T1;
+suspend nothing when T1
+end module
diff --git a/testall.sh b/testall.sh
@@ -0,0 +1,39 @@
+#!/bin/bash
+
+function failed() {
+  #echo -ne '\E[31m'"\033[1mfailed!\033[0m "
+  echo -n "failed "
+}
+
+ls test/*.strl | while read a
+do
+  F=`basename $a`
+  F=${F%.strl}
+  printf "%-20s" "[$F] "
+  ./rungolden.sh $F 2> /dev/null > test/$F.golden || {
+    echo "error: ./rungolden.sh $F failed"
+    exit 4
+  }
+  LEN=`wc -l test/$F.golden | cut -d ' ' -f 1`
+  if [ $LEN -lt 2 ]
+  then
+    echo "error: no reference output"
+    exit 2
+  fi
+  ./runtest.sh $F 2> /dev/null > test/$F.test || {
+    echo "error: ./runtest.sh $F failed";
+    exit 4
+  }
+  if diff test/$F.test test/$F.golden > test/$F.diff
+  then
+    #echo -e '\E[32m'"\033[1mpassed\033[0m"
+    echo -e "passed"
+  else
+    failed
+    echo "with the following diff:"
+    cat test/$F.diff
+    exit 1
+  fi
+done
+exit 0
+