Merge syndicate-js-syntax into monorepo
This commit is contained in:
commit
e0832331d0
|
@ -1,4 +1,6 @@
|
|||
scratch/
|
||||
node_modules/
|
||||
.nyc_output/
|
||||
coverage/
|
||||
coverage/
|
||||
dist/
|
||||
lib/
|
||||
node_modules/
|
||||
scratch/
|
||||
|
|
|
@ -0,0 +1,9 @@
|
|||
.PHONY: build
|
||||
|
||||
build: clean
|
||||
mkdir -p lib
|
||||
cat node_modules/@babel/parser/lib/index.js babel_parser_suffix.js > lib/babel_parser.js
|
||||
npx babel src --out-dir lib
|
||||
|
||||
clean:
|
||||
rm -rf lib
|
|
@ -0,0 +1,23 @@
|
|||
# @syndicate-lang/syntax
|
||||
|
||||
An extension of [Babel](https://babeljs.io/) (version 7.1.x) to
|
||||
translate [Syndicate](https://syndicate-lang.org/) syntactic
|
||||
constructs to core JavaScript.
|
||||
|
||||
## Licence
|
||||
|
||||
@syndicate-lang/syntax, a translator of Syndicate extensions to JS.
|
||||
Copyright (C) 2016-2018 Tony Garnock-Jones <tonyg@leastfixedpoint.com>
|
||||
|
||||
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 <https://www.gnu.org/licenses/>.
|
|
@ -0,0 +1,12 @@
|
|||
- `during`
|
||||
- `define/query`
|
||||
- [DONE] activation
|
||||
- web pack
|
||||
- drivers
|
||||
- timer
|
||||
- alert
|
||||
- `defer` statement
|
||||
- [DONE] remove ground dataspace syntax
|
||||
- some kind of `stop facet` statement
|
||||
- put a Symbol on the fields blob?
|
||||
- `react`
|
|
@ -0,0 +1,16 @@
|
|||
const presets = [
|
||||
[
|
||||
"@babel/env",
|
||||
{
|
||||
targets: {
|
||||
edge: "17",
|
||||
firefox: "60",
|
||||
chrome: "67",
|
||||
safari: "11.1",
|
||||
},
|
||||
useBuiltIns: "usage",
|
||||
},
|
||||
],
|
||||
];
|
||||
|
||||
module.exports = { presets };
|
|
@ -0,0 +1,10 @@
|
|||
// Horrible, horrible, horrible, horrible hack to get hold of the Parser
|
||||
// from babel-parser/src/parser/index.js.
|
||||
|
||||
exports._original_Parser = Parser;
|
||||
exports.__getParser = function () {
|
||||
return Parser;
|
||||
};
|
||||
exports.__setParser = function (newParser) {
|
||||
Parser = newParser;
|
||||
};
|
|
@ -0,0 +1,4 @@
|
|||
#!/usr/bin/env node
|
||||
|
||||
require("../lib/index");
|
||||
require("@babel/cli/lib/babel");
|
|
@ -0,0 +1,674 @@
|
|||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 3, 29 June 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The GNU 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 <https://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
|
||||
<https://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
|
||||
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
File diff suppressed because it is too large
Load Diff
|
@ -0,0 +1,29 @@
|
|||
{
|
||||
"name": "@syndicate-lang/syntax",
|
||||
"version": "0.0.5",
|
||||
"homepage": "https://github.com/syndicate-lang/syndicate-js-syntax",
|
||||
"license": "GPL-3.0+",
|
||||
"publishConfig": {
|
||||
"access": "public"
|
||||
},
|
||||
"repository": {
|
||||
"type": "git",
|
||||
"url": "git://github.com/syndicate-lang/syndicate-js-syntax"
|
||||
},
|
||||
"author": "Tony Garnock-Jones <tonyg@leastfixedpoint.com>",
|
||||
"scripts": {
|
||||
"prepare": "make build"
|
||||
},
|
||||
"devDependencies": {
|
||||
"@babel/preset-env": "^7.1.0"
|
||||
},
|
||||
"dependencies": {
|
||||
"@babel/cli": "^7.1.2",
|
||||
"@babel/core": "^7.1.2",
|
||||
"@babel/helper-plugin-utils": "^7.0.0",
|
||||
"@babel/polyfill": "^7.0.0"
|
||||
},
|
||||
"bin": {
|
||||
"syndicate-babel": "./bin/syndicate-babel.js"
|
||||
}
|
||||
}
|
|
@ -0,0 +1 @@
|
|||
module.exports = require("./lib/plugin");
|
|
@ -0,0 +1,124 @@
|
|||
//---------------------------------------------------------------------------
|
||||
// @syndicate-lang/syntax, a translator of Syndicate extensions to JS.
|
||||
// Copyright (C) 2016-2018 Tony Garnock-Jones <tonyg@leastfixedpoint.com>
|
||||
//
|
||||
// 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 <https://www.gnu.org/licenses/>.
|
||||
//---------------------------------------------------------------------------
|
||||
|
||||
import * as t from "@babel/types";
|
||||
|
||||
export function SpawnStatement(node) {
|
||||
this.word("spawn");
|
||||
this.space();
|
||||
if (node.name) {
|
||||
this.word("named");
|
||||
this.space();
|
||||
this.print(node.name, node);
|
||||
this.space();
|
||||
}
|
||||
this.printBlock(node);
|
||||
}
|
||||
|
||||
export function FieldDeclarationStatement(node) {
|
||||
this.word("field");
|
||||
this.space();
|
||||
this.print(node.member, node);
|
||||
if (node.init) {
|
||||
this.space();
|
||||
this.token("=");
|
||||
this.space();
|
||||
this.print(node.init, node);
|
||||
}
|
||||
this.semicolon();
|
||||
}
|
||||
|
||||
export function AssertionEndpointStatement(node) {
|
||||
this.word("assert");
|
||||
this.space();
|
||||
this.print(node.template, node);
|
||||
if (node.test) {
|
||||
this.space();
|
||||
this.word("when");
|
||||
this.space();
|
||||
this.token("(");
|
||||
this.print(node.test, node);
|
||||
this.token(")");
|
||||
}
|
||||
this.semicolon();
|
||||
}
|
||||
|
||||
export function DataflowStatement(node) {
|
||||
this.word("dataflow");
|
||||
this.space();
|
||||
this.print(node.body, node);
|
||||
}
|
||||
|
||||
export function EventHandlerEndpoint(node) {
|
||||
if (node.terminal) {
|
||||
this.word("stop");
|
||||
this.space();
|
||||
}
|
||||
this.word("on");
|
||||
this.space();
|
||||
if (node.triggerType === "dataflow") {
|
||||
this.token("(");
|
||||
this.print(node.pattern, node);
|
||||
this.token(")");
|
||||
} else {
|
||||
this.word(node.triggerType);
|
||||
this.space();
|
||||
this.print(node.pattern, node);
|
||||
}
|
||||
this.space();
|
||||
this.print(node.body, node);
|
||||
}
|
||||
|
||||
export function PseudoEventHandler(node) {
|
||||
this.word("on");
|
||||
this.space();
|
||||
this.word(node.triggerType);
|
||||
this.space();
|
||||
this.print(node.body, node);
|
||||
}
|
||||
|
||||
export function SyndicateTypeDefinition(node) {
|
||||
this.word(node.expectedUse);
|
||||
this.space();
|
||||
this.word("type");
|
||||
this.space();
|
||||
this.print(node.id, node);
|
||||
this.token("(");
|
||||
this._parameters(node.formals, node);
|
||||
this.token(")");
|
||||
if (node.wireName) {
|
||||
this.space();
|
||||
this.token("=");
|
||||
this.space();
|
||||
this.print(node.wireName, node);
|
||||
}
|
||||
this.semicolon();
|
||||
}
|
||||
|
||||
export function MessageSendStatement(node) {
|
||||
this.token("<<");
|
||||
this.space();
|
||||
this.print(node.body, node);
|
||||
this.semicolon();
|
||||
}
|
||||
|
||||
export function ActivationExpression(node) {
|
||||
this.word("activate");
|
||||
this.space();
|
||||
this.print(node.moduleExpr, node);
|
||||
}
|
|
@ -0,0 +1,109 @@
|
|||
"use strict";
|
||||
//---------------------------------------------------------------------------
|
||||
// @syndicate-lang/syntax, a translator of Syndicate extensions to JS.
|
||||
// Copyright (C) 2016-2018 Tony Garnock-Jones <tonyg@leastfixedpoint.com>
|
||||
//
|
||||
// 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 <https://www.gnu.org/licenses/>.
|
||||
//---------------------------------------------------------------------------
|
||||
|
||||
// Monkeypatch Babel in an utterly horrible way to support Syndicate
|
||||
// syntactic extensions to JS.
|
||||
|
||||
//---------------------------------------------------------------------------
|
||||
// (0) Replace the `isStatement` and `isExpression` functions with
|
||||
// non-hard-coded versions that check the contents of
|
||||
// FLIPPED_ALIAS_KEYS at the time of each call.
|
||||
//
|
||||
// This allows our later extensions to be picked up correctly.
|
||||
//
|
||||
var Validators = require("@babel/types/lib/validators/generated");
|
||||
var shallowEqual = require("@babel/types/lib/utils/shallowEqual");
|
||||
|
||||
function _isX(X, previous) {
|
||||
return (node, opts) => {
|
||||
if (node && Types.FLIPPED_ALIAS_KEYS[X].indexOf(node.type) !== -1) {
|
||||
return typeof opts === "undefined" || shallowEqual.default(node, opts);
|
||||
} else {
|
||||
return previous(node, opts);
|
||||
}
|
||||
};
|
||||
}
|
||||
|
||||
Validators.isStatement = _isX("Statement", Validators.isStatement);
|
||||
Validators.isExpression = _isX("Expression", Validators.isExpression);
|
||||
|
||||
//---------------------------------------------------------------------------
|
||||
// (1) Load the core parser in modifiable form.
|
||||
//
|
||||
// We do this by, in the build scripts, COPYING the parser COMPILED
|
||||
// code, and MODIFYING it to add a couple of new exports. See
|
||||
// `../babel_parser_suffix.js`.
|
||||
//
|
||||
// Here, then, we load the MODIFIED copy of the parser, and then
|
||||
// PRE-POPULATE THE REQUIRE CACHE with it. Later requires of the
|
||||
// ACTUAL module will then get our MODIFIED copy.
|
||||
//
|
||||
// Vile.
|
||||
//
|
||||
var BabelParser = require("./babel_parser");
|
||||
require.cache[require.resolve("@babel/parser")] = require.cache[require.resolve("./babel_parser")];
|
||||
|
||||
//---------------------------------------------------------------------------
|
||||
// (2) Install the new AST node types required.
|
||||
//
|
||||
// We do this by loading and populating the core TYPES array, and then
|
||||
// loading our extensions, followed by RESETTING the TYPES array to
|
||||
// include the new extensions as well as the original definitions.
|
||||
//
|
||||
var Types = require("@babel/types");
|
||||
require("./types");
|
||||
//
|
||||
// Now reset the TYPES array. This code is roughly equivalent to the
|
||||
// declaration of TYPES in babel-types/src/definitions/index.js:
|
||||
//
|
||||
// const TYPES: Array<string> = Object.keys(VISITOR_KEYS)
|
||||
// .concat(Object.keys(FLIPPED_ALIAS_KEYS))
|
||||
// .concat(Object.keys(DEPRECATED_KEYS));
|
||||
//
|
||||
Types.TYPES.splice(0);
|
||||
Array.prototype.push.apply(Types.TYPES, Object.keys(Types.VISITOR_KEYS));
|
||||
Array.prototype.push.apply(Types.TYPES, Object.keys(Types.FLIPPED_ALIAS_KEYS));
|
||||
Array.prototype.push.apply(Types.TYPES, Object.keys(Types.DEPRECATED_KEYS));
|
||||
|
||||
//---------------------------------------------------------------------------
|
||||
// (3) Install our modified parser in place of the core parser.
|
||||
//
|
||||
// This makes use of the modification we installed from
|
||||
// `../babel_parser_suffix.js` in step (1).
|
||||
//
|
||||
// It overrides the parser's notion of its root class -- effectively,
|
||||
// the Syndicate parser becomes a mixin.
|
||||
//
|
||||
BabelParser.__setParser(require("./parser").default);
|
||||
|
||||
//---------------------------------------------------------------------------
|
||||
// (4) Install generators for the new AST node types.
|
||||
//
|
||||
// This is mostly optional, unless for some reason we want only the
|
||||
// syntax extension but not the transform (e.g. if the plugin omitted
|
||||
// its `visitor`).
|
||||
var Generators = require("@babel/generator/lib/generators");
|
||||
var SyndicateGenerators = require("./generators");
|
||||
Object.keys(SyndicateGenerators).forEach((f) => {
|
||||
Generators[f] = SyndicateGenerators[f];
|
||||
});
|
||||
|
||||
//---------------------------------------------------------------------------
|
||||
// (5) At this point, we should (?) be able to load and use Babel
|
||||
// somewhat normally.
|
|
@ -0,0 +1,225 @@
|
|||
//---------------------------------------------------------------------------
|
||||
// @syndicate-lang/syntax, a translator of Syndicate extensions to JS.
|
||||
// Copyright (C) 2016-2018 Tony Garnock-Jones <tonyg@leastfixedpoint.com>
|
||||
//
|
||||
// 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 <https://www.gnu.org/licenses/>.
|
||||
//---------------------------------------------------------------------------
|
||||
|
||||
import { _original_Parser, tokTypes as tt } from "@babel/parser";
|
||||
|
||||
export default class SyndicateParser extends _original_Parser {
|
||||
// Overrides ExpressionParser.parseMaybeAssign
|
||||
parseMaybeAssign(noIn, refShorthandDefaultPos, afterLeftParse, refNeedsArrowPos) {
|
||||
let previousError = null;
|
||||
|
||||
if (this.isContextual("activate")) {
|
||||
let result = this.withBacktracking(
|
||||
() => {
|
||||
this.next();
|
||||
const node = this.startNode();
|
||||
node.moduleExpr = this.parseMaybeAssign(noIn, refShorthandDefaultPos, afterLeftParse, refNeedsArrowPos);
|
||||
return this.finishNode(node, "ActivationExpression");
|
||||
},
|
||||
(err) => {
|
||||
previousError = err;
|
||||
return null;
|
||||
});
|
||||
if (result) return result;
|
||||
}
|
||||
|
||||
try {
|
||||
return super.parseMaybeAssign(noIn, refShorthandDefaultPos, afterLeftParse, refNeedsArrowPos);
|
||||
} catch (err) {
|
||||
if (err instanceof SyntaxError && previousError && previousError.pos >= err.pos) {
|
||||
throw previousError;
|
||||
} else {
|
||||
throw err;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Overrides StatementParser.parseStatementContent
|
||||
parseStatementContent(declaration, topLevel) {
|
||||
let previousError = null;
|
||||
|
||||
switch (this.state.type) {
|
||||
case tt.bitShift:
|
||||
if (this.hasPlugin("syndicate") && (this.state.value === "<<")) {
|
||||
let result = this.withBacktracking(
|
||||
() => {
|
||||
this.next();
|
||||
const node = this.startNode();
|
||||
node.body = this.parseExpression();
|
||||
this.semicolon();
|
||||
return this.finishNode(node, "MessageSendStatement");
|
||||
},
|
||||
(err) => { previousError = err; return null; });
|
||||
if (result) return result;
|
||||
}
|
||||
break;
|
||||
|
||||
case tt.name:
|
||||
if (this.hasPlugin("syndicate")) {
|
||||
let result = this.withBacktracking(
|
||||
() => {
|
||||
if (this.isContextual("field")) {
|
||||
this.next();
|
||||
const node = this.startNode();
|
||||
node.member = this.parseExprSubscripts();
|
||||
if (node.member.type !== "MemberExpression") {
|
||||
this.raise(node.start, "Field declaration requires MemberExpression");
|
||||
}
|
||||
if (this.eat(tt.eq)) {
|
||||
node.init = this.parseExpression();
|
||||
}
|
||||
this.semicolon();
|
||||
return this.finishNode(node, "FieldDeclarationStatement");
|
||||
}
|
||||
|
||||
if (this.isContextual("spawn")) {
|
||||
this.next();
|
||||
const node = this.startNode();
|
||||
if (this.isContextual("named")) {
|
||||
this.next();
|
||||
node.name = this.parseExpression();
|
||||
}
|
||||
node.body = this.parseStatement();
|
||||
return this.finishNode(node, "SpawnStatement");
|
||||
}
|
||||
|
||||
if (this.isContextual("assert")) {
|
||||
this.next();
|
||||
const node = this.startNode();
|
||||
node.template = this.parseExpression();
|
||||
if (this.eatContextual("when")) {
|
||||
this.expect(tt.parenL);
|
||||
node.test = this.parseExpression();
|
||||
this.expect(tt.parenR);
|
||||
}
|
||||
this.semicolon();
|
||||
return this.finishNode(node, "AssertionEndpointStatement");
|
||||
}
|
||||
|
||||
if (this.isContextual("dataflow")) {
|
||||
this.next();
|
||||
const node = this.startNode();
|
||||
node.body = this.parseStatement();
|
||||
return this.finishNode(node, "DataflowStatement");
|
||||
}
|
||||
|
||||
if (this.isContextual("stop")) {
|
||||
this.next();
|
||||
return this.parseEventHandlerEndpoint(true, false);
|
||||
}
|
||||
|
||||
if (this.isContextual("on")) {
|
||||
return this.parseEventHandlerEndpoint(false, true);
|
||||
}
|
||||
|
||||
if (this.isContextual("assertion") || this.isContextual("message")) {
|
||||
const node = this.startNode();
|
||||
node.expectedUse = this.state.value;
|
||||
this.next();
|
||||
this.eatContextual("type");
|
||||
if (!this.match(tt.name)) { this.unexpected(null, tt.name); }
|
||||
node.id = this.parseIdentifier();
|
||||
this.parseFunctionParams(node); // eww
|
||||
node.formals = node.params;
|
||||
delete node.params; // eww
|
||||
if (this.eat(tt.eq)) {
|
||||
if (!this.match(tt.string)) { this.unexpected(null, tt.string); }
|
||||
node.wireName = this.parseLiteral(this.state.value, "StringLiteral");
|
||||
}
|
||||
this.semicolon();
|
||||
return this.finishNode(node, "SyndicateTypeDefinition");
|
||||
}
|
||||
|
||||
return null;
|
||||
},
|
||||
(err) => {
|
||||
previousError = err;
|
||||
return null;
|
||||
});
|
||||
if (result) return result;
|
||||
}
|
||||
}
|
||||
|
||||
try {
|
||||
return super.parseStatementContent(declaration, topLevel);
|
||||
} catch (err) {
|
||||
if (err instanceof SyntaxError && previousError && previousError.pos >= err.pos) {
|
||||
throw previousError;
|
||||
} else {
|
||||
throw err;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
withBacktracking(alt1, alt2) {
|
||||
const state = this.state.clone();
|
||||
try {
|
||||
return alt1();
|
||||
} catch (err) {
|
||||
if (err instanceof SyntaxError) {
|
||||
this.state = state;
|
||||
return alt2(err);
|
||||
} else {
|
||||
throw err;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
parseEventHandlerEndpoint(terminal, pseudoEventsAllowed) {
|
||||
this.expectContextual("on");
|
||||
const node = this.startNode();
|
||||
|
||||
if (this.match(tt.parenL)) {
|
||||
node.terminal = terminal;
|
||||
node.triggerType = "dataflow";
|
||||
node.pattern = this.parseExpression();
|
||||
node.body = this.parseStatement();
|
||||
return this.finishNode(node, "EventHandlerEndpoint");
|
||||
}
|
||||
|
||||
if (!this.match(tt.name)) {
|
||||
this.unexpected(
|
||||
null,
|
||||
"Expected endpoint trigger type ("
|
||||
+ (pseudoEventsAllowed ? "start/stop/" : "")
|
||||
+ "asserted/retracted/message/(...))");
|
||||
}
|
||||
|
||||
switch (this.state.value) {
|
||||
case "start":
|
||||
case "stop":
|
||||
node.triggerType = this.state.value;
|
||||
this.next();
|
||||
node.body = this.parseStatement();
|
||||
return this.finishNode(node, "PseudoEventHandler");
|
||||
|
||||
case "asserted":
|
||||
case "retracted":
|
||||
case "message":
|
||||
node.triggerType = this.state.value;
|
||||
this.next();
|
||||
node.terminal = terminal;
|
||||
node.pattern = this.parseExpression();
|
||||
node.body = this.parseStatement();
|
||||
return this.finishNode(node, "EventHandlerEndpoint");
|
||||
|
||||
default:
|
||||
this.unexpected(null, "Unknown event handler trigger type");
|
||||
}
|
||||
}
|
||||
}
|
|
@ -0,0 +1,385 @@
|
|||
//---------------------------------------------------------------------------
|
||||
// @syndicate-lang/syntax, a translator of Syndicate extensions to JS.
|
||||
// Copyright (C) 2016-2018 Tony Garnock-Jones <tonyg@leastfixedpoint.com>
|
||||
//
|
||||
// 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 <https://www.gnu.org/licenses/>.
|
||||
//---------------------------------------------------------------------------
|
||||
|
||||
import { declare } from "@babel/helper-plugin-utils";
|
||||
import { types as t } from "@babel/core";
|
||||
import { cloneDeep } from "@babel/types";
|
||||
import template from "@babel/template";
|
||||
import traverse from "@babel/traverse";
|
||||
|
||||
function maybeTerminalWrap(state, terminal, ast) {
|
||||
if (terminal) {
|
||||
return template(`DATASPACE._currentFacet.stop(() => { AST })`)({
|
||||
DATASPACE: state.DataspaceID,
|
||||
AST: ast
|
||||
});
|
||||
} else {
|
||||
return ast;
|
||||
}
|
||||
}
|
||||
|
||||
function isCaptureIdentifier(node) {
|
||||
return t.isIdentifier(node) && (node.name[0] === '$') && (node.name.length > 1);
|
||||
}
|
||||
|
||||
function hasCapturesOrDiscards(nodePath) {
|
||||
var result = false;
|
||||
nodePath.traverse({
|
||||
enter(path) {
|
||||
if (isCaptureIdentifier(path.node)) {
|
||||
result = true;
|
||||
path.stop();
|
||||
} else if (t.isIdentifier(path.node) && (path.node.name === '_')) {
|
||||
result = true;
|
||||
path.stop();
|
||||
}
|
||||
}
|
||||
});
|
||||
return result;
|
||||
}
|
||||
|
||||
const _discardAst = template.expression(`SYNDICATE.__`, { placeholderPattern: /^[A-Z]+$/ });
|
||||
function discardAst(state) {
|
||||
return _discardAst({ SYNDICATE: state.SyndicateID });
|
||||
}
|
||||
|
||||
const _listAst = template.expression(`IMMUTABLE.List(VS)`);
|
||||
function listAst(state, vs) {
|
||||
return _listAst({ IMMUTABLE: state.ImmutableID, VS: vs });
|
||||
}
|
||||
|
||||
function captureWrap(state, idNode, ast) {
|
||||
return template.expression(`SYNDICATE._$(NAME, PATTERN)`, { placeholderPattern: /^[A-Z]+$/ })({
|
||||
SYNDICATE: state.SyndicateID,
|
||||
NAME: t.stringLiteral(idNode.name.slice(1)),
|
||||
PATTERN: ast
|
||||
});
|
||||
}
|
||||
|
||||
function astifySyndicatePath(state, a) {
|
||||
if (typeof a === 'number') {
|
||||
return t.numericLiteral(a);
|
||||
} else if (Array.isArray(a)) {
|
||||
return listAst(state, t.arrayExpression(a.map((aa) => astifySyndicatePath(state, aa))));
|
||||
} else {
|
||||
throw new Error("Cannot astify ostensible Syndicate path: " + a);
|
||||
}
|
||||
}
|
||||
|
||||
function compilePattern(state, patternPath) {
|
||||
let constPaths = [];
|
||||
let constVals = [];
|
||||
let capturePaths = [];
|
||||
let captureNames = [];
|
||||
let syndicatePath = [];
|
||||
|
||||
function pushCapture(idNode) {
|
||||
capturePaths.push(syndicatePath.slice());
|
||||
captureNames.push(idNode.name.slice(1));
|
||||
}
|
||||
|
||||
function pushConstant(node) {
|
||||
constPaths.push(syndicatePath.slice());
|
||||
constVals.push(node);
|
||||
}
|
||||
|
||||
function walk(patternPath) {
|
||||
let pattern = patternPath.node;
|
||||
switch (pattern.type) {
|
||||
case 'CallExpression':
|
||||
if (isCaptureIdentifier(pattern.callee) && (pattern.arguments.length === 1)) {
|
||||
// It's a capture with a nested subpattern.
|
||||
pushCapture(pattern.callee);
|
||||
let [s, a] = walk(patternPath.get('arguments.0'));
|
||||
return [s, captureWrap(state, pattern.callee, a)];
|
||||
} else {
|
||||
// It's a regular call. If there are nested captures or
|
||||
// discards, this indicates the programmer believes it to be
|
||||
// a constructor, in which case it should contribute to the
|
||||
// skeleton, otherwise the programmer believes it to be a
|
||||
// constant, in which case it should contribute to
|
||||
// constPaths/constVals.
|
||||
if (hasCapturesOrDiscards(patternPath)) {
|
||||
let arity = pattern.arguments.length;
|
||||
let skel = [t.memberExpression(pattern.callee, t.identifier('meta'), false, false)];
|
||||
let assn = [];
|
||||
for (let i = 0; i < arity; i++) {
|
||||
syndicatePath.push(i);
|
||||
let [s, a] = walk(patternPath.get('arguments.' + i));
|
||||
skel.push(s);
|
||||
assn.push(a);
|
||||
syndicatePath.pop();
|
||||
}
|
||||
return [t.arrayExpression(skel), t.callExpression(pattern.callee, assn)];
|
||||
} else {
|
||||
pushConstant(pattern);
|
||||
return [t.nullLiteral(), pattern];
|
||||
}
|
||||
}
|
||||
|
||||
case 'Identifier':
|
||||
if (pattern.name === '_') {
|
||||
// do nothing -- this is a discard
|
||||
return [t.nullLiteral(), discardAst(state)];
|
||||
} else if (isCaptureIdentifier(pattern)) {
|
||||
pushCapture(pattern);
|
||||
return [t.nullLiteral(), captureWrap(state, pattern, discardAst(state))];
|
||||
} else {
|
||||
pushConstant(pattern);
|
||||
return [t.nullLiteral(), pattern];
|
||||
}
|
||||
|
||||
default:
|
||||
console.error('Unsupported pattern node type', pattern);
|
||||
pushConstant(pattern);
|
||||
return [t.nullLiteral(), pattern];
|
||||
}
|
||||
}
|
||||
|
||||
let [skeleton, assertion] = walk(patternPath);
|
||||
|
||||
return {
|
||||
skeletonAst: skeleton,
|
||||
constPathsAst: astifySyndicatePath(state, constPaths),
|
||||
constValsAst: listAst(state, t.arrayExpression(constVals)),
|
||||
capturePathsAst: astifySyndicatePath(state, capturePaths),
|
||||
captureNames: captureNames,
|
||||
assertionAst: template.expression(`SYNDICATE.Observe(ASSERTION)`)({
|
||||
SYNDICATE: state.SyndicateID,
|
||||
ASSERTION: assertion
|
||||
}),
|
||||
};
|
||||
}
|
||||
|
||||
function translateEndpoint(state, path, expectedEvt) {
|
||||
const { node } = path;
|
||||
let info = compilePattern(state, path.get('pattern'));
|
||||
let _evt = path.scope.generateUidIdentifier("evt");
|
||||
let _vs = path.scope.generateUidIdentifier("vs");
|
||||
path.replaceWith(template(
|
||||
`DATASPACE._currentFacet.addEndpoint(function () {
|
||||
let HANDLER = {
|
||||
skeleton: SKELETON,
|
||||
constPaths: CONSTPATHS,
|
||||
constVals: CONSTVALS,
|
||||
capturePaths: CAPTUREPATHS,
|
||||
callback: DATASPACE.wrap((EVT, VS) => {
|
||||
if (EVT === EXPECTED) {
|
||||
INITS;
|
||||
DATASPACE._currentFacet.actor.scheduleScript(() => {
|
||||
BODY;
|
||||
});
|
||||
}
|
||||
})
|
||||
};
|
||||
return [ASSERTION, HANDLER];
|
||||
});`)({
|
||||
DATASPACE: state.DataspaceID,
|
||||
HANDLER: path.scope.generateUidIdentifier("handler"),
|
||||
SKELETON: info.skeletonAst,
|
||||
CONSTPATHS: info.constPathsAst,
|
||||
CONSTVALS: info.constValsAst,
|
||||
CAPTUREPATHS: info.capturePathsAst,
|
||||
EVT: _evt,
|
||||
EXPECTED: expectedEvt,
|
||||
VS: _vs,
|
||||
INITS: info.captureNames.map((n, i) => template(`let N = VS.get(I);`)({
|
||||
N: t.identifier(n),
|
||||
VS: _vs,
|
||||
I: t.numericLiteral(i),
|
||||
})),
|
||||
BODY: maybeTerminalWrap(state, node.terminal, node.body),
|
||||
ASSERTION: info.assertionAst,
|
||||
}));
|
||||
}
|
||||
|
||||
export default declare((api, options) => {
|
||||
api.assertVersion(7);
|
||||
|
||||
return {
|
||||
manipulateOptions(opts, parserOpts) {
|
||||
parserOpts.plugins.push("syndicate");
|
||||
},
|
||||
|
||||
visitor: {
|
||||
Program(path, state) {
|
||||
let savedGlobalFacetUid = path.scope.generateUidIdentifier("savedGlobalFacet");
|
||||
state.ImmutableID = path.scope.generateUidIdentifier("Immutable");
|
||||
state.SyndicateID = path.scope.generateUidIdentifier("Syndicate");
|
||||
state.DataspaceID = path.scope.generateUidIdentifier("Dataspace");
|
||||
state.SkeletonID = path.scope.generateUidIdentifier("Skeleton");
|
||||
state.StructID = path.scope.generateUidIdentifier("Struct");
|
||||
path.unshiftContainer(
|
||||
'body',
|
||||
template(`const SYNDICATE = require("@syndicate-lang/core");
|
||||
const IMMUTABLE = SYNDICATE.Immutable;
|
||||
const DATASPACE = SYNDICATE.Dataspace;
|
||||
const SKELETON = SYNDICATE.Skeleton;
|
||||
const STRUCT = SYNDICATE.Struct;
|
||||
let SAVEDGLOBALFACET = DATASPACE._currentFacet;
|
||||
DATASPACE._currentFacet = new SYNDICATE._Dataspace.ActionCollector();`)({
|
||||
IMMUTABLE: state.ImmutableID,
|
||||
SYNDICATE: state.SyndicateID,
|
||||
DATASPACE: state.DataspaceID,
|
||||
SKELETON: state.SkeletonID,
|
||||
STRUCT: state.StructID,
|
||||
SAVEDGLOBALFACET: savedGlobalFacetUid,
|
||||
}));
|
||||
path.pushContainer(
|
||||
'body',
|
||||
template(`module.exports[DATASPACE.BootSteps] = {
|
||||
module: module,
|
||||
steps: DATASPACE._currentFacet.actions
|
||||
};
|
||||
DATASPACE._currentFacet = SAVEDGLOBALFACET;
|
||||
SAVEDGLOBALFACET = null;
|
||||
if (require.main === module) {
|
||||
SYNDICATE.bootModule(module);
|
||||
}`)({
|
||||
DATASPACE: state.DataspaceID,
|
||||
SYNDICATE: state.SyndicateID,
|
||||
SAVEDGLOBALFACET: savedGlobalFacetUid,
|
||||
}));
|
||||
},
|
||||
|
||||
SpawnStatement(path, state) {
|
||||
const { node } = path;
|
||||
path.replaceWith(template(`DATASPACE.spawn(NAME, function () { BODY })`)({
|
||||
DATASPACE: state.DataspaceID,
|
||||
NAME: node.name || t.nullLiteral(),
|
||||
BODY: node.body
|
||||
}));
|
||||
},
|
||||
|
||||
FieldDeclarationStatement(path, state) {
|
||||
const { node } = path;
|
||||
let prop = node.member.computed
|
||||
? node.member.property
|
||||
: t.stringLiteral(node.member.property.name);
|
||||
path.replaceWith(template(`DATASPACE.declareField(HOLDER, PROP, INIT);`)({
|
||||
DATASPACE: state.DataspaceID,
|
||||
HOLDER: node.member.object,
|
||||
PROP: prop,
|
||||
INIT: node.init || path.scope.buildUndefinedNode()
|
||||
}));
|
||||
},
|
||||
|
||||
AssertionEndpointStatement(path, state) {
|
||||
const { node } = path;
|
||||
if (node.test) {
|
||||
path.replaceWith(template(`DATASPACE._currentFacet.addEndpoint(function () {
|
||||
return (TEST) ? [TEMPLATE, null] : [void 0, null];
|
||||
});`)({
|
||||
DATASPACE: state.DataspaceID,
|
||||
TEST: node.test,
|
||||
TEMPLATE: node.template,
|
||||
}));
|
||||
} else {
|
||||
path.replaceWith(template(`DATASPACE._currentFacet.addEndpoint(function () {
|
||||
return [TEMPLATE, null];
|
||||
});`)({
|
||||
DATASPACE: state.DataspaceID,
|
||||
TEMPLATE: node.template,
|
||||
}));
|
||||
}
|
||||
},
|
||||
|
||||
DataflowStatement(path, state) {
|
||||
const { node } = path;
|
||||
path.replaceWith(template(`DATASPACE._currentFacet.addDataflow(function () { BODY });`)({
|
||||
DATASPACE: state.DataspaceID,
|
||||
BODY: node.body,
|
||||
}));
|
||||
},
|
||||
|
||||
EventHandlerEndpoint(path, state) {
|
||||
const { node } = path;
|
||||
switch (node.triggerType) {
|
||||
case "dataflow":
|
||||
path.replaceWith(template(`DATASPACE._currentFacet.addDataflow(function () {
|
||||
if (PATTERN) { BODY }
|
||||
});`)({
|
||||
DATASPACE: state.DataspaceID,
|
||||
PATTERN: node.pattern,
|
||||
BODY: maybeTerminalWrap(state, node.terminal, node.body),
|
||||
}));
|
||||
break;
|
||||
|
||||
case "asserted":
|
||||
translateEndpoint(state, path, state.SkeletonID.name + ".EVENT_ADDED");
|
||||
break;
|
||||
case "retracted":
|
||||
translateEndpoint(state, path, state.SkeletonID.name + ".EVENT_REMOVED");
|
||||
break;
|
||||
case "message":
|
||||
translateEndpoint(state, path, state.SkeletonID.name + ".EVENT_MESSAGE");
|
||||
break;
|
||||
|
||||
default:
|
||||
console.warn("UNHANDLED event handler endpoint triggerType " + node.triggerType);
|
||||
break;
|
||||
}
|
||||
},
|
||||
|
||||
PseudoEventHandler(path, state) {
|
||||
const { node } = path;
|
||||
if (node.triggerType === "start") {
|
||||
path.replaceWith(template(`DATASPACE._currentFacet.actor.scheduleScript(() => {
|
||||
BODY;
|
||||
});`)({
|
||||
DATASPACE: state.DataspaceID,
|
||||
BODY: node.body,
|
||||
}));
|
||||
} else {
|
||||
path.replaceWith(template(`DATASPACE._currentFacet.addStopScript(function () {
|
||||
BODY;
|
||||
});`)({
|
||||
DATASPACE: state.DataspaceID,
|
||||
BODY: node.body,
|
||||
}));
|
||||
}
|
||||
},
|
||||
|
||||
SyndicateTypeDefinition(path, state) {
|
||||
const { node } = path;
|
||||
path.replaceWith(template(`const ID = STRUCT.makeConstructor(WIRE, FORMALS);`)({
|
||||
ID: node.id,
|
||||
STRUCT: state.StructID,
|
||||
WIRE: node.wireName || t.stringLiteral(node.id.name),
|
||||
FORMALS: t.arrayExpression(node.formals.map((f) => t.stringLiteral(f.name))),
|
||||
}));
|
||||
},
|
||||
|
||||
MessageSendStatement(path, state) {
|
||||
const { node } = path;
|
||||
path.replaceWith(template(`DATASPACE.send(BODY);`)({
|
||||
DATASPACE: state.DataspaceID,
|
||||
BODY: node.body
|
||||
}));
|
||||
},
|
||||
|
||||
ActivationExpression(path, state) {
|
||||
const { node } = path;
|
||||
path.replaceWith(template.expression(`DATASPACE.activate(MODULE)`)({
|
||||
DATASPACE: state.DataspaceID,
|
||||
MODULE: node.moduleExpr,
|
||||
}));
|
||||
},
|
||||
},
|
||||
};
|
||||
});
|
|
@ -0,0 +1,161 @@
|
|||
//---------------------------------------------------------------------------
|
||||
// @syndicate-lang/syntax, a translator of Syndicate extensions to JS.
|
||||
// Copyright (C) 2016-2018 Tony Garnock-Jones <tonyg@leastfixedpoint.com>
|
||||
//
|
||||
// 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 <https://www.gnu.org/licenses/>.
|
||||
//---------------------------------------------------------------------------
|
||||
|
||||
import defineType, {
|
||||
assertEach,
|
||||
assertNodeType,
|
||||
assertValueType,
|
||||
assertOneOf,
|
||||
chain,
|
||||
} from "@babel/types/lib/definitions/utils";
|
||||
|
||||
defineType("SpawnStatement", {
|
||||
builder: ["name", "body"],
|
||||
visitor: ["name", "body"],
|
||||
aliases: ["Statement"],
|
||||
fields: {
|
||||
name: {
|
||||
validate: assertNodeType("Expression"),
|
||||
optional: true,
|
||||
},
|
||||
body: {
|
||||
validate: assertNodeType("Statement"),
|
||||
},
|
||||
},
|
||||
});
|
||||
|
||||
defineType("FieldDeclarationStatement", {
|
||||
builder: ["member", "init"],
|
||||
visitor: ["member", "init"],
|
||||
aliases: ["Statement"],
|
||||
fields: {
|
||||
member: {
|
||||
validate: assertNodeType("MemberExpression"),
|
||||
},
|
||||
init: {
|
||||
validate: assertNodeType("Expression"),
|
||||
optional: true,
|
||||
},
|
||||
},
|
||||
});
|
||||
|
||||
defineType("AssertionEndpointStatement", {
|
||||
builder: ["template", "test"],
|
||||
visitor: ["template", "test"],
|
||||
aliases: ["Statement"],
|
||||
fields: {
|
||||
template: {
|
||||
validate: assertNodeType("Expression"),
|
||||
},
|
||||
test: {
|
||||
validate: assertNodeType("Expression"),
|
||||
optional: true,
|
||||
},
|
||||
},
|
||||
});
|
||||
|
||||
defineType("DataflowStatement", {
|
||||
builder: ["body"],
|
||||
visitor: ["body"],
|
||||
aliases: ["Statement"],
|
||||
fields: {
|
||||
body: {
|
||||
validate: assertNodeType("Statement"),
|
||||
},
|
||||
},
|
||||
});
|
||||
|
||||
defineType("EventHandlerEndpoint", {
|
||||
builder: ["terminal", "triggerType", "pattern", "body"],
|
||||
visitor: ["terminal", "triggerType", "pattern", "body"],
|
||||
aliases: ["Statement"],
|
||||
fields: {
|
||||
terminal: {
|
||||
validate: assertOneOf(true, false),
|
||||
},
|
||||
triggerType: {
|
||||
validate: assertOneOf("asserted", "retracted", "message", "dataflow"),
|
||||
},
|
||||
pattern: {
|
||||
validate: assertNodeType("Expression"),
|
||||
},
|
||||
body: {
|
||||
validate: assertNodeType("Statement"),
|
||||
},
|
||||
}
|
||||
});
|
||||
|
||||
defineType("PseudoEventHandler", {
|
||||
builder: ["triggerType", "body"],
|
||||
visitor: ["triggerType", "body"],
|
||||
aliases: ["Statement"],
|
||||
fields: {
|
||||
triggerType: {
|
||||
validate: assertOneOf("start", "stop"),
|
||||
},
|
||||
body: {
|
||||
validate: assertNodeType("Statement"),
|
||||
},
|
||||
}
|
||||
});
|
||||
|
||||
defineType("SyndicateTypeDefinition", {
|
||||
builder: ["expectedUse", "id", "formals", "wireName"],
|
||||
visitor: ["expectedUse", "id", "formals", "wireName"],
|
||||
aliases: ["Statement"],
|
||||
fields: {
|
||||
expectedUse: {
|
||||
validate: assertOneOf("message", "assertion"),
|
||||
},
|
||||
id: {
|
||||
validate: assertNodeType("Identifier"),
|
||||
},
|
||||
formals: {
|
||||
validate: chain(
|
||||
assertValueType("array"),
|
||||
assertEach(assertNodeType("Identifier")),
|
||||
),
|
||||
},
|
||||
wireName: {
|
||||
validate: assertNodeType("StringLiteral"),
|
||||
optional: true,
|
||||
},
|
||||
}
|
||||
});
|
||||
|
||||
defineType("MessageSendStatement", {
|
||||
builder: ["body"],
|
||||
visitor: ["body"],
|
||||
aliases: ["Statement"],
|
||||
fields: {
|
||||
body: {
|
||||
validate: assertNodeType("Expression"),
|
||||
},
|
||||
},
|
||||
});
|
||||
|
||||
defineType("ActivationExpression", {
|
||||
builder: ["moduleExpr"],
|
||||
visitor: ["moduleExpr"],
|
||||
aliases: ["Expression"],
|
||||
fields: {
|
||||
moduleExpr: {
|
||||
validate: assertNodeType("Expression"),
|
||||
},
|
||||
},
|
||||
});
|
Loading…
Reference in New Issue