@env-spec/parser 0.0.1 → 0.0.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +21 -0
- package/dist/index.js +6 -45
- package/dist/index.js.map +1 -1
- package/dist/index.mjs +6 -45
- package/dist/index.mjs.map +1 -1
- package/dist/simple-resolver.js +12 -0
- package/dist/simple-resolver.js.map +1 -1
- package/dist/simple-resolver.mjs +12 -0
- package/dist/simple-resolver.mjs.map +1 -1
- package/package.json +6 -1
package/LICENSE
ADDED
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
MIT License
|
|
2
|
+
|
|
3
|
+
Copyright (c) 2025 DMNO Inc.
|
|
4
|
+
|
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
6
|
+
of this software and associated documentation files (the "Software"), to deal
|
|
7
|
+
in the Software without restriction, including without limitation the rights
|
|
8
|
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
9
|
+
copies of the Software, and to permit persons to whom the Software is
|
|
10
|
+
furnished to do so, subject to the following conditions:
|
|
11
|
+
|
|
12
|
+
The above copyright notice and this permission notice shall be included in all
|
|
13
|
+
copies or substantial portions of the Software.
|
|
14
|
+
|
|
15
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
16
|
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
17
|
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
18
|
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
19
|
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
20
|
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
21
|
+
SOFTWARE.
|
package/dist/index.js
CHANGED
|
@@ -1643,6 +1643,9 @@ function peg$parse(input, options) {
|
|
|
1643
1643
|
peg$currPos = s3;
|
|
1644
1644
|
s3 = peg$FAILED;
|
|
1645
1645
|
}
|
|
1646
|
+
if (s3 === peg$FAILED) {
|
|
1647
|
+
s3 = peg$parseFunctionArgValue();
|
|
1648
|
+
}
|
|
1646
1649
|
while (s3 !== peg$FAILED) {
|
|
1647
1650
|
s2.push(s3);
|
|
1648
1651
|
s3 = peg$currPos;
|
|
@@ -1695,6 +1698,9 @@ function peg$parse(input, options) {
|
|
|
1695
1698
|
peg$currPos = s4;
|
|
1696
1699
|
s4 = peg$FAILED;
|
|
1697
1700
|
}
|
|
1701
|
+
if (s4 === peg$FAILED) {
|
|
1702
|
+
s4 = peg$parseFunctionArgValue();
|
|
1703
|
+
}
|
|
1698
1704
|
if (s4 === peg$FAILED) {
|
|
1699
1705
|
peg$currPos = s3;
|
|
1700
1706
|
s3 = peg$FAILED;
|
|
@@ -1711,51 +1717,6 @@ function peg$parse(input, options) {
|
|
|
1711
1717
|
} else {
|
|
1712
1718
|
s1 = s2;
|
|
1713
1719
|
}
|
|
1714
|
-
if (s1 === peg$FAILED) {
|
|
1715
|
-
s1 = peg$currPos;
|
|
1716
|
-
s2 = [];
|
|
1717
|
-
s3 = peg$parseFunctionArgValue();
|
|
1718
|
-
while (s3 !== peg$FAILED) {
|
|
1719
|
-
s2.push(s3);
|
|
1720
|
-
s3 = peg$currPos;
|
|
1721
|
-
s4 = peg$currPos;
|
|
1722
|
-
s5 = peg$parse_();
|
|
1723
|
-
if (input.charCodeAt(peg$currPos) === 44) {
|
|
1724
|
-
s6 = peg$c9;
|
|
1725
|
-
peg$currPos++;
|
|
1726
|
-
} else {
|
|
1727
|
-
s6 = peg$FAILED;
|
|
1728
|
-
if (peg$silentFails === 0) {
|
|
1729
|
-
peg$fail(peg$e15);
|
|
1730
|
-
}
|
|
1731
|
-
}
|
|
1732
|
-
if (s6 !== peg$FAILED) {
|
|
1733
|
-
s7 = peg$parse_();
|
|
1734
|
-
s5 = [s5, s6, s7];
|
|
1735
|
-
s4 = s5;
|
|
1736
|
-
} else {
|
|
1737
|
-
peg$currPos = s4;
|
|
1738
|
-
s4 = peg$FAILED;
|
|
1739
|
-
}
|
|
1740
|
-
if (s4 !== peg$FAILED) {
|
|
1741
|
-
s4 = peg$parseFunctionArgValue();
|
|
1742
|
-
if (s4 === peg$FAILED) {
|
|
1743
|
-
peg$currPos = s3;
|
|
1744
|
-
s3 = peg$FAILED;
|
|
1745
|
-
} else {
|
|
1746
|
-
s3 = s4;
|
|
1747
|
-
}
|
|
1748
|
-
} else {
|
|
1749
|
-
s3 = s4;
|
|
1750
|
-
}
|
|
1751
|
-
}
|
|
1752
|
-
if (s2.length < 1) {
|
|
1753
|
-
peg$currPos = s1;
|
|
1754
|
-
s1 = peg$FAILED;
|
|
1755
|
-
} else {
|
|
1756
|
-
s1 = s2;
|
|
1757
|
-
}
|
|
1758
|
-
}
|
|
1759
1720
|
if (s1 !== peg$FAILED) {
|
|
1760
1721
|
peg$savedPos = s0;
|
|
1761
1722
|
s1 = peg$f11(s1);
|