├── .github └── ISSUE_TEMPLATE │ ├── bug-report.md │ └── feature_request.md ├── .gitignore ├── CODE_OF_CONDUCT.md ├── CONTRIBUTING.md ├── Cargo.lock ├── Cargo.toml ├── LICENSE ├── README.md ├── sap-lang-repl ├── .gitignore ├── Cargo.lock ├── Cargo.toml └── src │ └── main.rs ├── sap ├── .gitignore ├── Cargo.toml └── src │ └── main.rs └── src ├── lib.rs ├── parser ├── expr │ ├── literal │ │ ├── char.rs │ │ ├── mod.rs │ │ ├── number.rs │ │ └── string.rs │ └── mod.rs ├── mod.rs ├── top_level.rs └── ty.rs ├── state ├── evaluator │ ├── mod.rs │ └── value.rs ├── mod.rs ├── std │ ├── mod.rs │ ├── numerical.rs │ └── serde.rs └── type_checker │ ├── elab.rs │ └── mod.rs └── utils.rs /.github/ISSUE_TEMPLATE/bug-report.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Bug report 3 | about: Create a report to help us improve 4 | title: "[BUG]" 5 | labels: bug 6 | assignees: LemonHX 7 | 8 | --- 9 | 10 | **Describe the bug** 11 | A clear and concise description of what the bug is. 12 | for example `panic when file {your file gist} when executing` 13 | 14 | **To Reproduce** 15 | Steps to reproduce the behavior: 16 | 1. Go to '...' 17 | 2. Click on '....' 18 | 3. Scroll down to '....' 19 | 4. See error 20 | 21 | **Expected behavior** 22 | A clear and concise description of what you expected to happen. 23 | 24 | **Screenshots** 25 | If applicable, add screenshots to help explain your problem. 26 | 27 | **Env (please complete the following information):** 28 | - OS: [e.g. iOS] 29 | - Browser [e.g. chrome, safari] 30 | - Version [e.g. 22] 31 | 32 | **Additional context** 33 | Add any other context about the problem here. 34 | -------------------------------------------------------------------------------- /.github/ISSUE_TEMPLATE/feature_request.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Feature request 3 | about: Suggest an idea for this project 4 | title: "[FEATURE]" 5 | labels: enhancement 6 | assignees: LemonHX 7 | 8 | --- 9 | 10 | **Is your feature request related to a problem? Please describe.** 11 | A clear and concise description of what the problem is. Ex. I'm always frustrated when [...] 12 | 13 | **Describe the solution you'd like** 14 | A clear and concise description of what you want to happen. 15 | 16 | **Describe alternatives you've considered** 17 | A clear and concise description of any alternative solutions or features you've considered. 18 | 19 | **Additional context** 20 | Add any other context or screenshots about the feature request here. 21 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | /target 2 | *.txt 3 | /.vscode 4 | .idea/ -------------------------------------------------------------------------------- /CODE_OF_CONDUCT.md: -------------------------------------------------------------------------------- 1 | # Contributor Covenant Code of Conduct 2 | 3 | ## Our Pledge 4 | 5 | We as members, contributors, and leaders pledge to make participation in our 6 | community a harassment-free experience for everyone, regardless of age, body 7 | size, visible or invisible disability, ethnicity, sex characteristics, gender 8 | identity and expression, level of experience, education, socio-economic status, 9 | nationality, personal appearance, race, religion, or sexual identity 10 | and orientation. 11 | 12 | We pledge to act and interact in ways that contribute to an open, welcoming, 13 | diverse, inclusive, and healthy community. 14 | 15 | ## Our Standards 16 | 17 | Examples of behavior that contributes to a positive environment for our 18 | community include: 19 | 20 | * Demonstrating empathy and kindness toward other people 21 | * Being respectful of differing opinions, viewpoints, and experiences 22 | * Giving and gracefully accepting constructive feedback 23 | * Accepting responsibility and apologizing to those affected by our mistakes, 24 | and learning from the experience 25 | * Focusing on what is best not just for us as individuals, but for the 26 | overall community 27 | 28 | Examples of unacceptable behavior include: 29 | 30 | * The use of sexualized language or imagery, and sexual attention or 31 | advances of any kind 32 | * Trolling, insulting or derogatory comments, and personal or political attacks 33 | * Public or private harassment 34 | * Publishing others' private information, such as a physical or email 35 | address, without their explicit permission 36 | * Other conduct which could reasonably be considered inappropriate in a 37 | professional setting 38 | 39 | ## Enforcement Responsibilities 40 | 41 | Community leaders are responsible for clarifying and enforcing our standards of 42 | acceptable behavior and will take appropriate and fair corrective action in 43 | response to any behavior that they deem inappropriate, threatening, offensive, 44 | or harmful. 45 | 46 | Community leaders have the right and responsibility to remove, edit, or reject 47 | comments, commits, code, wiki edits, issues, and other contributions that are 48 | not aligned to this Code of Conduct, and will communicate reasons for moderation 49 | decisions when appropriate. 50 | 51 | ## Scope 52 | 53 | This Code of Conduct applies within all community spaces, and also applies when 54 | an individual is officially representing the community in public spaces. 55 | Examples of representing our community include using an official e-mail address, 56 | posting via an official social media account, or acting as an appointed 57 | representative at an online or offline event. 58 | 59 | ## Enforcement 60 | 61 | Instances of abusive, harassing, or otherwise unacceptable behavior may be 62 | reported to the community leaders responsible for enforcement at 63 | email: `lemonhx@lemonhx.tech` phone: `+86 15031155513` telegram:`@lemonhx` . 64 | All complaints will be reviewed and investigated promptly and fairly. 65 | 66 | All community leaders are obligated to respect the privacy and security of the 67 | reporter of any incident. 68 | 69 | ## Enforcement Guidelines 70 | 71 | Community leaders will follow these Community Impact Guidelines in determining 72 | the consequences for any action they deem in violation of this Code of Conduct: 73 | 74 | ### 1. Correction 75 | 76 | **Community Impact**: Use of inappropriate language or other behavior deemed 77 | unprofessional or unwelcome in the community. 78 | 79 | **Consequence**: A private, written warning from community leaders, providing 80 | clarity around the nature of the violation and an explanation of why the 81 | behavior was inappropriate. A public apology may be requested. 82 | 83 | ### 2. Warning 84 | 85 | **Community Impact**: A violation through a single incident or series 86 | of actions. 87 | 88 | **Consequence**: A warning with consequences for continued behavior. No 89 | interaction with the people involved, including unsolicited interaction with 90 | those enforcing the Code of Conduct, for a specified period of time. This 91 | includes avoiding interactions in community spaces as well as external channels 92 | like social media. Violating these terms may lead to a temporary or 93 | permanent ban. 94 | 95 | ### 3. Temporary Ban 96 | 97 | **Community Impact**: A serious violation of community standards, including 98 | sustained inappropriate behavior. 99 | 100 | **Consequence**: A temporary ban from any sort of interaction or public 101 | communication with the community for a specified period of time. No public or 102 | private interaction with the people involved, including unsolicited interaction 103 | with those enforcing the Code of Conduct, is allowed during this period. 104 | Violating these terms may lead to a permanent ban. 105 | 106 | ### 4. Permanent Ban 107 | 108 | **Community Impact**: Demonstrating a pattern of violation of community 109 | standards, including sustained inappropriate behavior, harassment of an 110 | individual, or aggression toward or disparagement of classes of individuals. 111 | 112 | **Consequence**: A permanent ban from any sort of public interaction within 113 | the community. 114 | 115 | ## Attribution 116 | 117 | This Code of Conduct is adapted from the [Contributor Covenant][homepage], 118 | version 2.0, available at 119 | https://www.contributor-covenant.org/version/2/0/code_of_conduct.html. 120 | 121 | Community Impact Guidelines were inspired by [Mozilla's code of conduct 122 | enforcement ladder](https://github.com/mozilla/diversity). 123 | 124 | [homepage]: https://www.contributor-covenant.org 125 | 126 | For answers to common questions about this code of conduct, see the FAQ at 127 | https://www.contributor-covenant.org/faq. Translations are available at 128 | https://www.contributor-covenant.org/translations. 129 | -------------------------------------------------------------------------------- /CONTRIBUTING.md: -------------------------------------------------------------------------------- 1 | In view of the fact that the law `GPLv3` of the country where I live is classified as copyright in jurisprudence, but currently other open source agreements are not supported by the law, so I hope you understand. 2 | At the same time, if the more lenient agreement is supported by the jurisprudence in my country, I will notify you and change the open source agreement of the project, for example switching to `3-clause BSD`. 3 | 4 | 鉴于我所处的国家的法律`GPLv3`在判例上是被划分成著作权的，但是其他的开源协议并不受法律支持，所以希望大家理解。 5 | 同时，如果更加宽松的协议在我所在的国家获得了判例上的支持，我会通知你并更改项目的开源协议，如切换到`3-clause BSD`. 6 | -------------------------------------------------------------------------------- /Cargo.lock: -------------------------------------------------------------------------------- 1 | # This file is automatically @generated by Cargo. 2 | # It is not intended for manual editing. 3 | version = 3 4 | 5 | [[package]] 6 | name = "ansi_term" 7 | version = "0.11.0" 8 | source = "registry+https://github.com/rust-lang/crates.io-index" 9 | checksum = "ee49baf6cb617b853aa8d93bf420db2383fab46d314482ca2803b40d5fde979b" 10 | dependencies = [ 11 | "winapi", 12 | ] 13 | 14 | [[package]] 15 | name = "atty" 16 | version = "0.2.14" 17 | source = "registry+https://github.com/rust-lang/crates.io-index" 18 | checksum = "d9b39be18770d11421cdb1b9947a45dd3f37e93092cbf377614828a319d5fee8" 19 | dependencies = [ 20 | "hermit-abi", 21 | "libc", 22 | "winapi", 23 | ] 24 | 25 | [[package]] 26 | name = "autocfg" 27 | version = "1.0.1" 28 | source = "registry+https://github.com/rust-lang/crates.io-index" 29 | checksum = "cdb031dd78e28731d87d56cc8ffef4a8f36ca26c38fe2de700543e627f8a464a" 30 | 31 | [[package]] 32 | name = "bitflags" 33 | version = "1.2.1" 34 | source = "registry+https://github.com/rust-lang/crates.io-index" 35 | checksum = "cf1de2fe8c75bc145a2f577add951f8134889b4795d47466a54a5c846d691693" 36 | 37 | [[package]] 38 | name = "bytecount" 39 | version = "0.6.2" 40 | source = "registry+https://github.com/rust-lang/crates.io-index" 41 | checksum = "72feb31ffc86498dacdbd0fcebb56138e7177a8cc5cea4516031d15ae85a742e" 42 | 43 | [[package]] 44 | name = "cc" 45 | version = "1.0.70" 46 | source = "registry+https://github.com/rust-lang/crates.io-index" 47 | checksum = "d26a6ce4b6a484fa3edb70f7efa6fc430fd2b87285fe8b84304fd0936faa0dc0" 48 | 49 | [[package]] 50 | name = "cfg-if" 51 | version = "1.0.0" 52 | source = "registry+https://github.com/rust-lang/crates.io-index" 53 | checksum = "baf1de4339761588bc0619e3cbc0120ee582ebb74b53b4efbf79117bd2da40fd" 54 | 55 | [[package]] 56 | name = "clap" 57 | version = "2.33.3" 58 | source = "registry+https://github.com/rust-lang/crates.io-index" 59 | checksum = "37e58ac78573c40708d45522f0d80fa2f01cc4f9b4e2bf749807255454312002" 60 | dependencies = [ 61 | "ansi_term", 62 | "atty", 63 | "bitflags", 64 | "strsim", 65 | "textwrap", 66 | "unicode-width", 67 | "vec_map", 68 | ] 69 | 70 | [[package]] 71 | name = "clipboard-win" 72 | version = "4.2.1" 73 | source = "registry+https://github.com/rust-lang/crates.io-index" 74 | checksum = "4e4ea1881992efc993e4dc50a324cdbd03216e41bdc8385720ff47efc9bd2ca8" 75 | dependencies = [ 76 | "error-code", 77 | "str-buf", 78 | "winapi", 79 | ] 80 | 81 | [[package]] 82 | name = "dirs-next" 83 | version = "2.0.0" 84 | source = "registry+https://github.com/rust-lang/crates.io-index" 85 | checksum = "b98cf8ebf19c3d1b223e151f99a4f9f0690dca41414773390fc824184ac833e1" 86 | dependencies = [ 87 | "cfg-if", 88 | "dirs-sys-next", 89 | ] 90 | 91 | [[package]] 92 | name = "dirs-sys-next" 93 | version = "0.1.2" 94 | source = "registry+https://github.com/rust-lang/crates.io-index" 95 | checksum = "4ebda144c4fe02d1f7ea1a7d9641b6fc6b580adcfa024ae48797ecdeb6825b4d" 96 | dependencies = [ 97 | "libc", 98 | "redox_users", 99 | "winapi", 100 | ] 101 | 102 | [[package]] 103 | name = "dtoa" 104 | version = "0.4.8" 105 | source = "registry+https://github.com/rust-lang/crates.io-index" 106 | checksum = "56899898ce76aaf4a0f24d914c97ea6ed976d42fec6ad33fcbb0a1103e07b2b0" 107 | 108 | [[package]] 109 | name = "endian-type" 110 | version = "0.1.2" 111 | source = "registry+https://github.com/rust-lang/crates.io-index" 112 | checksum = "c34f04666d835ff5d62e058c3995147c06f42fe86ff053337632bca83e42702d" 113 | 114 | [[package]] 115 | name = "error-code" 116 | version = "2.3.0" 117 | source = "registry+https://github.com/rust-lang/crates.io-index" 118 | checksum = "b5115567ac25674e0043e472be13d14e537f37ea8aa4bdc4aef0c89add1db1ff" 119 | dependencies = [ 120 | "libc", 121 | "str-buf", 122 | ] 123 | 124 | [[package]] 125 | name = "fd-lock" 126 | version = "3.0.0" 127 | source = "registry+https://github.com/rust-lang/crates.io-index" 128 | checksum = "b8806dd91a06a7a403a8e596f9bfbfb34e469efbc363fc9c9713e79e26472e36" 129 | dependencies = [ 130 | "cfg-if", 131 | "libc", 132 | "winapi", 133 | ] 134 | 135 | [[package]] 136 | name = "getrandom" 137 | version = "0.2.3" 138 | source = "registry+https://github.com/rust-lang/crates.io-index" 139 | checksum = "7fcd999463524c52659517fe2cea98493cfe485d10565e7b0fb07dbba7ad2753" 140 | dependencies = [ 141 | "cfg-if", 142 | "libc", 143 | "wasi", 144 | ] 145 | 146 | [[package]] 147 | name = "hashbrown" 148 | version = "0.11.2" 149 | source = "registry+https://github.com/rust-lang/crates.io-index" 150 | checksum = "ab5ef0d4909ef3724cc8cce6ccc8572c5c817592e9285f5464f8e86f8bd3726e" 151 | 152 | [[package]] 153 | name = "hermit-abi" 154 | version = "0.1.19" 155 | source = "registry+https://github.com/rust-lang/crates.io-index" 156 | checksum = "62b467343b94ba476dcb2500d242dadbb39557df889310ac77c5d99100aaac33" 157 | dependencies = [ 158 | "libc", 159 | ] 160 | 161 | [[package]] 162 | name = "indexmap" 163 | version = "1.7.0" 164 | source = "registry+https://github.com/rust-lang/crates.io-index" 165 | checksum = "bc633605454125dec4b66843673f01c7df2b89479b32e0ed634e43a91cff62a5" 166 | dependencies = [ 167 | "autocfg", 168 | "hashbrown", 169 | ] 170 | 171 | [[package]] 172 | name = "itoa" 173 | version = "0.4.8" 174 | source = "registry+https://github.com/rust-lang/crates.io-index" 175 | checksum = "b71991ff56294aa922b450139ee08b3bfc70982c6b2c7562771375cf73542dd4" 176 | 177 | [[package]] 178 | name = "libc" 179 | version = "0.2.103" 180 | source = "registry+https://github.com/rust-lang/crates.io-index" 181 | checksum = "dd8f7255a17a627354f321ef0055d63b898c6fb27eff628af4d1b66b7331edf6" 182 | 183 | [[package]] 184 | name = "linked-hash-map" 185 | version = "0.5.4" 186 | source = "registry+https://github.com/rust-lang/crates.io-index" 187 | checksum = "7fb9b38af92608140b86b693604b9ffcc5824240a484d1ecd4795bacb2fe88f3" 188 | 189 | [[package]] 190 | name = "log" 191 | version = "0.4.14" 192 | source = "registry+https://github.com/rust-lang/crates.io-index" 193 | checksum = "51b9bbe6c47d51fc3e1a9b945965946b4c44142ab8792c50835a980d362c2710" 194 | dependencies = [ 195 | "cfg-if", 196 | ] 197 | 198 | [[package]] 199 | name = "memchr" 200 | version = "2.3.4" 201 | source = "registry+https://github.com/rust-lang/crates.io-index" 202 | checksum = "0ee1c47aaa256ecabcaea351eae4a9b01ef39ed810004e298d2511ed284b1525" 203 | 204 | [[package]] 205 | name = "memoffset" 206 | version = "0.6.4" 207 | source = "registry+https://github.com/rust-lang/crates.io-index" 208 | checksum = "59accc507f1338036a0477ef61afdae33cde60840f4dfe481319ce3ad116ddf9" 209 | dependencies = [ 210 | "autocfg", 211 | ] 212 | 213 | [[package]] 214 | name = "minimal-lexical" 215 | version = "0.1.3" 216 | source = "registry+https://github.com/rust-lang/crates.io-index" 217 | checksum = "0c835948974f68e0bd58636fc6c5b1fbff7b297e3046f11b3b3c18bbac012c6d" 218 | 219 | [[package]] 220 | name = "nibble_vec" 221 | version = "0.1.0" 222 | source = "registry+https://github.com/rust-lang/crates.io-index" 223 | checksum = "77a5d83df9f36fe23f0c3648c6bbb8b0298bb5f1939c8f2704431371f4b84d43" 224 | dependencies = [ 225 | "smallvec", 226 | ] 227 | 228 | [[package]] 229 | name = "nix" 230 | version = "0.22.2" 231 | source = "registry+https://github.com/rust-lang/crates.io-index" 232 | checksum = "d3bb9a13fa32bc5aeb64150cd3f32d6cf4c748f8f8a417cce5d2eb976a8370ba" 233 | dependencies = [ 234 | "bitflags", 235 | "cc", 236 | "cfg-if", 237 | "libc", 238 | "memoffset", 239 | ] 240 | 241 | [[package]] 242 | name = "nom" 243 | version = "7.0.0" 244 | source = "registry+https://github.com/rust-lang/crates.io-index" 245 | checksum = "7ffd9d26838a953b4af82cbeb9f1592c6798916983959be223a7124e992742c1" 246 | dependencies = [ 247 | "memchr", 248 | "minimal-lexical", 249 | "version_check", 250 | ] 251 | 252 | [[package]] 253 | name = "nom_locate" 254 | version = "4.0.0" 255 | source = "registry+https://github.com/rust-lang/crates.io-index" 256 | checksum = "37794436ca3029a3089e0b95d42da1f0b565ad271e4d3bb4bad0c7bb70b10605" 257 | dependencies = [ 258 | "bytecount", 259 | "memchr", 260 | "nom", 261 | ] 262 | 263 | [[package]] 264 | name = "proc-macro2" 265 | version = "1.0.29" 266 | source = "registry+https://github.com/rust-lang/crates.io-index" 267 | checksum = "b9f5105d4fdaab20335ca9565e106a5d9b82b6219b5ba735731124ac6711d23d" 268 | dependencies = [ 269 | "unicode-xid", 270 | ] 271 | 272 | [[package]] 273 | name = "quick-xml" 274 | version = "0.22.0" 275 | source = "registry+https://github.com/rust-lang/crates.io-index" 276 | checksum = "8533f14c8382aaad0d592c812ac3b826162128b65662331e1127b45c3d18536b" 277 | dependencies = [ 278 | "memchr", 279 | "serde", 280 | ] 281 | 282 | [[package]] 283 | name = "quote" 284 | version = "1.0.9" 285 | source = "registry+https://github.com/rust-lang/crates.io-index" 286 | checksum = "c3d0b9745dc2debf507c8422de05d7226cc1f0644216dfdfead988f9b1ab32a7" 287 | dependencies = [ 288 | "proc-macro2", 289 | ] 290 | 291 | [[package]] 292 | name = "radix_trie" 293 | version = "0.2.1" 294 | source = "registry+https://github.com/rust-lang/crates.io-index" 295 | checksum = "c069c179fcdc6a2fe24d8d18305cf085fdbd4f922c041943e203685d6a1c58fd" 296 | dependencies = [ 297 | "endian-type", 298 | "nibble_vec", 299 | ] 300 | 301 | [[package]] 302 | name = "redox_syscall" 303 | version = "0.2.10" 304 | source = "registry+https://github.com/rust-lang/crates.io-index" 305 | checksum = "8383f39639269cde97d255a32bdb68c047337295414940c68bdd30c2e13203ff" 306 | dependencies = [ 307 | "bitflags", 308 | ] 309 | 310 | [[package]] 311 | name = "redox_users" 312 | version = "0.4.0" 313 | source = "registry+https://github.com/rust-lang/crates.io-index" 314 | checksum = "528532f3d801c87aec9def2add9ca802fe569e44a544afe633765267840abe64" 315 | dependencies = [ 316 | "getrandom", 317 | "redox_syscall", 318 | ] 319 | 320 | [[package]] 321 | name = "rustyline" 322 | version = "9.0.0" 323 | source = "registry+https://github.com/rust-lang/crates.io-index" 324 | checksum = "790487c3881a63489ae77126f57048b42d62d3b2bafbf37453ea19eedb6340d6" 325 | dependencies = [ 326 | "bitflags", 327 | "cfg-if", 328 | "clipboard-win", 329 | "dirs-next", 330 | "fd-lock", 331 | "libc", 332 | "log", 333 | "memchr", 334 | "nix", 335 | "radix_trie", 336 | "scopeguard", 337 | "smallvec", 338 | "unicode-segmentation", 339 | "unicode-width", 340 | "utf8parse", 341 | "winapi", 342 | ] 343 | 344 | [[package]] 345 | name = "ryu" 346 | version = "1.0.5" 347 | source = "registry+https://github.com/rust-lang/crates.io-index" 348 | checksum = "71d301d4193d031abdd79ff7e3dd721168a9572ef3fe51a1517aba235bd8f86e" 349 | 350 | [[package]] 351 | name = "sap" 352 | version = "0.1.0" 353 | dependencies = [ 354 | "clap", 355 | "quick-xml", 356 | "sap-lang", 357 | "serde", 358 | "serde_json", 359 | "serde_yaml", 360 | ] 361 | 362 | [[package]] 363 | name = "sap-lang" 364 | version = "0.1.0" 365 | dependencies = [ 366 | "nom", 367 | "nom_locate", 368 | ] 369 | 370 | [[package]] 371 | name = "sap-lang-repl" 372 | version = "0.1.0" 373 | dependencies = [ 374 | "rustyline", 375 | "sap-lang", 376 | ] 377 | 378 | [[package]] 379 | name = "scopeguard" 380 | version = "1.1.0" 381 | source = "registry+https://github.com/rust-lang/crates.io-index" 382 | checksum = "d29ab0c6d3fc0ee92fe66e2d99f700eab17a8d57d1c1d3b748380fb20baa78cd" 383 | 384 | [[package]] 385 | name = "serde" 386 | version = "1.0.130" 387 | source = "registry+https://github.com/rust-lang/crates.io-index" 388 | checksum = "f12d06de37cf59146fbdecab66aa99f9fe4f78722e3607577a5375d66bd0c913" 389 | dependencies = [ 390 | "serde_derive", 391 | ] 392 | 393 | [[package]] 394 | name = "serde_derive" 395 | version = "1.0.130" 396 | source = "registry+https://github.com/rust-lang/crates.io-index" 397 | checksum = "d7bc1a1ab1961464eae040d96713baa5a724a8152c1222492465b54322ec508b" 398 | dependencies = [ 399 | "proc-macro2", 400 | "quote", 401 | "syn", 402 | ] 403 | 404 | [[package]] 405 | name = "serde_json" 406 | version = "1.0.68" 407 | source = "registry+https://github.com/rust-lang/crates.io-index" 408 | checksum = "0f690853975602e1bfe1ccbf50504d67174e3bcf340f23b5ea9992e0587a52d8" 409 | dependencies = [ 410 | "itoa", 411 | "ryu", 412 | "serde", 413 | ] 414 | 415 | [[package]] 416 | name = "serde_yaml" 417 | version = "0.8.21" 418 | source = "registry+https://github.com/rust-lang/crates.io-index" 419 | checksum = "d8c608a35705a5d3cdc9fbe403147647ff34b921f8e833e49306df898f9b20af" 420 | dependencies = [ 421 | "dtoa", 422 | "indexmap", 423 | "serde", 424 | "yaml-rust", 425 | ] 426 | 427 | [[package]] 428 | name = "smallvec" 429 | version = "1.7.0" 430 | source = "registry+https://github.com/rust-lang/crates.io-index" 431 | checksum = "1ecab6c735a6bb4139c0caafd0cc3635748bbb3acf4550e8138122099251f309" 432 | 433 | [[package]] 434 | name = "str-buf" 435 | version = "1.0.5" 436 | source = "registry+https://github.com/rust-lang/crates.io-index" 437 | checksum = "d44a3643b4ff9caf57abcee9c2c621d6c03d9135e0d8b589bd9afb5992cb176a" 438 | 439 | [[package]] 440 | name = "strsim" 441 | version = "0.8.0" 442 | source = "registry+https://github.com/rust-lang/crates.io-index" 443 | checksum = "8ea5119cdb4c55b55d432abb513a0429384878c15dde60cc77b1c99de1a95a6a" 444 | 445 | [[package]] 446 | name = "syn" 447 | version = "1.0.78" 448 | source = "registry+https://github.com/rust-lang/crates.io-index" 449 | checksum = "a4eac2e6c19f5c3abc0c229bea31ff0b9b091c7b14990e8924b92902a303a0c0" 450 | dependencies = [ 451 | "proc-macro2", 452 | "quote", 453 | "unicode-xid", 454 | ] 455 | 456 | [[package]] 457 | name = "textwrap" 458 | version = "0.11.0" 459 | source = "registry+https://github.com/rust-lang/crates.io-index" 460 | checksum = "d326610f408c7a4eb6f51c37c330e496b08506c9457c9d34287ecc38809fb060" 461 | dependencies = [ 462 | "unicode-width", 463 | ] 464 | 465 | [[package]] 466 | name = "unicode-segmentation" 467 | version = "1.8.0" 468 | source = "registry+https://github.com/rust-lang/crates.io-index" 469 | checksum = "8895849a949e7845e06bd6dc1aa51731a103c42707010a5b591c0038fb73385b" 470 | 471 | [[package]] 472 | name = "unicode-width" 473 | version = "0.1.9" 474 | source = "registry+https://github.com/rust-lang/crates.io-index" 475 | checksum = "3ed742d4ea2bd1176e236172c8429aaf54486e7ac098db29ffe6529e0ce50973" 476 | 477 | [[package]] 478 | name = "unicode-xid" 479 | version = "0.2.2" 480 | source = "registry+https://github.com/rust-lang/crates.io-index" 481 | checksum = "8ccb82d61f80a663efe1f787a51b16b5a51e3314d6ac365b08639f52387b33f3" 482 | 483 | [[package]] 484 | name = "utf8parse" 485 | version = "0.2.0" 486 | source = "registry+https://github.com/rust-lang/crates.io-index" 487 | checksum = "936e4b492acfd135421d8dca4b1aa80a7bfc26e702ef3af710e0752684df5372" 488 | 489 | [[package]] 490 | name = "vec_map" 491 | version = "0.8.2" 492 | source = "registry+https://github.com/rust-lang/crates.io-index" 493 | checksum = "f1bddf1187be692e79c5ffeab891132dfb0f236ed36a43c7ed39f1165ee20191" 494 | 495 | [[package]] 496 | name = "version_check" 497 | version = "0.9.3" 498 | source = "registry+https://github.com/rust-lang/crates.io-index" 499 | checksum = "5fecdca9a5291cc2b8dcf7dc02453fee791a280f3743cb0905f8822ae463b3fe" 500 | 501 | [[package]] 502 | name = "wasi" 503 | version = "0.10.2+wasi-snapshot-preview1" 504 | source = "registry+https://github.com/rust-lang/crates.io-index" 505 | checksum = "fd6fbd9a79829dd1ad0cc20627bf1ed606756a7f77edff7b66b7064f9cb327c6" 506 | 507 | [[package]] 508 | name = "winapi" 509 | version = "0.3.9" 510 | source = "registry+https://github.com/rust-lang/crates.io-index" 511 | checksum = "5c839a674fcd7a98952e593242ea400abe93992746761e38641405d28b00f419" 512 | dependencies = [ 513 | "winapi-i686-pc-windows-gnu", 514 | "winapi-x86_64-pc-windows-gnu", 515 | ] 516 | 517 | [[package]] 518 | name = "winapi-i686-pc-windows-gnu" 519 | version = "0.4.0" 520 | source = "registry+https://github.com/rust-lang/crates.io-index" 521 | checksum = "ac3b87c63620426dd9b991e5ce0329eff545bccbbb34f3be09ff6fb6ab51b7b6" 522 | 523 | [[package]] 524 | name = "winapi-x86_64-pc-windows-gnu" 525 | version = "0.4.0" 526 | source = "registry+https://github.com/rust-lang/crates.io-index" 527 | checksum = "712e227841d057c1ee1cd2fb22fa7e5a5461ae8e48fa2ca79ec42cfc1931183f" 528 | 529 | [[package]] 530 | name = "yaml-rust" 531 | version = "0.4.5" 532 | source = "registry+https://github.com/rust-lang/crates.io-index" 533 | checksum = "56c1936c4cc7a1c9ab21a1ebb602eb942ba868cbd44a99cb7cdc5892335e1c85" 534 | dependencies = [ 535 | "linked-hash-map", 536 | ] 537 | -------------------------------------------------------------------------------- /Cargo.toml: -------------------------------------------------------------------------------- 1 | cargo-features = ["strip"] 2 | #[crate_type = "staticlib"] 3 | [package] 4 | name = "sap-lang" 5 | version = "0.1.0" 6 | edition = "2021" 7 | 8 | 9 | [workspace] 10 | members = ["sap-lang-repl", "sap"] 11 | 12 | [profile.release] 13 | strip = "debuginfo" 14 | lto = true 15 | codegen-units = 1 16 | panic = "abort" 17 | 18 | [dependencies] 19 | nom_locate = { version = "4", features = ["alloc"] } 20 | nom = { version = "7", features = ["alloc"] } 21 | 22 | # rustyline = "9.0.0" 23 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Sap lang 2 | # **🚧upgrading to v2** 3 | > yet another configuration oriented language 4 | > 5 | > name comes from Sapphire which is the birthstone of september 6 | 7 | ## Language Feature 8 | the last expr of the scope is the return value 9 | also the last expr of the file is the return value of the file 10 | 11 | ## variable decl 12 | variable is scoped 13 | ``` 14 | a = 10 15 | b = 20 16 | c = "string" 17 | d = 'c' # TODO: number in char 18 | ``` 19 | 20 | ## comment 21 | TODO 22 | ``` 23 | # single lined comment 24 | 25 | ###BEGIN 26 | multi 27 | lined 28 | comment 29 | ###END 30 | ``` 31 | 32 | ## literals 33 | ``` 34 | 10 # number 35 | 'c' # number in char literal 36 | "string" # string 37 | 38 | ##RAW 39 | raw string 40 | raw string 41 | ## 42 | 43 | # TODO 44 | #INCLUDE "path" # also raw string 45 | 46 | true # bool 47 | [] # array 48 | {a:10,b:20} # object 49 | (){null} # closure 50 | 51 | # fast object 52 | a = 10 53 | {a} # semantic: {a:a} 54 | ``` 55 | 56 | ## strong type? 57 | YES! 58 | 59 | ## type definision 60 | ``` 61 | type typed = (name){{name}} 62 | 63 | tyvar = typed(name) 64 | 65 | type enum = 66 | | name: (name){{name}} 67 | | aged: (name,age){{name,age}} 68 | | full: (name,age,location){{name,age,location}} 69 | 70 | tyvar = enum(name,age,location) 71 | # or 72 | tyvar = enum::full(name,age,location) 73 | 74 | # change value 75 | tyvar[name] = "string" 76 | 77 | # to validate if is a variant of an enum 78 | 79 | TODO 80 | ``` 81 | 82 | ## function 83 | ``` 84 | # auto typed 85 | (a){a} 86 | 87 | # typed 88 | (a:String){a} 89 | ``` 90 | 91 | pre defined function 92 | - log # more or less println 93 | - octor 94 | - actor 95 | - is # try to match object enntrys with function argument name 96 | - assert 97 | - intersect union diff cross 98 | - innerjoin joinon 99 | 100 | 101 | ## branch 102 | ``` 103 | if expr:bool { 104 | 105 | } else { 106 | 107 | } 108 | 109 | if 110 | | expr:bool {} 111 | | expr:bool {} 112 | | expr:bool {} 113 | else {} 114 | ``` 115 | 116 | ## looping 117 | ``` 118 | for a in [] { 119 | 120 | } 121 | 122 | for a in range(0,10){ 123 | 124 | } 125 | ``` 126 | 127 | ## function call 128 | ``` 129 | f = (a:number) => number {a.s} 130 | g = (a:string) => number {a.n?} 131 | 132 | f(10) # "10" 133 | g("10") # 10 134 | f.g.f.g.f.g.f(10) # 10 . is bind 135 | 136 | id = f.g 137 | ``` 138 | 139 | ## error handling 140 | ``` 141 | a = null 142 | a # return file end as object 143 | # so calling a.o 144 | # {} 145 | 146 | # another file 147 | b = err("an error") 148 | b 149 | # error in line 1 b: an error 150 | 151 | b = err("an error")? # cast error to null 152 | b 153 | 154 | b = if maybeerr? == null { 155 | 1 156 | }else{ 157 | maybeerr? 158 | } 159 | ``` 160 | 161 | ## dot sematic 162 | ``` 163 | a.b # a: Object b:Any => index 164 | a.b # a: function b:function => bind 165 | a.b() # a: not function b: function => bind first 166 | a().b() # a: function call with less param b: function call with multiple param but less one => bind first 167 | a.typename() # cast 168 | ``` 169 | 170 | ## function semantic 171 | function is curried by default 172 | 173 | ## Example File 174 | ``` 175 | url = ARGS.url.orelse("https://lemonhx.moe") 176 | port = ARGS.url.orelse(8080) 177 | 178 | type Request = (post_name,post_id){ 179 | { 180 | type: "POST" 181 | url: "{{url}}/{{post_name}}/{{post_id}}", 182 | port, 183 | } 184 | }; 185 | 186 | Request("blogexample",10) 187 | ``` 188 | 189 | then you can use like 190 | 191 | ``` 192 | sap example.sap -serializer json url "https://google.com" -o stdout 193 | 194 | { 195 | "type":"POST", 196 | "url":"https://google.com/blogexample/10", 197 | "port":8080 198 | } 199 | 200 | sap example.sap -serializer yaml url "https://baidu.com" -o stdout 201 | 202 | type: POST 203 | url: 'https://google.com/blogexample/10' 204 | port: 8080 205 | ``` 206 | -------------------------------------------------------------------------------- /sap-lang-repl/.gitignore: -------------------------------------------------------------------------------- 1 | /target -------------------------------------------------------------------------------- /sap-lang-repl/Cargo.lock: -------------------------------------------------------------------------------- 1 | # This file is automatically @generated by Cargo. 2 | # It is not intended for manual editing. 3 | version = 3 4 | 5 | [[package]] 6 | name = "autocfg" 7 | version = "1.0.1" 8 | source = "registry+https://github.com/rust-lang/crates.io-index" 9 | checksum = "cdb031dd78e28731d87d56cc8ffef4a8f36ca26c38fe2de700543e627f8a464a" 10 | 11 | [[package]] 12 | name = "bitflags" 13 | version = "1.2.1" 14 | source = "registry+https://github.com/rust-lang/crates.io-index" 15 | checksum = "cf1de2fe8c75bc145a2f577add951f8134889b4795d47466a54a5c846d691693" 16 | 17 | [[package]] 18 | name = "cc" 19 | version = "1.0.70" 20 | source = "registry+https://github.com/rust-lang/crates.io-index" 21 | checksum = "d26a6ce4b6a484fa3edb70f7efa6fc430fd2b87285fe8b84304fd0936faa0dc0" 22 | 23 | [[package]] 24 | name = "cfg-if" 25 | version = "1.0.0" 26 | source = "registry+https://github.com/rust-lang/crates.io-index" 27 | checksum = "baf1de4339761588bc0619e3cbc0120ee582ebb74b53b4efbf79117bd2da40fd" 28 | 29 | [[package]] 30 | name = "clipboard-win" 31 | version = "4.2.1" 32 | source = "registry+https://github.com/rust-lang/crates.io-index" 33 | checksum = "4e4ea1881992efc993e4dc50a324cdbd03216e41bdc8385720ff47efc9bd2ca8" 34 | dependencies = [ 35 | "error-code", 36 | "str-buf", 37 | "winapi", 38 | ] 39 | 40 | [[package]] 41 | name = "dirs-next" 42 | version = "2.0.0" 43 | source = "registry+https://github.com/rust-lang/crates.io-index" 44 | checksum = "b98cf8ebf19c3d1b223e151f99a4f9f0690dca41414773390fc824184ac833e1" 45 | dependencies = [ 46 | "cfg-if", 47 | "dirs-sys-next", 48 | ] 49 | 50 | [[package]] 51 | name = "dirs-sys-next" 52 | version = "0.1.2" 53 | source = "registry+https://github.com/rust-lang/crates.io-index" 54 | checksum = "4ebda144c4fe02d1f7ea1a7d9641b6fc6b580adcfa024ae48797ecdeb6825b4d" 55 | dependencies = [ 56 | "libc", 57 | "redox_users", 58 | "winapi", 59 | ] 60 | 61 | [[package]] 62 | name = "endian-type" 63 | version = "0.1.2" 64 | source = "registry+https://github.com/rust-lang/crates.io-index" 65 | checksum = "c34f04666d835ff5d62e058c3995147c06f42fe86ff053337632bca83e42702d" 66 | 67 | [[package]] 68 | name = "error-code" 69 | version = "2.3.0" 70 | source = "registry+https://github.com/rust-lang/crates.io-index" 71 | checksum = "b5115567ac25674e0043e472be13d14e537f37ea8aa4bdc4aef0c89add1db1ff" 72 | dependencies = [ 73 | "libc", 74 | "str-buf", 75 | ] 76 | 77 | [[package]] 78 | name = "fd-lock" 79 | version = "3.0.0" 80 | source = "registry+https://github.com/rust-lang/crates.io-index" 81 | checksum = "b8806dd91a06a7a403a8e596f9bfbfb34e469efbc363fc9c9713e79e26472e36" 82 | dependencies = [ 83 | "cfg-if", 84 | "libc", 85 | "winapi", 86 | ] 87 | 88 | [[package]] 89 | name = "getrandom" 90 | version = "0.2.3" 91 | source = "registry+https://github.com/rust-lang/crates.io-index" 92 | checksum = "7fcd999463524c52659517fe2cea98493cfe485d10565e7b0fb07dbba7ad2753" 93 | dependencies = [ 94 | "cfg-if", 95 | "libc", 96 | "wasi", 97 | ] 98 | 99 | [[package]] 100 | name = "libc" 101 | version = "0.2.103" 102 | source = "registry+https://github.com/rust-lang/crates.io-index" 103 | checksum = "dd8f7255a17a627354f321ef0055d63b898c6fb27eff628af4d1b66b7331edf6" 104 | 105 | [[package]] 106 | name = "log" 107 | version = "0.4.14" 108 | source = "registry+https://github.com/rust-lang/crates.io-index" 109 | checksum = "51b9bbe6c47d51fc3e1a9b945965946b4c44142ab8792c50835a980d362c2710" 110 | dependencies = [ 111 | "cfg-if", 112 | ] 113 | 114 | [[package]] 115 | name = "memchr" 116 | version = "2.4.1" 117 | source = "registry+https://github.com/rust-lang/crates.io-index" 118 | checksum = "308cc39be01b73d0d18f82a0e7b2a3df85245f84af96fdddc5d202d27e47b86a" 119 | 120 | [[package]] 121 | name = "memoffset" 122 | version = "0.6.4" 123 | source = "registry+https://github.com/rust-lang/crates.io-index" 124 | checksum = "59accc507f1338036a0477ef61afdae33cde60840f4dfe481319ce3ad116ddf9" 125 | dependencies = [ 126 | "autocfg", 127 | ] 128 | 129 | [[package]] 130 | name = "nibble_vec" 131 | version = "0.1.0" 132 | source = "registry+https://github.com/rust-lang/crates.io-index" 133 | checksum = "77a5d83df9f36fe23f0c3648c6bbb8b0298bb5f1939c8f2704431371f4b84d43" 134 | dependencies = [ 135 | "smallvec", 136 | ] 137 | 138 | [[package]] 139 | name = "nix" 140 | version = "0.22.2" 141 | source = "registry+https://github.com/rust-lang/crates.io-index" 142 | checksum = "d3bb9a13fa32bc5aeb64150cd3f32d6cf4c748f8f8a417cce5d2eb976a8370ba" 143 | dependencies = [ 144 | "bitflags", 145 | "cc", 146 | "cfg-if", 147 | "libc", 148 | "memoffset", 149 | ] 150 | 151 | [[package]] 152 | name = "radix_trie" 153 | version = "0.2.1" 154 | source = "registry+https://github.com/rust-lang/crates.io-index" 155 | checksum = "c069c179fcdc6a2fe24d8d18305cf085fdbd4f922c041943e203685d6a1c58fd" 156 | dependencies = [ 157 | "endian-type", 158 | "nibble_vec", 159 | ] 160 | 161 | [[package]] 162 | name = "redox_syscall" 163 | version = "0.2.10" 164 | source = "registry+https://github.com/rust-lang/crates.io-index" 165 | checksum = "8383f39639269cde97d255a32bdb68c047337295414940c68bdd30c2e13203ff" 166 | dependencies = [ 167 | "bitflags", 168 | ] 169 | 170 | [[package]] 171 | name = "redox_users" 172 | version = "0.4.0" 173 | source = "registry+https://github.com/rust-lang/crates.io-index" 174 | checksum = "528532f3d801c87aec9def2add9ca802fe569e44a544afe633765267840abe64" 175 | dependencies = [ 176 | "getrandom", 177 | "redox_syscall", 178 | ] 179 | 180 | [[package]] 181 | name = "rustyline" 182 | version = "9.0.0" 183 | source = "registry+https://github.com/rust-lang/crates.io-index" 184 | checksum = "790487c3881a63489ae77126f57048b42d62d3b2bafbf37453ea19eedb6340d6" 185 | dependencies = [ 186 | "bitflags", 187 | "cfg-if", 188 | "clipboard-win", 189 | "dirs-next", 190 | "fd-lock", 191 | "libc", 192 | "log", 193 | "memchr", 194 | "nix", 195 | "radix_trie", 196 | "scopeguard", 197 | "smallvec", 198 | "unicode-segmentation", 199 | "unicode-width", 200 | "utf8parse", 201 | "winapi", 202 | ] 203 | 204 | [[package]] 205 | name = "sap-lang-repl" 206 | version = "0.1.0" 207 | dependencies = [ 208 | "rustyline", 209 | ] 210 | 211 | [[package]] 212 | name = "scopeguard" 213 | version = "1.1.0" 214 | source = "registry+https://github.com/rust-lang/crates.io-index" 215 | checksum = "d29ab0c6d3fc0ee92fe66e2d99f700eab17a8d57d1c1d3b748380fb20baa78cd" 216 | 217 | [[package]] 218 | name = "smallvec" 219 | version = "1.7.0" 220 | source = "registry+https://github.com/rust-lang/crates.io-index" 221 | checksum = "1ecab6c735a6bb4139c0caafd0cc3635748bbb3acf4550e8138122099251f309" 222 | 223 | [[package]] 224 | name = "str-buf" 225 | version = "1.0.5" 226 | source = "registry+https://github.com/rust-lang/crates.io-index" 227 | checksum = "d44a3643b4ff9caf57abcee9c2c621d6c03d9135e0d8b589bd9afb5992cb176a" 228 | 229 | [[package]] 230 | name = "unicode-segmentation" 231 | version = "1.8.0" 232 | source = "registry+https://github.com/rust-lang/crates.io-index" 233 | checksum = "8895849a949e7845e06bd6dc1aa51731a103c42707010a5b591c0038fb73385b" 234 | 235 | [[package]] 236 | name = "unicode-width" 237 | version = "0.1.9" 238 | source = "registry+https://github.com/rust-lang/crates.io-index" 239 | checksum = "3ed742d4ea2bd1176e236172c8429aaf54486e7ac098db29ffe6529e0ce50973" 240 | 241 | [[package]] 242 | name = "utf8parse" 243 | version = "0.2.0" 244 | source = "registry+https://github.com/rust-lang/crates.io-index" 245 | checksum = "936e4b492acfd135421d8dca4b1aa80a7bfc26e702ef3af710e0752684df5372" 246 | 247 | [[package]] 248 | name = "wasi" 249 | version = "0.10.2+wasi-snapshot-preview1" 250 | source = "registry+https://github.com/rust-lang/crates.io-index" 251 | checksum = "fd6fbd9a79829dd1ad0cc20627bf1ed606756a7f77edff7b66b7064f9cb327c6" 252 | 253 | [[package]] 254 | name = "winapi" 255 | version = "0.3.9" 256 | source = "registry+https://github.com/rust-lang/crates.io-index" 257 | checksum = "5c839a674fcd7a98952e593242ea400abe93992746761e38641405d28b00f419" 258 | dependencies = [ 259 | "winapi-i686-pc-windows-gnu", 260 | "winapi-x86_64-pc-windows-gnu", 261 | ] 262 | 263 | [[package]] 264 | name = "winapi-i686-pc-windows-gnu" 265 | version = "0.4.0" 266 | source = "registry+https://github.com/rust-lang/crates.io-index" 267 | checksum = "ac3b87c63620426dd9b991e5ce0329eff545bccbbb34f3be09ff6fb6ab51b7b6" 268 | 269 | [[package]] 270 | name = "winapi-x86_64-pc-windows-gnu" 271 | version = "0.4.0" 272 | source = "registry+https://github.com/rust-lang/crates.io-index" 273 | checksum = "712e227841d057c1ee1cd2fb22fa7e5a5461ae8e48fa2ca79ec42cfc1931183f" 274 | -------------------------------------------------------------------------------- /sap-lang-repl/Cargo.toml: -------------------------------------------------------------------------------- 1 | cargo-features = ["strip"] 2 | [package] 3 | name = "sap-lang-repl" 4 | version = "0.1.0" 5 | edition = "2021" 6 | 7 | [profile.release] 8 | strip = "debuginfo" 9 | lto = true 10 | codegen-units = 1 11 | panic = "abort" 12 | 13 | [dependencies] 14 | rustyline = "9" 15 | sap-lang = { path = "../" } 16 | -------------------------------------------------------------------------------- /sap-lang-repl/src/main.rs: -------------------------------------------------------------------------------- 1 | extern crate alloc; 2 | use rustyline::error::ReadlineError; 3 | use rustyline::Editor; 4 | use sap_lang::parse_single_line; 5 | use sap_lang::parser::top_level::TopLevel; 6 | use sap_lang::parser::ty::Type; 7 | use std::cell::{RefCell, UnsafeCell}; 8 | use std::collections::BTreeMap; 9 | use std::rc::Rc; 10 | 11 | use sap_lang::state::evaluator::{eval_expr, EvalContext}; 12 | use sap_lang::state::type_checker::{type_check_expr, TypeCheckContext}; 13 | use sap_lang::state::SapState; 14 | 15 | fn main() { 16 | println!(" ____\x1b[1;34m____ \x1b[0m ___ __ \x1b[1;32m| Next-GEN Confguration Template Generation Language\x1b[0m"); 17 | println!(" / __\x1b[1;34m/ /\\ \\ *\x1b[0m / _ \\/ / ___ ____ ___ _ \x1b[1;32m| \x1b[0m"); 18 | println!(" _\\ \\\x1b[1;34m|-| |-|\x1b[0m / ___/ /__/ _ `/ _ \\/ _ `/ \x1b[1;32m| Version: \x1b[0;34m0.1.0 alpha\x1b[0m"); 19 | println!("/___/ \x1b[1;34m\\_\\/_/\x1b[0m_\\_/ /____/\\_,_/_//_/\\_, / \x1b[1;32m| Press \x1b[0;34m'?'\x1b[1;32m or type in \x1b[0;34m'help'\x1b[1;32m for help\x1b[0m"); 20 | println!( 21 | " /___/ \x1b[1;32m| Author's Blog: \x1b[0;34m'https://www.lemonhx.moe/'\x1b[32m\x1b[0m" 22 | ); 23 | let mut rl = Editor::<()>::new(); 24 | if rl.load_history("history.txt").is_err() { 25 | println!("No previous history."); 26 | } 27 | let mut runner = SapState::new_with_std(); 28 | 29 | 'r: loop { 30 | let mut prompt = "\x1b[1;34msap-lang>>\x1b[0m "; 31 | let mut line = String::new(); 32 | loop { 33 | let readline = rl.readline(prompt); 34 | match readline { 35 | Ok(l) => { 36 | line.push_str(&l); 37 | } 38 | Err(ReadlineError::Interrupted) => { 39 | println!("Exit"); 40 | break 'r; 41 | } 42 | Err(ReadlineError::Eof) => { 43 | println!("EOF detected drop current line"); 44 | break; 45 | } 46 | Err(err) => { 47 | println!("Error: {:?}", err); 48 | break 'r; 49 | } 50 | } 51 | if line.as_str() == "?" || line.as_str() == "help" { 52 | rl.add_history_entry(line.as_str()); 53 | line.clear(); 54 | println!(r"press Control-C for exit"); 55 | println!(r"press Control-D to abandon current line") 56 | } else if line.as_str() == "debug!" { 57 | rl.add_history_entry(line.as_str()); 58 | line.clear(); 59 | println!("{:?}", runner) 60 | } else { 61 | match parse_single_line(line.as_str()) { 62 | Ok(r) => { 63 | rl.add_history_entry(line.as_str()); 64 | line.clear(); 65 | prompt = "\x1b[1;34msap-lang>>\x1b[0m "; 66 | println!("parsed: {}", r); 67 | match &r { 68 | TopLevel::Comment(c) => { 69 | println!("comment: {:?}", c) 70 | } 71 | TopLevel::Expr(e) => { 72 | let (t, v) = runner.type_check_and_run(r); 73 | match v { 74 | Ok(t) => { 75 | print!("eval result: {:?}", unsafe { &*t.as_ref().get() }) 76 | } 77 | Err(e) => { 78 | print!("\x1b[1;31meval error: {:?}\x1b[0m", e) 79 | } 80 | } 81 | match t { 82 | Ok(t) => { 83 | println!( 84 | "\x1b[1;32m\ttype: {}\x1b[0m", 85 | t.unwrap_or(Type::Any) 86 | ) 87 | } 88 | Err(e) => { 89 | println!("\x1b[1;31m\ttype check error: {:?}\x1b[0m", e) 90 | } 91 | } 92 | } 93 | &TopLevel::TypeDef(_, _) => { 94 | let (t, _) = runner.type_check_and_run(r); 95 | match t { 96 | Ok(t) => { 97 | println!("\x1b[1;32m\ttype: {}\x1b[0m", t.unwrap()) 98 | } 99 | Err(e) => { 100 | println!("\x1b[1;31m\ttype check error: {:?}\x1b[0m", e) 101 | } 102 | } 103 | } 104 | _ => {} 105 | } 106 | } 107 | Err(e) => { 108 | line.push_str("\n"); // separate input lines 109 | prompt = "\x1b[1;34m*>>\x1b[0m "; 110 | } 111 | } 112 | } 113 | } 114 | } 115 | rl.save_history("history.txt").unwrap(); 116 | } 117 | -------------------------------------------------------------------------------- /sap/.gitignore: -------------------------------------------------------------------------------- 1 | /target -------------------------------------------------------------------------------- /sap/Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "sap" 3 | version = "0.1.0" 4 | edition = "2021" 5 | 6 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 7 | 8 | [dependencies] 9 | sap-lang = { path = "../" } 10 | clap = "*" 11 | serde = { version = "*", features = ["derive"] } 12 | serde_json = "*" 13 | quick-xml = { version = "0.22", features = ["serialize"] } 14 | serde_yaml = "*" 15 | -------------------------------------------------------------------------------- /sap/src/main.rs: -------------------------------------------------------------------------------- 1 | use std::{cell::UnsafeCell, collections::BTreeMap, rc::Rc}; 2 | 3 | use clap::{clap_app, App, Arg}; 4 | use quick_xml::Reader; 5 | use sap_lang::{parser::expr::literal::Number, state::evaluator::value::Value}; 6 | 7 | fn main() { 8 | let v: serde_json::Value = quick_xml::de::from_str( 9 | " 10 |

11 | gay 12 |

13 | gay1 14 |

fuck2

15 | gay3 16 | 17 |

18 |

19 | ", 20 | ) 21 | .unwrap(); 22 | println!("{}", v); 23 | } 24 | -------------------------------------------------------------------------------- /src/lib.rs: -------------------------------------------------------------------------------- 1 | #![feature(exclusive_range_pattern)] 2 | #![feature(box_patterns)] 3 | #![feature(c_variadic)] 4 | #![feature(vec_into_raw_parts)] 5 | 6 | use nom::{combinator::opt, multi::many0, sequence::tuple}; 7 | use nom_locate::LocatedSpan; 8 | use parser::top_level::TopLevel; 9 | 10 | use std::{format, string::String, vec::Vec}; 11 | 12 | use crate::{parser::Parser, utils::ws}; 13 | 14 | extern crate alloc; 15 | pub mod parser; 16 | pub mod state; 17 | pub mod utils; 18 | 19 | pub fn parse_single_line(s: &str) -> Result { 20 | TopLevel::parse(LocatedSpan::new(s)) 21 | .ok() 22 | .map(|(l, r)| { 23 | if l.fragment() != &"" { 24 | Err(format!("could not parse substring at position: {:?}", l)) 25 | } else { 26 | Ok(r) 27 | } 28 | }) 29 | .unwrap_or(Err(format!("failed to parse {:?}", s))) 30 | } 31 | 32 | pub fn parse_multi_line(s: &str) -> Result, String> { 33 | let s = LocatedSpan::new(s); 34 | let t = match many0(tuple((opt(ws), TopLevel::parse, opt(ws))))(s) { 35 | Ok((l, r)) => { 36 | if l.fragment() != &"" { 37 | Err(format!("could not parse substring at position: {:?}", l)) 38 | } else { 39 | Ok(r) 40 | } 41 | } 42 | Err(e) => Err(format!("{:?}", e)), 43 | }?; 44 | Ok(t.iter().map(|(_, s, _)| s.clone()).collect()) 45 | } 46 | -------------------------------------------------------------------------------- /src/parser/expr/literal/char.rs: -------------------------------------------------------------------------------- 1 | use super::escape_code; 2 | use nom::{ 3 | bytes::complete::{escaped, is_not, tag}, 4 | combinator::map, 5 | sequence::delimited, 6 | IResult, 7 | }; 8 | use nom_locate::LocatedSpan; 9 | // TODO: limit one char 10 | fn char(s: LocatedSpan<&str>) -> IResult, char> { 11 | map( 12 | delimited( 13 | tag("\'"), 14 | escaped(is_not("\"\\"), '\\', escape_code), 15 | tag("\'"), 16 | ), 17 | |s: LocatedSpan<&str>| s.chars().into_iter().next().unwrap(), 18 | )(s) 19 | } 20 | -------------------------------------------------------------------------------- /src/parser/expr/literal/mod.rs: -------------------------------------------------------------------------------- 1 | use nom::{ 2 | branch::alt, bytes::complete::tag, character::complete::one_of, combinator::map, IResult, 3 | }; 4 | use nom_locate::LocatedSpan; 5 | use std::string::String; 6 | 7 | use crate::parser::Parser; 8 | 9 | // pub mod array; 10 | pub mod char; 11 | pub mod number; 12 | pub mod string; 13 | // pub mod struct_; 14 | 15 | pub fn escape_code(s: LocatedSpan<&str>) -> IResult, char> { 16 | one_of(r#"\"'nabfnrtvzx01234567{}"#)(s) 17 | } 18 | 19 | #[derive(Debug, PartialEq, Clone)] 20 | pub enum Number { 21 | Integer(i128), 22 | Floating(f64), 23 | } 24 | impl std::fmt::Display for Number { 25 | fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { 26 | match self { 27 | Number::Integer(i) => write!(f, "{}", i), 28 | Number::Floating(i) => write!(f, "{}", i), 29 | } 30 | } 31 | } 32 | 33 | impl Number { 34 | pub fn int(self) -> i128 { 35 | match self { 36 | Number::Integer(r) => r, 37 | Number::Floating(_) => panic!("Unknown Error"), 38 | } 39 | } 40 | } 41 | 42 | #[derive(Debug, PartialEq, Clone)] 43 | pub enum Literal { 44 | Null, 45 | Bool(bool), 46 | // Struct(Struct), 47 | // Array(Vec), 48 | String(String), 49 | Number(Number), 50 | // Default, 51 | } 52 | impl std::fmt::Display for Literal { 53 | fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { 54 | match self { 55 | Literal::Null => write!(f, "\x1b[1;33mnull\x1b[0m"), 56 | Literal::Bool(b) => write!(f, "\x1b[1;33m{}\x1b[0m", b), 57 | Literal::String(s) => write!(f, "\x1b[1;34m{:?}\x1b[0m", s), 58 | Literal::Number(n) => write!(f, "\x1b[1;33m{}\x1b[0m", n), 59 | } 60 | } 61 | } 62 | 63 | impl Parser for Literal { 64 | fn parse(s: LocatedSpan<&str>) -> IResult, Self> { 65 | alt(( 66 | // map(struct_::struct_, |s| Literal::Struct(s)), 67 | // map(array::array, |s| Literal::Array(s)), 68 | map(number::number, |s| Literal::Number(s)), 69 | map(string::string, |s| Literal::String(s)), 70 | //char 71 | //byte 72 | map(alt((tag("True"), tag("False"))), |s: LocatedSpan<&str>| { 73 | Literal::Bool(s.fragment() == &"True") 74 | }), // map(tag("Default"), |_| Literal::Default), 75 | map(tag("null"), |_| Literal::Null), 76 | ))(s) 77 | } 78 | } 79 | -------------------------------------------------------------------------------- /src/parser/expr/literal/number.rs: -------------------------------------------------------------------------------- 1 | use nom::{ 2 | branch::alt, 3 | bytes::complete::{tag, tag_no_case, take_till}, 4 | character::complete::{digit1, hex_digit1}, 5 | combinator::{map, opt, recognize}, 6 | sequence::tuple, 7 | IResult, 8 | }; 9 | use nom_locate::LocatedSpan; 10 | use std::string::{String, ToString}; 11 | 12 | use super::Number; 13 | 14 | fn hex(s: LocatedSpan<&str>) -> IResult, Number> { 15 | fn str2i(s: LocatedSpan<&str>) -> i128 { 16 | if let Ok(x) = i128::from_str_radix(&s[2..], 16) { 17 | x 18 | } else { 19 | 0 20 | } 21 | } 22 | map( 23 | map( 24 | recognize(tuple((tag_no_case("0x"), opt(hex_digit1)))), 25 | str2i, 26 | ), 27 | |s| Number::Integer(s), 28 | )(s) 29 | } 30 | 31 | fn bin(s: LocatedSpan<&str>) -> IResult, Number> { 32 | fn str2i(s: LocatedSpan<&str>) -> i128 { 33 | if let Ok(x) = i128::from_str_radix(&s[2..], 2) { 34 | x 35 | } else { 36 | 0 37 | } 38 | } 39 | map( 40 | map( 41 | recognize(tuple(( 42 | tag_no_case("0b"), 43 | take_till(|c| c != '0' && c != '1'), 44 | ))), 45 | str2i, 46 | ), 47 | |s| Number::Integer(s), 48 | )(s) 49 | } 50 | 51 | fn int(s: LocatedSpan<&str>) -> IResult, Number> { 52 | let (o, (s, v)) = tuple(( 53 | opt(alt((tag("-"), tag("+")))), 54 | alt(( 55 | hex, 56 | bin, 57 | map(digit1, |s: LocatedSpan<&str>| { 58 | Number::Integer(i128::from_str_radix(s.fragment(), 10).unwrap()) 59 | }), 60 | )), 61 | ))(s)?; 62 | if let Some(c) = s { 63 | if c.fragment() == &"-" { 64 | let v = Number::Integer(-v.int()); 65 | Ok((o, v)) 66 | } else { 67 | Ok((o, v)) 68 | } 69 | } else { 70 | Ok((o, v)) 71 | } 72 | } 73 | fn float(s: LocatedSpan<&str>) -> IResult, Number> { 74 | map( 75 | alt(( 76 | map( 77 | tuple(( 78 | map(opt(int), |s| { 79 | if let Some(n) = s { 80 | n.int().to_string() 81 | } else { 82 | "0".to_string() 83 | } 84 | }), 85 | map( 86 | tuple(( 87 | tag("."), 88 | map( 89 | alt(( 90 | bin, 91 | map(digit1, |s: LocatedSpan<&str>| { 92 | Number::Integer( 93 | i128::from_str_radix(s.fragment(), 10).unwrap(), 94 | ) 95 | }), 96 | )), 97 | |n| n.int().to_string(), 98 | ), 99 | )), 100 | |(a, b): (LocatedSpan<&str>, String)| a.fragment().to_string() + b.as_str(), 101 | ), 102 | map(opt(tuple((tag_no_case("e"), int))), |o| { 103 | let (e, n) = o?; 104 | Some((e, n.int().to_string())) 105 | }), 106 | )), 107 | |(a, b, c): (String, String, Option<(LocatedSpan<&str>, String)>)| { 108 | if let Some((c1, c2)) = c { 109 | a + &b + c1.fragment() + &c2 110 | } else { 111 | a + &b 112 | } 113 | }, 114 | ), 115 | map( 116 | tuple(( 117 | map(int, |s| s.int().to_string()), 118 | map( 119 | opt(tuple(( 120 | tag("."), 121 | map( 122 | alt(( 123 | bin, 124 | map(digit1, |s: LocatedSpan<&str>| { 125 | Number::Integer( 126 | i128::from_str_radix(s.fragment(), 10).unwrap(), 127 | ) 128 | }), 129 | )), 130 | |n| n.int().to_string(), 131 | ), 132 | ))), 133 | |o: Option<(LocatedSpan<&str>, String)>| { 134 | if let Some((a, b)) = o { 135 | a.fragment().to_string() + b.as_str() 136 | } else { 137 | "".to_string() 138 | } 139 | }, 140 | ), 141 | map(tuple((tag_no_case("e"), int)), |o| { 142 | let (e, n) = o; 143 | (e, n.int().to_string()) 144 | }), 145 | )), 146 | |(a, b, (c1, c2)): (String, String, (LocatedSpan<&str>, String))| { 147 | a + &b + c1.fragment() + &c2 148 | }, 149 | ), 150 | )), 151 | |s| { 152 | // println!("s is: {}", s); 153 | Number::Floating( 154 | s.parse::() 155 | .expect("ERROR could not covert value to valid float"), 156 | ) 157 | }, 158 | )(s) 159 | } 160 | 161 | pub fn number(s: LocatedSpan<&str>) -> IResult, Number> { 162 | alt((float, int))(s) 163 | } 164 | 165 | #[test] 166 | fn test_parse_number() { 167 | let numbers = [ 168 | "123", 169 | "+123", 170 | "-123", 171 | "0b110110", 172 | "+0b110110", 173 | "-0B110110", 174 | "0xFFFF", 175 | "+0xFFFF", 176 | "-0xFFFF", 177 | "3.14", 178 | "+3.14", 179 | "-3.14", 180 | "+0b110.114514", 181 | "+0xFFFF.0b110E-0xFFFF", 182 | ".10", 183 | "-1E10", 184 | ".0b110110E0xFF", 185 | ]; 186 | for res in numbers 187 | .iter() 188 | .map(|s| number(LocatedSpan::from(*s)).unwrap()) 189 | { 190 | // println!("{:?}", res); 191 | assert_eq!(res.0.fragment(), &""); 192 | } 193 | } 194 | -------------------------------------------------------------------------------- /src/parser/expr/literal/string.rs: -------------------------------------------------------------------------------- 1 | use nom::branch::alt; 2 | use nom::bytes::complete::{escaped, is_not, tag, take_until}; 3 | use nom::character::complete::{char}; 4 | 5 | use nom::combinator::map; 6 | 7 | use nom::sequence::{delimited}; 8 | use nom::{IResult}; 9 | use nom_locate::LocatedSpan; 10 | use std::borrow::ToOwned; 11 | use std::string::{String, ToString}; 12 | use std::vec::Vec; 13 | 14 | use super::escape_code; 15 | 16 | enum ControlChar { 17 | Byte(u8), 18 | IgnoreWhitespace, 19 | HexLit, 20 | OctLit, 21 | Codepoint, 22 | } 23 | 24 | pub fn rewrite<'a>( 25 | o: LocatedSpan<&'a str>, 26 | st: LocatedSpan<&'a str>, 27 | ) -> IResult, String> { 28 | let mut res = String::new(); 29 | let chars: Vec = st.chars().collect(); 30 | let mut i = 0; 31 | while i < chars.len() { 32 | if chars[i] == '\\' { 33 | if i + 1 != chars.len() { 34 | i += 1; 35 | let c = chars[i]; 36 | match c.to_ascii_lowercase() { 37 | '{' => res.push(c), 38 | '}' => res.push(c), 39 | '\\' => res.push(c), 40 | '\'' => res.push(c), 41 | '"' => res.push(c), 42 | 'n' => res.push('\n'), 43 | 'a' => res.push('\u{07}'), // bell 44 | 'b' => res.push('\u{08}'), // backspace 45 | 'f' => res.push('\u{0c}'), // form feed 46 | 'r' => res.push('\u{0d}'), // carriage return 47 | 't' => res.push('\u{09}'), // horizontal tab 48 | 'v' => res.push('\u{0b}'), // vertical tab 49 | 'x' => { 50 | i += 1; 51 | let mut string = String::new(); 52 | while i != chars.len() 53 | && "0123456789abcdef" 54 | .chars() 55 | .collect::>() 56 | .contains(&chars[i].to_ascii_lowercase()) 57 | { 58 | string.push(chars[i]); 59 | i += 1; 60 | } 61 | i -= 1; 62 | let c = u32::from_str_radix(&string, 16).unwrap(); 63 | // println!("C is {}", c); 64 | let c = char::from_u32(c).unwrap(); 65 | res.push(c); 66 | } 67 | c @ '0'..'9' => { 68 | i += 1; 69 | let mut string = String::new(); 70 | string.push(c); 71 | while i != chars.len() && ('0'..'9').contains(&chars[i]) { 72 | string.push(chars[i]); 73 | i += 1; 74 | } 75 | let c = u32::from_str_radix(&string, 8).unwrap(); 76 | let c = char::from_u32(c).unwrap(); 77 | res.push(c); 78 | i -= 1; 79 | } 80 | _ => { 81 | return Err(nom::Err::Error(nom::error::Error::new( 82 | o, 83 | nom::error::ErrorKind::Escaped, 84 | ))); 85 | } 86 | }; 87 | i += 1; 88 | } else { 89 | return Err(nom::Err::Error(nom::error::Error::new( 90 | o, 91 | nom::error::ErrorKind::Escaped, 92 | ))); 93 | } 94 | } else { 95 | res.push(chars[i]); 96 | i += 1; 97 | } 98 | } 99 | Ok((o, res)) 100 | } 101 | 102 | pub fn quoted_string(s: LocatedSpan<&str>) -> IResult, String> { 103 | let (o, i) = delimited( 104 | char('"'), 105 | escaped(is_not("\"\\"), '\\', escape_code), 106 | char('"'), 107 | )(s)?; 108 | rewrite(o, i) 109 | } 110 | 111 | pub fn raw_string(s: LocatedSpan<&str>) -> IResult, String> { 112 | let (l, _) = tag("##RAW")(s)?; 113 | let (l, s) = map(take_until("##"), |s: LocatedSpan<&str>| { 114 | s.fragment().to_string() 115 | })(l)?; 116 | let (l, _) = tag("##")(l)?; 117 | Ok((l, s)) 118 | } 119 | 120 | pub fn string(s: LocatedSpan<&str>) -> IResult, String> { 121 | let (o, s) = alt((quoted_string, raw_string))(s)?; 122 | Ok((o, s.to_owned())) 123 | } 124 | -------------------------------------------------------------------------------- /src/parser/expr/mod.rs: -------------------------------------------------------------------------------- 1 | use std::{ 2 | boxed::Box, 3 | string::{String, ToString}, 4 | vec::Vec, 5 | }; 6 | 7 | use nom::{ 8 | branch::alt, 9 | bytes::complete::tag, 10 | combinator::{map, opt}, 11 | multi::{many1, separated_list1}, 12 | sequence::tuple, 13 | IResult, 14 | }; 15 | use nom_locate::LocatedSpan; 16 | 17 | use crate::utils::{list0, list1, valid_name, ws}; 18 | 19 | use self::literal::{string::string, Literal}; 20 | 21 | use super::{ 22 | top_level::{parse_comments, TopLevel}, 23 | ty::{parse_type, Type}, 24 | Parser, 25 | }; 26 | 27 | pub mod literal; 28 | 29 | #[derive(Debug, Clone)] 30 | pub enum Expr { 31 | Pair(String, Box), 32 | Quoted(Box), 33 | Block(Vec), 34 | Literal(Literal), 35 | Ident(Vec), 36 | Array(Vec), 37 | Object(Vec<((Option, String), CommentedExpr)>), 38 | Closure( 39 | Vec<(String, Option)>, 40 | Option, 41 | Box, 42 | ), 43 | If(Box, Box, Box), 44 | MultiIf(Vec<(CommentedExpr, CommentedExpr)>, Box), 45 | For(String, Box, Box), 46 | // ll 47 | ErrorHandle(Box), 48 | SpecifyTyped(Box, Type), 49 | Index(Box, Box), 50 | Bind(Box, Box), 51 | Call(Box, Vec), 52 | Assign(Box, Box), 53 | } 54 | 55 | impl std::fmt::Display for Expr { 56 | fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { 57 | match self { 58 | Expr::Pair(s, e) => { 59 | write!(f, "\x1b[1;35m(\x1b[0m")?; 60 | write!(f, "\x1b[1;32m\"{}\"\x1b[0m: {}", s, e)?; 61 | write!(f, "\x1b[1;35m)\x1b[0m") 62 | } 63 | Expr::Quoted(q) => { 64 | write!(f, "\x1b[1;35m(\x1b[0m")?; 65 | write!(f, "{}", q)?; 66 | write!(f, "\x1b[1;35m)\x1b[0m") 67 | } 68 | Expr::Block(es) => { 69 | write!(f, "\x1b[1;35m{{ \x1b[0m")?; 70 | for (n, s) in es.iter().enumerate() { 71 | if n > 0 { 72 | write!(f, "; ")?; 73 | } 74 | write!(f, "{}", s)?; 75 | } 76 | write!(f, "\x1b[1;35m }}\x1b[0m") 77 | } 78 | Expr::Literal(l) => write!(f, "{}", l), 79 | Expr::Ident(i) => { 80 | for (n, s) in i.iter().enumerate() { 81 | if n > 0 { 82 | write!(f, "::")?; 83 | } 84 | write!(f, "\x1b[0;34m{}\x1b[0m", s)?; 85 | } 86 | Ok(()) 87 | } 88 | Expr::Array(a) => { 89 | write!(f, "\x1b[1;35m[\x1b[0m")?; 90 | for (n, s) in a.iter().enumerate() { 91 | if n > 0 { 92 | write!(f, ", ")?; 93 | } 94 | write!(f, "{}", s)?; 95 | } 96 | write!(f, "\x1b[1;35m]\x1b[0m") 97 | } 98 | Expr::Object(o) => { 99 | write!(f, "\x1b[1;35m{{\x1b[0m")?; 100 | for (n, s) in o.iter().enumerate() { 101 | if n > 0 { 102 | write!(f, ", ")?; 103 | } 104 | let ((comment, n), e) = s; 105 | let mut c = String::from("\x1b[0;36m"); 106 | if let Some(comment) = &comment { 107 | for l in comment.lines() { 108 | c += l; 109 | } 110 | } 111 | c += "\x1b[0;0m"; 112 | write!(f, "{}", c)?; 113 | write!(f, "\x1b[1;32m{}\x1b[0m: {}", n, e)?; 114 | } 115 | write!(f, "\x1b[1;35m}}\x1b[0m") 116 | } 117 | Expr::Closure(c, t, b) => { 118 | write!(f, "\x1b[1;35m(\x1b[0m")?; 119 | for (n, s) in c.iter().enumerate() { 120 | if n > 0 { 121 | write!(f, ", ")?; 122 | } 123 | let (s, t) = s; 124 | if let Some(t) = t { 125 | write!(f, "\x1b[0;34m{}\x1b[0m: {}", s, t)?; 126 | } else { 127 | write!(f, "\x1b[0;34m{}\x1b[0m", s)?; 128 | } 129 | } 130 | write!(f, "\x1b[1;35m)\x1b[0m")?; 131 | if let Some(t) = t { 132 | write!(f, " \x1b[1;35m->\x1b[0m {}", t)?; 133 | } 134 | write!(f, " {}", b) 135 | } 136 | Expr::If(a, b, c) => write!( 137 | f, 138 | "\x1b[1;35mif\x1b[0m ({}) {} \x1b[1;35melse\x1b[0m {}", 139 | a, b, c 140 | ), 141 | Expr::MultiIf(_, _) => todo!(), 142 | Expr::For(_, _, _) => todo!(), 143 | Expr::Call(a, b) => { 144 | write!(f, "{}", a)?; 145 | write!(f, "\x1b[1;35m(\x1b[0m")?; 146 | for (n, s) in b.iter().enumerate() { 147 | if n > 0 { 148 | write!(f, ", ")?; 149 | } 150 | write!(f, "{}", s)?; 151 | } 152 | write!(f, "\x1b[1;35m)\x1b[0m") 153 | } 154 | Expr::ErrorHandle(e) => write!(f, "{}\x1b[1;35m?\x1b[0m", e), 155 | Expr::Bind(a, b) => write!(f, "{}\x1b[1;35m.\x1b[0m{}", a, b), 156 | Expr::Index(a, b) => write!(f, "{}\x1b[1;35m[\x1b[0m{}\x1b[1;35m]\x1b[0m", a, b), 157 | Expr::Assign(a, b) => write!(f, "{}\x1b[1;35m = \x1b[0m{}", a, b), 158 | Expr::SpecifyTyped(a, b) => write!(f, "{}\x1b[1;35m : \x1b[0m{}", a, b), 159 | } 160 | } 161 | } 162 | 163 | impl std::fmt::Display for CommentedExpr { 164 | fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { 165 | let mut c = String::from("\x1b[0;36m"); 166 | if let Some(comment) = &self.comment { 167 | for l in comment.lines() { 168 | c += l; 169 | } 170 | } 171 | c += "\x1b[0;0m"; 172 | if c.as_str() != "\x1b[0;36m\x1b[0;0m" { 173 | write!(f, "#{}", c)?; 174 | } 175 | 176 | write!(f, "{}", self.expr) 177 | } 178 | } 179 | 180 | #[derive(Clone)] 181 | pub struct CommentedExpr { 182 | pub comment: Option, 183 | pub expr: Expr, 184 | } 185 | 186 | impl std::fmt::Debug for CommentedExpr { 187 | fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { 188 | if let Some(comment) = &self.comment { 189 | write!(f, "{:?} {:?}", comment.lines(), self.expr) 190 | } else { 191 | write!(f, "{:?}", self.expr) 192 | } 193 | } 194 | } 195 | 196 | impl CommentedExpr { 197 | pub fn from_expr(expr: Expr) -> Self { 198 | Self { 199 | comment: None, 200 | expr, 201 | } 202 | } 203 | } 204 | 205 | pub fn key_word(s: LocatedSpan<&str>) -> IResult, LocatedSpan<&str>> { 206 | alt(( 207 | // 208 | tag("string"), 209 | tag("number"), 210 | tag("bool"), 211 | tag("array"), 212 | tag("object"), 213 | tag("function"), 214 | tag("any"), 215 | tag("type"), 216 | // 217 | tag("null"), 218 | // 219 | tag("if"), 220 | tag("else"), 221 | tag("for"), 222 | tag("in"), 223 | tag("while"), 224 | tag("ARGS"), 225 | tag("ENV"), 226 | ))(s) 227 | } 228 | 229 | pub fn ident(s: LocatedSpan<&str>) -> IResult, String> { 230 | let (o, name) = valid_name(s)?; 231 | let k = key_word(name); 232 | match k { 233 | Ok((a, _)) => { 234 | if a.fragment() == &"" { 235 | Err(nom::Err::Error(nom::error::Error::new( 236 | name, 237 | nom::error::ErrorKind::Not, 238 | ))) 239 | } else { 240 | Ok((o, name.fragment().to_string())) 241 | } 242 | } 243 | Err(_) => Ok((o, name.fragment().to_string())), 244 | } 245 | } 246 | 247 | fn parse_block(s: LocatedSpan<&str>) -> IResult, Vec> { 248 | // list 1 expand 249 | list1("{", "}", ";", TopLevel::parse)(s) 250 | } 251 | 252 | pub(crate) fn parse_closure( 253 | s: LocatedSpan<&str>, 254 | ) -> IResult< 255 | LocatedSpan<&str>, 256 | ( 257 | Vec<(String, Option)>, 258 | Option, 259 | Box, 260 | ), 261 | > { 262 | tuple(( 263 | list0("(", ")", ",", |s| { 264 | map(tuple((ident, opt(ws), opt(type_specifier))), |(i, _, t)| { 265 | (i, t) 266 | })(s) 267 | }), 268 | opt(map( 269 | tuple((opt(ws), tag("->"), opt(ws), parse_type)), 270 | |(_, _, _, t)| t, 271 | )), 272 | map(tuple((opt(ws), CommentedExpr::parse)), |(_, e)| Box::new(e)), 273 | ))(s) 274 | } 275 | 276 | fn parse_array(s: LocatedSpan<&str>) -> IResult, Vec> { 277 | list0("[", "]", ",", CommentedExpr::parse)(s) 278 | } 279 | // TODO: after comment 280 | fn parse_object( 281 | s: LocatedSpan<&str>, 282 | ) -> IResult, Vec<((Option, String), CommentedExpr)>> { 283 | list0("{", "}", ",", |s| { 284 | alt(( 285 | map( 286 | tuple(( 287 | opt(parse_comments), 288 | ident, 289 | opt(ws), 290 | tag(":"), 291 | opt(ws), 292 | CommentedExpr::parse, 293 | )), 294 | |(c, s, _, _, _, e)| ((c, s.to_string()), e), 295 | ), 296 | map( 297 | tuple(( 298 | opt(parse_comments), 299 | string, 300 | opt(ws), 301 | tag(":"), 302 | opt(ws), 303 | CommentedExpr::parse, 304 | )), 305 | |(c, s, _, _, _, e)| ((c, s), e), 306 | ), 307 | map( 308 | tuple((opt(parse_comments), separated_list1(tag("::"), ident))), 309 | |(c, s)| { 310 | ( 311 | (c, s.last().unwrap().clone()), 312 | CommentedExpr { 313 | comment: None, 314 | expr: Expr::Ident(s), 315 | }, 316 | ) 317 | }, 318 | ), 319 | ))(s) 320 | })(s) 321 | } 322 | fn parse_if( 323 | s: LocatedSpan<&str>, 324 | ) -> IResult, (CommentedExpr, CommentedExpr, CommentedExpr)> { 325 | map( 326 | tuple(( 327 | tag("if"), 328 | ws, 329 | CommentedExpr::parse, 330 | opt(ws), 331 | CommentedExpr::parse, 332 | opt(ws), 333 | tuple((tag("else"), ws, CommentedExpr::parse)), 334 | )), 335 | |(_, _, e, _, b, _, (_, _, o))| (e, b, o), 336 | )(s) 337 | } 338 | 339 | fn parse_multi_if_body( 340 | s: LocatedSpan<&str>, 341 | ) -> IResult, Vec<(CommentedExpr, CommentedExpr)>> { 342 | map( 343 | tuple(( 344 | tag("|"), 345 | ws, 346 | separated_list1( 347 | tuple((opt(ws), tag("|"), ws)), 348 | map( 349 | tuple((CommentedExpr::parse, opt(ws), CommentedExpr::parse)), 350 | |(a, _, b)| (a, b), 351 | ), 352 | ), 353 | )), 354 | |(_, _, s)| s, 355 | )(s) 356 | } 357 | 358 | fn parse_for( 359 | s: LocatedSpan<&str>, 360 | ) -> IResult, (String, Box, Box)> { 361 | map( 362 | tuple(( 363 | tag("for"), 364 | ws, 365 | ident, 366 | ws, 367 | tag("in"), 368 | ws, 369 | CommentedExpr::parse, 370 | opt(ws), 371 | CommentedExpr::parse, 372 | )), 373 | |(_, _, i, _, _, _, e, _, b)| (i.to_string(), Box::new(e), Box::new(b)), 374 | )(s) 375 | } 376 | fn parse_pair(s: LocatedSpan<&str>) -> IResult, (String, CommentedExpr)> { 377 | map( 378 | tuple(( 379 | tag("("), 380 | opt(ws), 381 | string, 382 | opt(ws), 383 | tag(":"), 384 | opt(ws), 385 | CommentedExpr::parse, 386 | opt(ws), 387 | tag(")"), 388 | )), 389 | |(_, _, s, _, _, _, e, _, _)| (s, e), 390 | )(s) 391 | } 392 | fn parse_multi_if( 393 | s: LocatedSpan<&str>, 394 | ) -> IResult, (Vec<(CommentedExpr, CommentedExpr)>, CommentedExpr)> { 395 | map( 396 | tuple(( 397 | tag("if"), 398 | ws, 399 | parse_multi_if_body, 400 | opt(ws), 401 | tuple((tag("else"), ws, CommentedExpr::parse)), 402 | )), 403 | |(_, _, l, _, (_, _, e))| (l, e), 404 | )(s) 405 | } 406 | 407 | fn q(s: LocatedSpan<&str>) -> IResult, LocatedSpan<&str>> { 408 | tag("?")(s) 409 | } 410 | fn type_specifier(s: LocatedSpan<&str>) -> IResult, Type> { 411 | map(tuple((tag(":"), opt(ws), parse_type)), |(_, _, ty)| ty)(s) 412 | } 413 | 414 | fn expr_ll(l: CommentedExpr, r: LocatedSpan<&str>) -> IResult, CommentedExpr> { 415 | let (r, (comment, _)) = tuple((opt(parse_comments), opt(ws)))(r)?; 416 | if let Ok((r, _)) = q(r) { 417 | expr_ll( 418 | CommentedExpr { 419 | comment, 420 | expr: Expr::ErrorHandle(Box::new(l)), 421 | }, 422 | r, 423 | ) 424 | } else if let Ok((r, c)) = list0("(", ")", ",", CommentedExpr::parse)(r) { 425 | expr_ll( 426 | CommentedExpr { 427 | comment, 428 | expr: Expr::Call(Box::new(l), c), 429 | }, 430 | r, 431 | ) 432 | } else if let Ok((r, (_, _, e, _, _))) = 433 | tuple((tag("["), opt(ws), CommentedExpr::parse, opt(ws), tag("]")))(r) 434 | { 435 | expr_ll( 436 | CommentedExpr { 437 | comment, 438 | expr: Expr::Index(Box::new(l), Box::new(e)), 439 | }, 440 | r, 441 | ) 442 | } else if let Ok((r, (_, _, e))) = tuple((tag("."), opt(ws), CommentedExpr::parse))(r) { 443 | expr_ll( 444 | CommentedExpr { 445 | comment, 446 | expr: Expr::Bind(Box::new(l), Box::new(e)), 447 | }, 448 | r, 449 | ) 450 | } else if let Ok((r, (_, _, e))) = tuple((tag("="), opt(ws), CommentedExpr::parse))(r) { 451 | expr_ll( 452 | CommentedExpr { 453 | comment, 454 | expr: Expr::Assign(Box::new(l), Box::new(e)), 455 | }, 456 | r, 457 | ) 458 | } else if let Ok((r, ty)) = type_specifier(r) { 459 | expr_ll( 460 | CommentedExpr { 461 | comment, 462 | expr: Expr::SpecifyTyped(Box::new(l), ty), 463 | }, 464 | r, 465 | ) 466 | } else { 467 | Ok((r, l)) 468 | } 469 | } 470 | 471 | pub fn reverse_bind(e: CommentedExpr) -> CommentedExpr { 472 | let CommentedExpr { comment, expr } = e; 473 | fn reverse_bind_expr(expr: Expr) -> Expr { 474 | match expr { 475 | Expr::Quoted(e) => Expr::Quoted(Box::new(reverse_bind(*e))), 476 | Expr::Block(es) => Expr::Block( 477 | es.iter() 478 | .map(|e| { 479 | if let TopLevel::Expr(e) = e { 480 | TopLevel::Expr(Box::new(reverse_bind(*e.clone()))) 481 | } else { 482 | e.clone() 483 | } 484 | }) 485 | .collect(), 486 | ), 487 | Expr::Array(es) => Expr::Array(es.iter().map(|e| reverse_bind(e.clone())).collect()), 488 | Expr::Object(o) => Expr::Object( 489 | o.iter() 490 | .map(|(s, e)| (s.clone(), reverse_bind(e.clone()))) 491 | .collect(), 492 | ), 493 | Expr::Closure(a, b, e) => Expr::Closure(a, b, Box::new(reverse_bind(*e))), 494 | Expr::If(a, b, c) => { 495 | Expr::If(a, Box::new(reverse_bind(*b)), Box::new(reverse_bind(*c))) 496 | } 497 | Expr::MultiIf(ifs, e) => Expr::MultiIf( 498 | ifs.iter() 499 | .map(|(e1, e2)| (reverse_bind(e1.clone()), reverse_bind(e2.clone()))) 500 | .collect(), 501 | Box::new(reverse_bind(*e)), 502 | ), 503 | Expr::For(a, b, c) => { 504 | Expr::For(a, Box::new(reverse_bind(*b)), Box::new(reverse_bind(*c))) 505 | } 506 | Expr::Call(a, b) => Expr::Call( 507 | Box::new(reverse_bind(*a)), 508 | b.iter().map(|e| reverse_bind(e.clone())).collect(), 509 | ), 510 | Expr::ErrorHandle(e) => Expr::ErrorHandle(Box::new(reverse_bind(*e))), 511 | Expr::Bind( 512 | box CommentedExpr { 513 | comment: c1, 514 | expr: a, 515 | }, 516 | box CommentedExpr { 517 | comment: c2, 518 | expr: Expr::Bind(b, c), 519 | }, 520 | ) => Expr::Bind( 521 | Box::new(reverse_bind(CommentedExpr { 522 | comment: c2, 523 | expr: Expr::Bind( 524 | Box::new(CommentedExpr { 525 | comment: c1, 526 | expr: a, 527 | }), 528 | Box::new(reverse_bind(*b)), 529 | ), 530 | })), 531 | Box::new(reverse_bind(*c)), 532 | ), 533 | Expr::Index(a, b) => { 534 | Expr::Index(Box::new(reverse_bind(*a)), Box::new(reverse_bind(*b))) 535 | } 536 | Expr::Assign(a, b) => { 537 | Expr::Assign(Box::new(reverse_bind(*a)), Box::new(reverse_bind(*b))) 538 | } 539 | Expr::SpecifyTyped(a, t) => Expr::SpecifyTyped(Box::new(reverse_bind(*a)), t), 540 | e => e, 541 | } 542 | } 543 | CommentedExpr { 544 | comment, 545 | expr: reverse_bind_expr(expr), 546 | } 547 | } 548 | 549 | impl Parser for CommentedExpr { 550 | fn parse(s: LocatedSpan<&str>) -> IResult, Self> { 551 | let (l, r) = map( 552 | tuple(( 553 | opt(parse_comments), 554 | alt(( 555 | map(parse_pair, |(a, b)| Expr::Pair(a, Box::new(b))), 556 | map(parse_closure, |(a, b, c)| Expr::Closure(a, b, c)), 557 | map( 558 | tuple((tag("("), opt(ws), CommentedExpr::parse, opt(ws), tag(")"))), 559 | |(_, _, e, _, _)| Expr::Quoted(Box::new(e)), 560 | ), 561 | map(Literal::parse, |l| Expr::Literal(l)), 562 | map(parse_object, |b| Expr::Object(b)), 563 | map(parse_block, |b| Expr::Block(b)), 564 | map(parse_if, |(a, b, c)| { 565 | Expr::If(Box::new(a), Box::new(b), Box::new(c)) 566 | }), 567 | map(parse_for, |(a, b, c)| Expr::For(a, b, c)), 568 | map(separated_list1(tag("::"), ident), |s| Expr::Ident(s)), 569 | map(parse_multi_if, |(a, b)| Expr::MultiIf(a, Box::new(b))), 570 | map(parse_array, |a| Expr::Array(a)), 571 | // map(parse_), 572 | )), 573 | opt(parse_comments), 574 | )), 575 | |(c1, e, c2)| { 576 | let comment = match c1 { 577 | Some(c1) => match c2 { 578 | Some(c2) => Some(c1 + &c2), 579 | None => Some(c1), 580 | }, 581 | None => c2, 582 | }; 583 | CommentedExpr { comment, expr: e } 584 | }, 585 | )(s)?; 586 | expr_ll(r, l).map(|(s, e)| (s, reverse_bind(e))) 587 | } 588 | } 589 | 590 | #[test] 591 | fn test_expr() { 592 | let exprs = [ 593 | "{ 594 | 1?; 595 | 2; 596 | 3; 597 | }", 598 | "1", 599 | "a", 600 | "\"shit\"", 601 | "[ 1,\n 2,\t a,b][ 0]", 602 | "1(2,3)", 603 | "if 1 {\n\n\n\n2\n\n\n\n}\n\t\r else \n\n\n\n{\n\n\n\n3\n\n\n\n\n\n}", 604 | r"if 605 | | 2 { 3 } 606 | | 607 | 4 { 608 | 5; 609 | } 610 | else { 6 }", 611 | "null", 612 | "err(\"an error\")", 613 | "a(1,2)(3,4).b(1).c(2).d()", 614 | "a[1][2]", 615 | "a = b = c[10] = d[\"t\"] = 1", 616 | "{a,\"b\":c, \nd\t:\r 3, }", 617 | "for i in j {i}", 618 | "a::b::c()?.a::d", 619 | "a : (number,number) -> number = 1", 620 | "(a:number)->number {1; a[1]; if 1 {2} else {3}}", 621 | "a.b.c.d", 622 | ]; 623 | for e in exprs { 624 | let r = CommentedExpr::parse(LocatedSpan::from(e)); 625 | assert!(r.is_ok()); 626 | let (r0, r1) = r.unwrap(); 627 | // assert_eq!(, ""); 628 | println!("{:?}\n", r1); 629 | } 630 | } 631 | -------------------------------------------------------------------------------- /src/parser/mod.rs: -------------------------------------------------------------------------------- 1 | use nom::IResult; 2 | use nom_locate::LocatedSpan; 3 | 4 | pub mod expr; 5 | pub mod top_level; 6 | pub mod ty; 7 | 8 | pub trait Parser 9 | where 10 | Self: Sized, 11 | { 12 | fn parse(s: LocatedSpan<&str>) -> IResult, Self>; 13 | } 14 | -------------------------------------------------------------------------------- /src/parser/top_level.rs: -------------------------------------------------------------------------------- 1 | use crate::parser::expr::literal::string::string; 2 | 3 | use crate::parser::expr::CommentedExpr; 4 | use crate::utils::list1; 5 | use nom::branch::alt; 6 | 7 | use nom::bytes::complete::take_while; 8 | use nom::multi::many1; 9 | use nom::{ 10 | bytes::complete::tag, 11 | combinator::{map, opt}, 12 | multi::separated_list1, 13 | sequence::tuple, 14 | IResult, 15 | }; 16 | use nom_locate::LocatedSpan; 17 | use std::boxed::Box; 18 | 19 | use std::string::String; 20 | use std::string::ToString; 21 | use std::vec::Vec; 22 | 23 | use crate::{parser::expr::ident, utils::ws}; 24 | 25 | use super::expr::literal::string::raw_string; 26 | use super::Parser; 27 | use super::{expr::Expr, ty::Type}; 28 | #[derive(Debug, Clone)] 29 | pub enum TopLevel { 30 | Comment(String), 31 | TypeDef(String, CommentedExpr), 32 | EnumDef(String, Vec<(String, CommentedExpr)>), 33 | // import module from path 34 | ImportPath(String, String), 35 | // TODO: import module from url 36 | // TODO: Module(String, Vec) module name {8} 37 | Expr(Box), 38 | } 39 | 40 | impl std::fmt::Display for TopLevel { 41 | fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { 42 | match self { 43 | Self::Comment(comment) => { 44 | let mut c = String::from("\x1b[0;36m"); 45 | for l in comment.lines() { 46 | c += l; 47 | } 48 | c += "\x1b[0;0m"; 49 | write!(f, "#{}", c) 50 | } 51 | Self::Expr(e) => write!(f, "{}", e), 52 | Self::TypeDef(n, e) => write!( 53 | f, 54 | "\x1b[0;35mtype\x1b[0;36m {}\x1b[0;35m = \x1b[0m {}", 55 | n, e 56 | ), 57 | _ => todo!(), 58 | } 59 | } 60 | } 61 | 62 | fn parse_type_def(s: LocatedSpan<&str>) -> IResult, TopLevel> { 63 | map( 64 | tuple(( 65 | tag("type"), 66 | ws, 67 | ident, 68 | opt(ws), 69 | tag("="), 70 | opt(ws), 71 | CommentedExpr::parse, 72 | )), 73 | |(_, _, i, _, _, _, c)| TopLevel::TypeDef(i, c), 74 | )(s) 75 | } 76 | fn parse_enum_body( 77 | s: LocatedSpan<&str>, 78 | ) -> IResult, Vec<(String, CommentedExpr)>> { 79 | map( 80 | tuple(( 81 | tag("|"), 82 | opt(ws), 83 | separated_list1( 84 | tuple((opt(ws), tag("|"), ws)), 85 | map( 86 | tuple((ident, opt(ws), tag(":"), opt(ws), CommentedExpr::parse)), 87 | |(i, _, _, _, c)| (i, c), 88 | ), 89 | ), 90 | )), 91 | |(_, _, s)| s, 92 | )(s) 93 | } 94 | 95 | fn parse_enum_def(s: LocatedSpan<&str>) -> IResult, TopLevel> { 96 | map( 97 | tuple((tag("type"), ws, ident, opt(ws), parse_enum_body)), 98 | |(_, _, i, _, b)| TopLevel::EnumDef(i, b), 99 | )(s) 100 | } 101 | 102 | fn parse_import(s: LocatedSpan<&str>) -> IResult, TopLevel> { 103 | let (l, (_, _, v, _, _, _, s)) = 104 | tuple((tag("import"), ws, ident, ws, tag("from path"), ws, string))(s)?; 105 | Ok((l, TopLevel::ImportPath(v, s))) 106 | } 107 | 108 | impl Parser for TopLevel { 109 | fn parse(s: LocatedSpan<&str>) -> IResult, Self> { 110 | alt(( 111 | map(parse_comments, |c| TopLevel::Comment(c)), 112 | parse_type_def, 113 | parse_enum_def, 114 | parse_import, 115 | map(CommentedExpr::parse, |e| TopLevel::Expr(Box::new(e))), 116 | ))(s) 117 | } 118 | } 119 | 120 | pub fn doc(s: LocatedSpan<&str>) -> IResult, LocatedSpan<&str>> { 121 | map(tuple((tag("##DOC"), take_while(|s| s != '\n'))), |(_, s)| s)(s) 122 | } 123 | 124 | pub fn parse_comment(s: LocatedSpan<&str>) -> IResult, String> { 125 | let (s, _) = opt(ws)(s)?; 126 | let _ = tag("#")(s)?; 127 | if let Ok((_, _)) = doc(s) { 128 | Err(nom::Err::Error(nom::error::Error::new( 129 | s, 130 | nom::error::ErrorKind::IsNot, 131 | ))) 132 | } else if let Ok((_, _)) = raw_string(s) { 133 | Err(nom::Err::Error(nom::error::Error::new( 134 | s, 135 | nom::error::ErrorKind::IsNot, 136 | ))) 137 | } else { 138 | map( 139 | tuple((tag("#"), take_while(|s| s != '\n'), opt(ws))), 140 | |(_, c, _)| c.fragment().to_string(), 141 | )(s) 142 | } 143 | } 144 | 145 | pub fn parse_comments(s: LocatedSpan<&str>) -> IResult, String> { 146 | map(many1(parse_comment), |v| { 147 | let mut s = String::new(); 148 | for i in v { 149 | s += &i; 150 | } 151 | s 152 | })(s) 153 | } 154 | 155 | #[test] 156 | fn test_parse_comment() { 157 | let commnets = [ 158 | " # abc\"@aaaa\t\n\t# bcd\n#efg", 159 | "#abc\nabc", 160 | "##DOC abcabcabc", 161 | ]; 162 | for _c in commnets { 163 | // println!("{:?}", parse_comments(LocatedSpan::new(c))); 164 | } 165 | } 166 | -------------------------------------------------------------------------------- /src/parser/ty.rs: -------------------------------------------------------------------------------- 1 | use std::collections::BTreeMap; 2 | 3 | use nom::{ 4 | branch::alt, 5 | bytes::complete::tag, 6 | combinator::{map, opt}, 7 | multi::separated_list1, 8 | sequence::tuple, 9 | IResult, 10 | }; 11 | use nom_locate::LocatedSpan; 12 | use std::{boxed::Box, string::String, vec::Vec}; 13 | 14 | use crate::{ 15 | parser::expr::ident, 16 | utils::{list0, ws}, 17 | }; 18 | 19 | #[derive(Debug, Clone)] 20 | pub enum Type { 21 | Pair(String, Box), 22 | Any, 23 | // AnyArgsList, 24 | Number, 25 | String, 26 | Bool, 27 | Function(Vec, Box), 28 | Array, 29 | Object(BTreeMap), 30 | Enum(Vec), 31 | Alias(Vec), 32 | } 33 | impl std::fmt::Display for Type { 34 | fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { 35 | match self { 36 | Type::Pair(s, t) => write!( 37 | f, 38 | "\x1b[1;35m(\x1b[0m\x1b[1;32m\"{}\"\x1b[0m: {}\x1b[1;35m)\x1b[0m", 39 | s, t 40 | ), 41 | Type::Any => write!(f, "\x1b[1;32many\x1b[0m"), 42 | Type::Number => write!(f, "\x1b[1;32mnumber\x1b[0m"), 43 | Type::String => write!(f, "\x1b[1;32mstring\x1b[0m"), 44 | Type::Bool => write!(f, "\x1b[1;32mbool\x1b[0m"), 45 | Type::Function(ps, r) => { 46 | write!(f, "\x1b[1;35m(\x1b[0m")?; 47 | for (n, s) in ps.iter().enumerate() { 48 | if n > 0 { 49 | write!(f, ", ")?; 50 | } 51 | write!(f, "{}", s)?; 52 | } 53 | write!(f, "\x1b[1;35m)\x1b[0m")?; 54 | write!(f, " \x1b[1;35m->\x1b[0m {}", r) 55 | } 56 | Type::Array => write!(f, "\x1b[1;32marray\x1b[0m"), 57 | Type::Object(o) => { 58 | write!(f, "\x1b[1;35m{{\x1b[0m")?; 59 | for (n, s) in o.iter().enumerate() { 60 | if n > 0 { 61 | write!(f, ", ")?; 62 | } 63 | let (sss, ssss) = s; 64 | write!(f, "\x1b[1;32m{}\x1b[0m: {}", sss, ssss)?; 65 | } 66 | write!(f, "\x1b[1;35m}}\x1b[0m") 67 | } 68 | Type::Enum(_) => todo!(), 69 | Type::Alias(a) => { 70 | for (n, s) in a.iter().enumerate() { 71 | if n > 0 { 72 | write!(f, "::")?; 73 | } 74 | write!(f, "\x1b[0;36m{}\x1b[0m", s)?; 75 | } 76 | Ok(()) 77 | } 78 | } 79 | } 80 | } 81 | 82 | pub fn parse_function_type(s: LocatedSpan<&str>) -> IResult, Type> { 83 | let (l, (v, _, _, _, t)) = tuple(( 84 | list0("(", ")", ",", parse_type), 85 | opt(ws), 86 | tag("->"), 87 | opt(ws), 88 | parse_type, 89 | ))(s)?; 90 | Ok((l, Type::Function(v, Box::new(t)))) 91 | } 92 | 93 | pub fn parse_type(s: LocatedSpan<&str>) -> IResult, Type> { 94 | alt(( 95 | map(separated_list1(tag("::"), ident), |i| Type::Alias(i)), 96 | map(tag("any"), |_| Type::Any), 97 | map(tag("number"), |_| Type::Number), 98 | map(tag("string"), |_| Type::String), 99 | map(tag("bool"), |_| Type::Bool), 100 | map(tag("array"), |_| Type::Array), 101 | map(tag("object"), |_| Type::Object(BTreeMap::new())), 102 | parse_function_type, 103 | ))(s) 104 | } 105 | -------------------------------------------------------------------------------- /src/state/evaluator/mod.rs: -------------------------------------------------------------------------------- 1 | use std::{borrow::Borrow, cell::UnsafeCell}; 2 | use std::{ 3 | borrow::ToOwned, boxed::Box, collections::BTreeMap, rc::Rc, string::String, vec, vec::Vec, 4 | }; 5 | 6 | use crate::parser::expr::{ 7 | literal::{Literal, Number}, 8 | CommentedExpr, Expr, 9 | }; 10 | use crate::parser::top_level::TopLevel; 11 | use crate::state::evaluator::value::Value; 12 | 13 | pub mod value; 14 | pub struct EvaledImports { 15 | pub imports: BTreeMap>>, 16 | } 17 | 18 | #[derive(Debug, Clone)] 19 | pub struct EvalContext { 20 | pub imports: Rc>, 21 | pub current_scope_import_alias: BTreeMap, 22 | pub(crate) eval_parent_scope: Option>>, 23 | pub(crate) eval_current_scope_variables: BTreeMap>>, 24 | } 25 | impl EvalContext { 26 | fn new_eval_sup_scope(context: Rc>) -> Self { 27 | Self { 28 | imports: unsafe { &*context.get() }.imports.clone(), 29 | current_scope_import_alias: BTreeMap::new(), 30 | eval_parent_scope: Some(context), 31 | eval_current_scope_variables: BTreeMap::new(), 32 | } 33 | } 34 | 35 | fn get_eval_variable_by_name(&self, k: &[String]) -> Option>> { 36 | if k.len() == 1 { 37 | if self 38 | .eval_current_scope_variables 39 | .contains_key(k.last().unwrap()) 40 | { 41 | Some(self.eval_current_scope_variables[k.last().unwrap()].clone()) 42 | } else { 43 | if let Some(p) = self.eval_parent_scope.clone() { 44 | (unsafe { &*p.get() }).get_eval_variable_by_name(k) 45 | } else { 46 | None 47 | } 48 | } 49 | } else { 50 | get_source(Rc::new(UnsafeCell::new(self.clone())), k) 51 | } 52 | } 53 | } 54 | 55 | fn get_source(context: Rc>, s: &[String]) -> Option>> { 56 | let c = unsafe { &*context.get() }; 57 | match c.current_scope_import_alias.get(&s[0]) { 58 | Some(source) => unsafe { &*unsafe { &*c.imports.get() }.imports[&s[0]].get() } 59 | .get_eval_variable_by_name(&s[1..]), 60 | None => get_source(c.eval_parent_scope.as_ref()?.clone(), s), 61 | } 62 | } 63 | 64 | pub unsafe fn call_func_with_expr( 65 | f: Value, 66 | args: Vec, 67 | context: Rc>, 68 | ) -> Result>, &'static str> { 69 | let mut v = vec![]; 70 | for a in &args { 71 | let a = Rc::new(UnsafeCell::new( 72 | unsafe { &*eval_expr(a, context.clone())?.get() }.clone(), 73 | )); 74 | v.push(a); 75 | } 76 | if let Value::Function(fargs, h, ct, fb) = &mut f.clone() { 77 | if v.len() > fargs.len() { 78 | for i in 0..fargs.len() { 79 | h.insert(fargs[h.len()].clone(), v[i].clone()); 80 | } 81 | for (k, v) in h.clone() { 82 | (&mut *ct.get()) 83 | .eval_current_scope_variables 84 | .insert(k.clone(), v.clone()); 85 | } 86 | let r = eval_expr(fb, ct.clone())?; 87 | let r = r.as_ref(); 88 | let r = unsafe { &mut *r.get() }; 89 | call_func_with_expr( 90 | r.clone(), 91 | args[h.len()..] 92 | .iter() 93 | .map(|x| x.clone()) 94 | .collect::>(), 95 | context, 96 | ) 97 | } else if v.len() < fargs.len() { 98 | let mut ctx = EvalContext::new_eval_sup_scope(context); 99 | ctx.eval_current_scope_variables 100 | .insert("@func".to_owned(), Rc::new(UnsafeCell::new(f))); 101 | let mut expr = CommentedExpr::from_expr(Expr::Closure( 102 | fargs[v.len()..] 103 | .iter() 104 | .map(|x| (x.clone(), None)) 105 | .collect::>(), 106 | None, 107 | Box::new(CommentedExpr::from_expr(Expr::Call( 108 | Box::new(CommentedExpr::from_expr(Expr::Ident(vec![ 109 | "@func".to_owned() 110 | ]))), 111 | { 112 | let mut vv = args; 113 | vv.append( 114 | &mut fargs[v.len()..] 115 | .iter() 116 | .map(|x| CommentedExpr::from_expr(Expr::Ident(vec![x.clone()]))) 117 | .collect::>(), 118 | ); 119 | vv 120 | }, 121 | ))), 122 | )); 123 | eval_expr(&mut expr, Rc::new(UnsafeCell::new(ctx))) 124 | } else { 125 | let hh = h.clone(); 126 | for i in 0..v.len() { 127 | h.insert(fargs[h.len()].clone(), v[i].clone()); 128 | } 129 | for (k, v) in h.clone() { 130 | (&mut *ct.get()) 131 | .eval_current_scope_variables 132 | .insert(k.clone(), v.clone()); 133 | } 134 | let r = eval_expr(fb, ct.clone()); 135 | *h = hh; 136 | r 137 | } 138 | } else if let Value::NativeFunction(_name, fargs, mut h, ff) = f.clone() { 139 | if v.len() > fargs.len() { 140 | let _hh = h.clone(); 141 | let mut vv = vec![]; 142 | for i in 0..fargs.len() { 143 | h.insert(fargs[h.len()].clone(), v[i].clone()); 144 | } 145 | for i in fargs { 146 | vv.push(h.get(&i).unwrap().clone().as_ref().get()) 147 | } 148 | let (p, len, _) = vv.into_raw_parts(); 149 | let r = Rc::new(ff(len, p)); 150 | let r = r.as_ref(); 151 | let r = unsafe { &mut *r.get() }; 152 | call_func_with_expr( 153 | r.clone(), 154 | args[h.len()..] 155 | .iter() 156 | .map(|x| x.clone()) 157 | .collect::>(), 158 | context, 159 | ) 160 | } else if v.len() < fargs.len() { 161 | let mut ctx = EvalContext::new_eval_sup_scope(context); 162 | ctx.eval_current_scope_variables 163 | .insert("@func".to_owned(), Rc::new(UnsafeCell::new(f))); 164 | let mut expr = CommentedExpr::from_expr(Expr::Closure( 165 | fargs[v.len()..] 166 | .iter() 167 | .map(|x| (x.clone(), None)) 168 | .collect::>(), 169 | None, 170 | Box::new(CommentedExpr::from_expr(Expr::Call( 171 | Box::new(CommentedExpr::from_expr(Expr::Ident(vec![ 172 | "@func".to_owned() 173 | ]))), 174 | { 175 | let mut vv = args; 176 | vv.append( 177 | &mut fargs[v.len()..] 178 | .iter() 179 | .map(|x| CommentedExpr::from_expr(Expr::Ident(vec![x.clone()]))) 180 | .collect::>(), 181 | ); 182 | vv 183 | }, 184 | ))), 185 | )); 186 | eval_expr(&mut expr, Rc::new(UnsafeCell::new(ctx))) 187 | } else { 188 | let _hh = h.clone(); 189 | let mut vv = vec![]; 190 | for i in 0..fargs.len() { 191 | h.insert(fargs[h.len()].clone(), v[i].clone()); 192 | } 193 | for i in fargs { 194 | vv.push(h.get(&i).unwrap().clone().as_ref().get()) 195 | } 196 | let (p, len, _) = vv.into_raw_parts(); 197 | let r = Rc::new(ff(len, p)); 198 | Ok(r) 199 | } 200 | } else { 201 | panic!("DID YOU PASS TYPE CHECKER RIGHT?") 202 | } 203 | } 204 | 205 | pub fn eval_toplevel( 206 | t: &TopLevel, 207 | context: Rc>, 208 | ) -> Result>, &'static str> { 209 | match t { 210 | TopLevel::Comment(_c) => Ok(Rc::new(UnsafeCell::new(Value::Null))), 211 | TopLevel::TypeDef(name, expr) => { 212 | let clos = eval_expr(expr, context.clone())?; 213 | unsafe { &mut *context.clone().get() } 214 | .eval_current_scope_variables 215 | .insert(name.clone(), clos.clone()); 216 | Ok(Rc::new(UnsafeCell::new(Value::Null))) 217 | } 218 | TopLevel::EnumDef(_, _) => todo!(), 219 | TopLevel::ImportPath(_, _) => todo!(), 220 | TopLevel::Expr(box e) => eval_expr(e, context), 221 | } 222 | } 223 | 224 | pub fn eval_expr( 225 | e: &CommentedExpr, 226 | context: Rc>, 227 | ) -> Result>, &'static str> { 228 | // println!("trace: expr: {:?} context: {:?}", e, unsafe { 229 | // &*context.as_ref().get() 230 | // }); 231 | let CommentedExpr { 232 | comment: _, 233 | expr: e, 234 | } = e; 235 | match e { 236 | Expr::Pair(s, o) => Ok(Rc::new(UnsafeCell::new(Value::Pair( 237 | s.clone(), 238 | eval_expr(&*o, context)?, 239 | )))), 240 | Expr::Quoted(e) => eval_expr(e, context), 241 | Expr::Block(es) => { 242 | let ct = Rc::new(UnsafeCell::new(EvalContext::new_eval_sup_scope( 243 | context.clone(), 244 | ))); 245 | let mut r = Rc::new(UnsafeCell::new(Value::Null)); 246 | for e in es { 247 | r = eval_toplevel(e, ct.clone())?; 248 | } 249 | Ok(r) 250 | } 251 | Expr::Literal(l) => match l { 252 | crate::parser::expr::literal::Literal::Null => { 253 | Ok(Rc::new(UnsafeCell::new(Value::Null))) 254 | } 255 | crate::parser::expr::literal::Literal::Bool(b) => { 256 | Ok(Rc::new(UnsafeCell::new(Value::Bool(*b)))) 257 | } 258 | // TODO: formated string 259 | crate::parser::expr::literal::Literal::String(s) => { 260 | Ok(Rc::new(UnsafeCell::new(Value::String(s.clone())))) 261 | } 262 | crate::parser::expr::literal::Literal::Number(n) => { 263 | Ok(Rc::new(UnsafeCell::new(Value::Number(n.clone())))) 264 | } 265 | }, 266 | Expr::Ident(i) => { 267 | match unsafe { &*context.get() }.get_eval_variable_by_name(i.as_slice()) { 268 | Some(n) => Ok(n), 269 | None => Err("no var"), 270 | } 271 | } 272 | Expr::Array(a) => { 273 | let mut v = vec![]; 274 | for a in a { 275 | let a = eval_expr(a, context.clone())?; 276 | v.push(a); 277 | } 278 | Ok(Rc::new(UnsafeCell::new(Value::Array(v)))) 279 | } 280 | Expr::Object(es) => { 281 | let mut b = BTreeMap::new(); 282 | for ((_, k), v) in es { 283 | b.insert(k.clone(), eval_expr(v, context.clone()).unwrap()); 284 | } 285 | Ok(Rc::new(UnsafeCell::new(Value::Object(b)))) 286 | } 287 | Expr::Closure(a, _b, c) => { 288 | let ct = Rc::new(UnsafeCell::new(EvalContext::new_eval_sup_scope( 289 | context.clone(), 290 | ))); 291 | Ok(Rc::new(UnsafeCell::new(Value::Function( 292 | a.iter().map(|(s, _)| s.clone()).collect::>(), 293 | BTreeMap::new(), 294 | ct, 295 | *(c.clone()), 296 | )))) 297 | } 298 | Expr::If(a, b, c) => { 299 | let aaa = eval_expr(a, context.clone())?; 300 | let aaa = aaa.as_ref(); 301 | let aaa = unsafe { &mut *aaa.get() }; 302 | if let Value::Bool(bb) = aaa { 303 | if bb.clone() { 304 | eval_expr(b, context.clone()) 305 | } else { 306 | eval_expr(c, context.clone()) 307 | } 308 | } else { 309 | panic!("DID YOU USE TYPE CHECKER?!") 310 | } 311 | } 312 | Expr::MultiIf(_a, _b) => todo!(), 313 | Expr::For(_a, _b, _c) => { 314 | todo!(); 315 | Ok(Rc::new(UnsafeCell::new(Value::Null))) 316 | } 317 | Expr::Call(func, args) => { 318 | let f = eval_expr(func, context.clone())?; 319 | let f = f.as_ref(); 320 | let f = unsafe { &mut *f.get() }; 321 | unsafe { call_func_with_expr(f.clone(), args.clone(), context) } 322 | } 323 | Expr::ErrorHandle(e) => match eval_expr(e.borrow(), context) { 324 | Ok(e) => { 325 | if let Value::Error(_) = unsafe { &*e.as_ref().get() } { 326 | Ok(Rc::new(UnsafeCell::new(Value::Null))) 327 | } else { 328 | Ok(e) 329 | } 330 | } 331 | Err(_) => Ok(Rc::new(UnsafeCell::new(Value::Null))), 332 | }, 333 | // TODO: FUCK ME 334 | Expr::Bind(a, b) => { 335 | let aaa = eval_expr(a, context.clone())?; 336 | let _raaa = aaa.as_ref(); 337 | let raaa = unsafe { &mut *aaa.get() }; 338 | 339 | let bbb = eval_expr(b, context.clone())?; 340 | let _rbbb = bbb.as_ref(); 341 | let rbbb = unsafe { &mut *bbb.get() }; 342 | match rbbb { 343 | Value::Function(a1, _hs, _ct, _e) => match raaa.clone() { 344 | Value::Function(a2, _bb, _cct, _ee) => { 345 | let new_ctx = 346 | Rc::new(UnsafeCell::new(EvalContext::new_eval_sup_scope(context))); 347 | unsafe { 348 | { &mut *new_ctx.as_ref().get() } 349 | .eval_current_scope_variables 350 | .insert("@f".to_owned(), aaa); 351 | { &mut *new_ctx.as_ref().get() } 352 | .eval_current_scope_variables 353 | .insert("@g".to_owned(), bbb); 354 | let mut expr = CommentedExpr::from_expr(Expr::Call( 355 | Box::new(CommentedExpr::from_expr(Expr::Closure( 356 | a2.iter().map(|x| (x.clone(), None)).collect::>(), 357 | None, 358 | Box::new(CommentedExpr::from_expr(Expr::Closure( 359 | a1.iter().map(|x| (x.clone(), None)).collect::>(), 360 | None, 361 | Box::new(CommentedExpr::from_expr(Expr::Call( 362 | Box::new(CommentedExpr::from_expr(Expr::Ident(vec![ 363 | "@g".to_owned(), 364 | ]))), 365 | { 366 | let mut v = 367 | vec![CommentedExpr::from_expr(Expr::Call( 368 | Box::new(CommentedExpr::from_expr( 369 | Expr::Ident(vec!["@f".to_owned()]), 370 | )), 371 | a2.iter() 372 | .map(|x| { 373 | CommentedExpr::from_expr( 374 | Expr::Ident(vec![x.to_owned()]), 375 | ) 376 | }) 377 | .collect::>(), 378 | ))]; 379 | v.append( 380 | &mut a1[1..] 381 | .iter() 382 | .map(|x| { 383 | CommentedExpr::from_expr(Expr::Ident( 384 | vec![x.to_owned()], 385 | )) 386 | }) 387 | .collect::>(), 388 | ); 389 | v 390 | }, 391 | ))), 392 | ))), 393 | ))), 394 | vec![CommentedExpr::from_expr(Expr::Literal(Literal::Null))], 395 | )); 396 | eval_expr(&mut expr, new_ctx) 397 | } 398 | } 399 | _nonf => eval_expr( 400 | &mut CommentedExpr::from_expr(Expr::Call(b.clone(), vec![*a.clone()])), 401 | context, 402 | ), 403 | }, 404 | _ => Err("not bindable"), 405 | } 406 | } 407 | // TODO: elab index 408 | Expr::Index(a, b) => { 409 | let aaa = eval_expr(a, context.clone())?; 410 | let aaa = aaa.as_ref(); 411 | let aaa = unsafe { &mut *aaa.get() }; 412 | 413 | let bbb = eval_expr(b, context.clone())?; 414 | let bbb = bbb.as_ref(); 415 | let bbb = unsafe { &mut *bbb.get() }; 416 | if let Value::Array(a) = aaa { 417 | if let Value::Number(n) = bbb { 418 | let n = match n { 419 | Number::Integer(i) => *i as usize, 420 | Number::Floating(f) => (*f).floor() as usize, 421 | }; 422 | match a.get(n) { 423 | Some(v) => Ok(v.clone()), 424 | None => { 425 | for _ in a.len()..=n { 426 | a.push(Rc::new(UnsafeCell::new(Value::Null))) 427 | } 428 | Ok(a[n].clone()) 429 | } 430 | } 431 | } else { 432 | panic!("TYPE CHECKER?!") 433 | } 434 | } else if let Value::Pair(s, o) = aaa { 435 | if let Value::Number(n) = bbb { 436 | match n { 437 | Number::Integer(n) => { 438 | if *n == 0 { 439 | Ok(Rc::new(UnsafeCell::new(Value::String(s.clone())))) 440 | } else if *n == 1 { 441 | Ok(o.clone()) 442 | } else { 443 | Err("Index only 0,1 allowed to index pair") 444 | } 445 | } 446 | Number::Floating(n) => { 447 | if *n == 0.0 { 448 | Ok(Rc::new(UnsafeCell::new(Value::String(s.clone())))) 449 | } else if *n == 1.0 { 450 | Ok(o.clone()) 451 | } else { 452 | Err("Index only 0,1 allowed to index pair") 453 | } 454 | } 455 | } 456 | } else { 457 | Err("only could index pair with number") 458 | } 459 | } else if let Value::Object(o) = aaa { 460 | if let Value::String(s) = bbb { 461 | match o.get(s) { 462 | Some(v) => Ok(v.clone()), 463 | None => { 464 | let v = Rc::new(UnsafeCell::new(Value::Null)); 465 | o.insert(s.clone(), v.clone()); 466 | Ok(v) 467 | } 468 | } 469 | } else { 470 | panic!("TYPE CHECKER!!!!!!") 471 | } 472 | } else { 473 | panic!("TYPE...") 474 | } 475 | } 476 | Expr::Assign(a, b) => { 477 | let aaa = match eval_expr(a, context.clone()) { 478 | Ok(aaa) => { 479 | let bbb = eval_expr(b, context.clone())?; 480 | *unsafe { &mut *aaa.get() } = unsafe { &mut *bbb.get() }.clone(); 481 | Ok(bbb) 482 | } 483 | Err(_) => { 484 | let _bbb = eval_expr(b, context.clone())?; 485 | if let box CommentedExpr { 486 | comment: _, 487 | expr: Expr::Ident(aa), 488 | } = a 489 | { 490 | if aa.len() > 1 { 491 | unimplemented!() 492 | } else { 493 | /* 494 | a = ; 495 | --- 496 | _b = (a); 497 | a = _b(_b); 498 | */ 499 | let name = aa.last().unwrap().clone(); 500 | let clos = Value::Function( 501 | vec![name.clone()], 502 | BTreeMap::new(), 503 | context.clone(), 504 | *b.clone(), 505 | ); 506 | unsafe { &mut *context.as_ref().get() } 507 | .eval_current_scope_variables 508 | .insert(name.clone(), Rc::new(UnsafeCell::new(clos.clone()))); 509 | let call_res = unsafe { 510 | call_func_with_expr( 511 | clos, 512 | vec![CommentedExpr::from_expr(Expr::Ident(vec![name.clone()]))], 513 | context.clone(), 514 | ) 515 | }?; 516 | let call_res = 517 | Rc::new(UnsafeCell::new(unsafe { &*call_res.get() }.clone())); 518 | unsafe { &mut *context.as_ref().get() } 519 | .eval_current_scope_variables 520 | .insert(name.clone(), call_res.clone()); 521 | Ok(call_res) 522 | } 523 | } else { 524 | panic!("FUCK ME") 525 | } 526 | } 527 | }; 528 | aaa 529 | } 530 | Expr::SpecifyTyped(ex, _ty) => eval_expr(ex.borrow(), context), 531 | } 532 | } 533 | -------------------------------------------------------------------------------- /src/state/evaluator/value.rs: -------------------------------------------------------------------------------- 1 | use std::{cell::UnsafeCell, collections::BTreeMap, rc::Rc}; 2 | 3 | use crate::parser::expr::{literal::Number, CommentedExpr}; 4 | 5 | use super::EvalContext; 6 | 7 | pub enum Value { 8 | Pair(String, Rc>), 9 | Number(Number), 10 | String(String), 11 | Bool(bool), 12 | // entrys, current call status, eval context, expr 13 | Function( 14 | Vec, 15 | BTreeMap>>, 16 | Rc>, 17 | CommentedExpr, 18 | ), 19 | NativeFunction( 20 | String, 21 | Vec, 22 | BTreeMap>>, 23 | unsafe extern "C" fn(usize, va: *mut *mut Value) -> UnsafeCell, 24 | ), 25 | Array(Vec>>), 26 | Object(BTreeMap>>), 27 | Enum(BTreeMap), 28 | /// could not return a null without specify the type 29 | Null, 30 | /// same as null 31 | Error(String), 32 | } 33 | 34 | impl Clone for Value { 35 | fn clone(&self) -> Self { 36 | match self { 37 | Self::Pair(arg0, arg1) => Self::Pair( 38 | arg0.clone(), 39 | Rc::new(UnsafeCell::new(unsafe { &*arg1.get() }.clone())), 40 | ), 41 | Self::Number(arg0) => Self::Number(arg0.clone()), 42 | Self::String(arg0) => Self::String(arg0.clone()), 43 | Self::Bool(arg0) => Self::Bool(arg0.clone()), 44 | Self::Function(arg0, arg1, arg2, arg3) => { 45 | Self::Function(arg0.clone(), arg1.clone(), arg2.clone(), arg3.clone()) 46 | } 47 | Self::NativeFunction(arg0, arg1, arg2, arg3) => { 48 | Self::NativeFunction(arg0.clone(), arg1.clone(), arg2.clone(), arg3.clone()) 49 | } 50 | Self::Array(arg0) => Self::Array( 51 | arg0.iter() 52 | .map(|arg1| Rc::new(UnsafeCell::new(unsafe { &*arg1.get() }.clone()))) 53 | .collect(), 54 | ), 55 | Self::Object(arg0) => Self::Object( 56 | arg0.iter() 57 | .map(|(arg0, arg1)| { 58 | ( 59 | arg0.clone(), 60 | Rc::new(UnsafeCell::new(unsafe { &*arg1.get() }.clone())), 61 | ) 62 | }) 63 | .collect(), 64 | ), 65 | Self::Enum(arg0) => Self::Enum(arg0.clone()), 66 | Self::Null => Self::Null, 67 | Self::Error(arg0) => Self::Error(arg0.clone()), 68 | } 69 | } 70 | } 71 | impl std::fmt::Debug for Value { 72 | fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { 73 | match self { 74 | Self::Pair(s, o) => f 75 | .debug_tuple("Pair") 76 | .field(s) 77 | .field(unsafe { &*o.as_ref().get() }) 78 | .finish(), 79 | Self::Number(arg0) => f.debug_tuple("Number").field(arg0).finish(), 80 | Self::String(arg0) => f.debug_tuple("String").field(arg0).finish(), 81 | Self::Bool(arg0) => f.debug_tuple("Bool").field(arg0).finish(), 82 | Self::Function(arg0, arg1, _arg2, _arg3) => { 83 | f.debug_tuple("Function").field(arg0).field(arg1).finish() 84 | } 85 | Self::NativeFunction(arg0, arg1, arg2, arg3) => f 86 | .debug_tuple("NativeFunction") 87 | .field(arg0) 88 | .field(arg1) 89 | .field(arg2) 90 | .field(arg3) 91 | .finish(), 92 | Self::Array(arg0) => f 93 | .debug_tuple("Array") 94 | .field( 95 | &arg0 96 | .iter() 97 | .map(|t| unsafe { &*t.as_ref().get() }) 98 | .collect::>(), 99 | ) 100 | .finish(), 101 | Self::Object(arg0) => f 102 | .debug_tuple("Object") 103 | .field( 104 | &arg0 105 | .iter() 106 | .map(|(k, v)| (k, unsafe { &*v.as_ref().get() })) 107 | .collect::>(), 108 | ) 109 | .finish(), 110 | Self::Enum(arg0) => f.debug_tuple("Enum").field(arg0).finish(), 111 | Self::Null => write!(f, "Null"), 112 | Self::Error(arg0) => f.debug_tuple("Error").field(arg0).finish(), 113 | } 114 | } 115 | } 116 | -------------------------------------------------------------------------------- /src/state/mod.rs: -------------------------------------------------------------------------------- 1 | pub mod type_checker; 2 | use ::std::{cell::UnsafeCell, collections::BTreeMap, rc::Rc}; 3 | 4 | use crate::{ 5 | parser::{ 6 | expr::{CommentedExpr, Expr}, 7 | top_level::TopLevel, 8 | ty::Type, 9 | }, 10 | state::{evaluator::EvaledImports, type_checker::TypeCheckedImports}, 11 | }; 12 | 13 | use self::{ 14 | evaluator::{eval_toplevel, value::Value, EvalContext}, 15 | std::add_std, 16 | type_checker::{type_check_toplevel, TypeCheckContext}, 17 | }; 18 | 19 | pub mod evaluator; 20 | pub mod std; 21 | 22 | pub struct SapState { 23 | type_check_context: Rc>, 24 | eval_context: Rc>, 25 | } 26 | impl ::std::fmt::Debug for SapState { 27 | fn fmt(&self, f: &mut ::std::fmt::Formatter<'_>) -> ::std::fmt::Result { 28 | f.debug_struct("Runner") 29 | .field("type_check_context", unsafe { 30 | &*self.type_check_context.as_ref().get() 31 | }) 32 | .field("eval_context", unsafe { 33 | &*self.eval_context.as_ref().get() 34 | }) 35 | .finish() 36 | } 37 | } 38 | 39 | impl SapState { 40 | pub fn new() -> Self { 41 | let type_check_context = Rc::new(UnsafeCell::new(TypeCheckContext { 42 | type_check_parent_scope: None, 43 | type_check_current_scope_variables: BTreeMap::new(), 44 | type_check_current_scope_type_alias: BTreeMap::new(), 45 | imports: Rc::new(UnsafeCell::new(TypeCheckedImports { 46 | imports: BTreeMap::new(), 47 | })), 48 | current_scope_import_alias: BTreeMap::new(), 49 | })); 50 | let eval_context = Rc::new(UnsafeCell::new(EvalContext { 51 | imports: Rc::new(UnsafeCell::new(EvaledImports { 52 | imports: BTreeMap::new(), 53 | })), 54 | current_scope_import_alias: BTreeMap::new(), 55 | eval_parent_scope: None, 56 | eval_current_scope_variables: BTreeMap::new(), 57 | })); 58 | Self { 59 | type_check_context, 60 | eval_context, 61 | } 62 | } 63 | pub fn new_with_std() -> Self { 64 | let mut s = Self::new(); 65 | add_std(&mut s); 66 | s 67 | } 68 | pub fn add_and_wrap_native_function( 69 | &mut self, 70 | args_counts: usize, 71 | name: String, 72 | ptr: unsafe extern "C" fn(usize, va: *mut *mut Value) -> UnsafeCell, 73 | type_info: Option<(Vec, Box)>, 74 | ) { 75 | let argss = (0..args_counts) 76 | .collect::>() 77 | .iter() 78 | .map(|i| format!("_{:?}", i)) 79 | .collect::>(); 80 | let nname = format!("_{}", name.clone()); 81 | if let Some((a, b)) = type_info { 82 | unsafe { &mut *self.type_check_context.as_ref().get() } 83 | .type_check_current_scope_variables 84 | .insert(name.clone(), Type::Function(a, b)); 85 | } else { 86 | unsafe { &mut *self.type_check_context.as_ref().get() } 87 | .type_check_current_scope_variables 88 | .insert(name.clone(), Type::Any); 89 | } 90 | unsafe { &mut *self.eval_context.as_ref().get() } 91 | .eval_current_scope_variables 92 | .insert( 93 | nname.clone(), 94 | Rc::new(UnsafeCell::new(Value::NativeFunction( 95 | nname.clone(), 96 | argss.clone(), 97 | BTreeMap::new(), 98 | ptr, 99 | ))), 100 | ); 101 | unsafe { &mut *self.eval_context.as_ref().get() } 102 | .eval_current_scope_variables 103 | .insert( 104 | name.clone(), 105 | Rc::new(UnsafeCell::new(Value::Function( 106 | argss.clone(), 107 | BTreeMap::new(), 108 | self.eval_context.clone(), 109 | CommentedExpr::from_expr(Expr::Call( 110 | Box::new(CommentedExpr::from_expr(Expr::Ident(vec![nname]))), 111 | argss 112 | .iter() 113 | .map(|x| CommentedExpr::from_expr(Expr::Ident(vec![x.clone()]))) 114 | .collect(), 115 | )), 116 | ))), 117 | ); 118 | } 119 | pub fn type_check_and_run( 120 | &mut self, 121 | mut e: TopLevel, 122 | ) -> ( 123 | Result, &'static str>, 124 | Result>, &'static str>, 125 | ) { 126 | ( 127 | type_check_toplevel(&mut e, self.type_check_context.clone()), 128 | eval_toplevel(&mut e, self.eval_context.clone()), 129 | ) 130 | } 131 | } 132 | -------------------------------------------------------------------------------- /src/state/std/mod.rs: -------------------------------------------------------------------------------- 1 | mod numerical; 2 | 3 | use std::cell::UnsafeCell; 4 | use std::{ 5 | boxed::Box, 6 | collections::BTreeMap, 7 | format, 8 | rc::Rc, 9 | string::{String, ToString}, 10 | vec, 11 | vec::Vec, 12 | }; 13 | 14 | use crate::parser::{expr::literal::Number, ty::Type}; 15 | 16 | use self::numerical::add_std_numerical; 17 | 18 | use super::{evaluator::value::Value, SapState}; 19 | 20 | struct NativeFunction { 21 | name: String, 22 | args: Vec, 23 | filled_args: BTreeMap>>, 24 | ptr: extern "C" fn(usize, va: *mut *mut Value) -> UnsafeCell, 25 | } 26 | 27 | impl NativeFunction { 28 | fn into_value(&self) -> Rc> { 29 | Rc::new(UnsafeCell::new(Value::NativeFunction( 30 | self.name.clone(), 31 | self.args.clone(), 32 | self.filled_args.clone(), 33 | self.ptr.clone(), 34 | ))) 35 | } 36 | } 37 | unsafe extern "C" fn err(args_count: usize, va: *mut *mut Value) -> UnsafeCell { 38 | let mut vec = Vec::from_raw_parts(va, args_count, 2); 39 | let v1 = &mut *vec[0]; 40 | if let Value::String(s) = v1 { 41 | UnsafeCell::new(Value::Error(s.clone())) 42 | } else { 43 | panic!("YOU DOESN'T EVEN KNOW HOW TO USE ERR WITH A SIMPLE STRING OR WHAT?") 44 | } 45 | } 46 | unsafe extern "C" fn id(args_count: usize, va: *mut *mut Value) -> UnsafeCell { 47 | let mut vec = Vec::from_raw_parts(va, args_count, 2); 48 | let v1 = &mut *vec[0]; 49 | UnsafeCell::new(v1.clone()) 50 | } 51 | 52 | unsafe extern "C" fn range(args_count: usize, va: *mut *mut Value) -> UnsafeCell { 53 | let mut vec = Vec::from_raw_parts(va, args_count, 2); 54 | let v1 = &mut *vec[0]; 55 | let v2 = &mut *vec[1]; 56 | if let Value::Number(n1) = v1 { 57 | if let Value::Number(n2) = v2 { 58 | match n1 { 59 | crate::parser::expr::literal::Number::Integer(i1) => match n2 { 60 | crate::parser::expr::literal::Number::Integer(i2) => { 61 | let mut v = vec![]; 62 | for i in *i1..*i2 { 63 | v.push(Rc::new(UnsafeCell::new(Value::Number(Number::Integer(i))))) 64 | } 65 | UnsafeCell::new(Value::Array(v)) 66 | } 67 | crate::parser::expr::literal::Number::Floating(f2) => { 68 | let mut v = vec![]; 69 | for i in *i1..(f2.floor() as i128) { 70 | v.push(Rc::new(UnsafeCell::new(Value::Number(Number::Integer(i))))) 71 | } 72 | UnsafeCell::new(Value::Array(v)) 73 | } 74 | }, 75 | crate::parser::expr::literal::Number::Floating(f1) => match n2 { 76 | crate::parser::expr::literal::Number::Floating(f2) => { 77 | let mut v = vec![]; 78 | for i in f1.floor() as i128..f2.floor() as i128 { 79 | v.push(Rc::new(UnsafeCell::new(Value::Number(Number::Integer(i))))) 80 | } 81 | UnsafeCell::new(Value::Array(v)) 82 | } 83 | crate::parser::expr::literal::Number::Integer(i3) => { 84 | let mut v = vec![]; 85 | for i in f1.floor() as i128..*i3 { 86 | v.push(Rc::new(UnsafeCell::new(Value::Number(Number::Integer(i))))) 87 | } 88 | UnsafeCell::new(Value::Array(v)) 89 | } 90 | }, 91 | } 92 | } else { 93 | UnsafeCell::new(Value::Error(format!( 94 | "TYPE MISMACHED IN RUNTIME with {:?}", 95 | v2 96 | ))) 97 | } 98 | } else { 99 | UnsafeCell::new(Value::Error(format!( 100 | "TYPE MISMACHED IN RUNTIME with {:?}", 101 | v1 102 | ))) 103 | } 104 | } 105 | 106 | unsafe extern "C" fn cons(args_count: usize, va: *mut *mut Value) -> UnsafeCell { 107 | let mut vec = Vec::from_raw_parts(va, args_count, 2); 108 | let v1 = &mut *vec[1]; 109 | let v2 = &mut *vec[0]; 110 | match v1 { 111 | Value::Array(a) => match v2 { 112 | Value::Array(b) => UnsafeCell::new(Value::Array({ 113 | let mut r = a.clone(); 114 | r.append(&mut b.clone()); 115 | r 116 | })), 117 | _ => panic!("FUCK RUNTIME"), 118 | }, 119 | v => { 120 | let v = Rc::new(UnsafeCell::new(v.clone())); 121 | let a = vec![v]; 122 | match v2 { 123 | Value::Array(b) => UnsafeCell::new(Value::Array({ 124 | let mut r = a.clone(); 125 | r.append(&mut b.clone()); 126 | r 127 | })), 128 | _ => panic!("FUCK RUNTIME"), 129 | } 130 | } 131 | } 132 | } 133 | 134 | unsafe extern "C" fn uncons(args_count: usize, va: *mut *mut Value) -> UnsafeCell { 135 | let mut vec = Vec::from_raw_parts(va, args_count, 2); 136 | let v1 = &mut *vec[0]; 137 | match v1 { 138 | Value::Array(a) => UnsafeCell::new(Value::Array(vec![ 139 | Rc::new(UnsafeCell::new(unsafe { &*a[0].get() }.clone())), 140 | Rc::new(UnsafeCell::new(Value::Array( 141 | a[1..] 142 | .iter() 143 | .map(|x| Rc::new(UnsafeCell::new(unsafe { &*x.get() }.clone()))) 144 | .collect::>(), 145 | ))), 146 | ])), 147 | Value::Object(_) => todo!(), 148 | _ => todo!(), 149 | } 150 | } 151 | 152 | unsafe extern "C" fn is_empty(args_count: usize, va: *mut *mut Value) -> UnsafeCell { 153 | let mut vec = Vec::from_raw_parts(va, args_count, 2); 154 | let v1 = &mut *vec[0]; 155 | match v1 { 156 | Value::Array(a) => UnsafeCell::new(Value::Bool(a.is_empty())), 157 | Value::Object(_) => todo!(), 158 | _ => todo!(), 159 | } 160 | } 161 | 162 | pub fn add_std(r: &mut SapState) { 163 | //numerical 164 | add_std_numerical(r); 165 | r.add_and_wrap_native_function( 166 | 2, 167 | "range".to_string(), 168 | range, 169 | Some((vec![Type::Number, Type::Number], Box::new(Type::Array))), 170 | ); 171 | r.add_and_wrap_native_function( 172 | 2, 173 | "cons".to_string(), 174 | cons, 175 | Some((vec![Type::Any, Type::Array], Box::new(Type::Array))), 176 | ); 177 | r.add_and_wrap_native_function( 178 | 1, 179 | "uncons".to_string(), 180 | uncons, 181 | Some((vec![Type::Any], Box::new(Type::Array))), 182 | ); 183 | r.add_and_wrap_native_function( 184 | 1, 185 | "is_empty".to_string(), 186 | is_empty, 187 | Some((vec![Type::Any], Box::new(Type::Bool))), 188 | ); 189 | r.add_and_wrap_native_function( 190 | 1, 191 | "id".to_string(), 192 | id, 193 | Some((vec![Type::Any], Box::new(Type::Any))), 194 | ); 195 | } 196 | -------------------------------------------------------------------------------- /src/state/std/numerical.rs: -------------------------------------------------------------------------------- 1 | use std::{cell::UnsafeCell, ops::*}; 2 | 3 | use std::{boxed::Box, format, string::ToString, vec, vec::Vec}; 4 | 5 | use crate::{ 6 | parser::{expr::literal::Number, ty::Type}, 7 | state::{evaluator::value::Value, SapState}, 8 | }; 9 | 10 | unsafe extern "C" fn lt(args_count: usize, va: *mut *mut Value) -> UnsafeCell { 11 | let mut vec = Vec::from_raw_parts(va, args_count, 2); 12 | let v1 = &mut *vec[1]; 13 | let v2 = &mut *vec[0]; 14 | if let Value::Number(n1) = v1 { 15 | if let Value::Number(n2) = v2 { 16 | match n1 { 17 | crate::parser::expr::literal::Number::Integer(i1) => match n2 { 18 | crate::parser::expr::literal::Number::Integer(i2) => { 19 | UnsafeCell::new(Value::Bool((*i1).lt(i2))) 20 | } 21 | crate::parser::expr::literal::Number::Floating(f2) => { 22 | UnsafeCell::new(Value::Bool((*i1 as f64).lt(f2))) 23 | } 24 | }, 25 | crate::parser::expr::literal::Number::Floating(i2) => match n2 { 26 | crate::parser::expr::literal::Number::Floating(f2) => { 27 | UnsafeCell::new(Value::Bool((*i2).lt(f2))) 28 | } 29 | crate::parser::expr::literal::Number::Integer(i3) => { 30 | UnsafeCell::new(Value::Bool((*i2).lt(&(*i3 as f64)))) 31 | } 32 | }, 33 | } 34 | } else { 35 | UnsafeCell::new(Value::Error(format!( 36 | "TYPE MISMACHED IN RUNTIME with {:?}", 37 | v2 38 | ))) 39 | } 40 | } else { 41 | UnsafeCell::new(Value::Error(format!( 42 | "TYPE MISMACHED IN RUNTIME with {:?}", 43 | v1 44 | ))) 45 | } 46 | } 47 | 48 | unsafe extern "C" fn gt(args_count: usize, va: *mut *mut Value) -> UnsafeCell { 49 | let mut vec = Vec::from_raw_parts(va, args_count, 2); 50 | let v1 = &mut *vec[1]; 51 | let v2 = &mut *vec[0]; 52 | if let Value::Number(n1) = v1 { 53 | if let Value::Number(n2) = v2 { 54 | match n1 { 55 | crate::parser::expr::literal::Number::Integer(i1) => match n2 { 56 | crate::parser::expr::literal::Number::Integer(i2) => { 57 | UnsafeCell::new(Value::Bool((*i1).gt(i2))) 58 | } 59 | crate::parser::expr::literal::Number::Floating(f2) => { 60 | UnsafeCell::new(Value::Bool((*i1 as f64).gt(f2))) 61 | } 62 | }, 63 | crate::parser::expr::literal::Number::Floating(i2) => match n2 { 64 | crate::parser::expr::literal::Number::Floating(f2) => { 65 | UnsafeCell::new(Value::Bool((*i2).gt(f2))) 66 | } 67 | crate::parser::expr::literal::Number::Integer(i3) => { 68 | UnsafeCell::new(Value::Bool((*i2).gt(&(*i3 as f64)))) 69 | } 70 | }, 71 | } 72 | } else { 73 | UnsafeCell::new(Value::Error(format!( 74 | "TYPE MISMACHED IN RUNTIME with {:?}", 75 | v2 76 | ))) 77 | } 78 | } else { 79 | UnsafeCell::new(Value::Error(format!( 80 | "TYPE MISMACHED IN RUNTIME with {:?}", 81 | v1 82 | ))) 83 | } 84 | } 85 | 86 | unsafe extern "C" fn le(args_count: usize, va: *mut *mut Value) -> UnsafeCell { 87 | let mut vec = Vec::from_raw_parts(va, args_count, 2); 88 | let v1 = &mut *vec[1]; 89 | let v2 = &mut *vec[0]; 90 | if let Value::Number(n1) = v1 { 91 | if let Value::Number(n2) = v2 { 92 | match n1 { 93 | crate::parser::expr::literal::Number::Integer(i1) => match n2 { 94 | crate::parser::expr::literal::Number::Integer(i2) => { 95 | UnsafeCell::new(Value::Bool((*i1).le(i2))) 96 | } 97 | crate::parser::expr::literal::Number::Floating(f2) => { 98 | UnsafeCell::new(Value::Bool((*i1 as f64).le(f2))) 99 | } 100 | }, 101 | crate::parser::expr::literal::Number::Floating(i2) => match n2 { 102 | crate::parser::expr::literal::Number::Floating(f2) => { 103 | UnsafeCell::new(Value::Bool((*i2).le(f2))) 104 | } 105 | crate::parser::expr::literal::Number::Integer(i3) => { 106 | UnsafeCell::new(Value::Bool((*i2).le(&(*i3 as f64)))) 107 | } 108 | }, 109 | } 110 | } else { 111 | UnsafeCell::new(Value::Error(format!( 112 | "TYPE MISMACHED IN RUNTIME with {:?}", 113 | v2 114 | ))) 115 | } 116 | } else { 117 | UnsafeCell::new(Value::Error(format!( 118 | "TYPE MISMACHED IN RUNTIME with {:?}", 119 | v1 120 | ))) 121 | } 122 | } 123 | 124 | unsafe extern "C" fn ge(args_count: usize, va: *mut *mut Value) -> UnsafeCell { 125 | let mut vec = Vec::from_raw_parts(va, args_count, 2); 126 | let v1 = &mut *vec[1]; 127 | let v2 = &mut *vec[0]; 128 | if let Value::Number(n1) = v1 { 129 | if let Value::Number(n2) = v2 { 130 | match n1 { 131 | crate::parser::expr::literal::Number::Integer(i1) => match n2 { 132 | crate::parser::expr::literal::Number::Integer(i2) => { 133 | UnsafeCell::new(Value::Bool((*i1).ge(i2))) 134 | } 135 | crate::parser::expr::literal::Number::Floating(f2) => { 136 | UnsafeCell::new(Value::Bool((*i1 as f64).ge(f2))) 137 | } 138 | }, 139 | crate::parser::expr::literal::Number::Floating(i2) => match n2 { 140 | crate::parser::expr::literal::Number::Floating(f2) => { 141 | UnsafeCell::new(Value::Bool((*i2).ge(f2))) 142 | } 143 | crate::parser::expr::literal::Number::Integer(i3) => { 144 | UnsafeCell::new(Value::Bool((*i2).ge(&(*i3 as f64)))) 145 | } 146 | }, 147 | } 148 | } else { 149 | UnsafeCell::new(Value::Error(format!( 150 | "TYPE MISMACHED IN RUNTIME with {:?}", 151 | v2 152 | ))) 153 | } 154 | } else { 155 | UnsafeCell::new(Value::Error(format!( 156 | "TYPE MISMACHED IN RUNTIME with {:?}", 157 | v1 158 | ))) 159 | } 160 | } 161 | 162 | unsafe extern "C" fn eq(args_count: usize, va: *mut *mut Value) -> UnsafeCell { 163 | let mut vec = Vec::from_raw_parts(va, args_count, 2); 164 | let v1 = &mut *vec[1]; 165 | let v2 = &mut *vec[0]; 166 | if let Value::Number(n1) = v1 { 167 | if let Value::Number(n2) = v2 { 168 | match n1 { 169 | crate::parser::expr::literal::Number::Integer(i1) => match n2 { 170 | crate::parser::expr::literal::Number::Integer(i2) => { 171 | UnsafeCell::new(Value::Bool((*i1).eq(i2))) 172 | } 173 | crate::parser::expr::literal::Number::Floating(f2) => { 174 | UnsafeCell::new(Value::Bool((*i1 as f64).eq(f2))) 175 | } 176 | }, 177 | crate::parser::expr::literal::Number::Floating(i2) => match n2 { 178 | crate::parser::expr::literal::Number::Floating(f2) => { 179 | UnsafeCell::new(Value::Bool((*i2).eq(f2))) 180 | } 181 | crate::parser::expr::literal::Number::Integer(i3) => { 182 | UnsafeCell::new(Value::Bool((*i2).eq(&(*i3 as f64)))) 183 | } 184 | }, 185 | } 186 | } else { 187 | UnsafeCell::new(Value::Error(format!( 188 | "TYPE MISMACHED IN RUNTIME with {:?}", 189 | v2 190 | ))) 191 | } 192 | } else { 193 | UnsafeCell::new(Value::Error(format!( 194 | "TYPE MISMACHED IN RUNTIME with {:?}", 195 | v1 196 | ))) 197 | } 198 | } 199 | 200 | unsafe extern "C" fn ne(args_count: usize, va: *mut *mut Value) -> UnsafeCell { 201 | let mut vec = Vec::from_raw_parts(va, args_count, 2); 202 | let v1 = &mut *vec[1]; 203 | let v2 = &mut *vec[0]; 204 | if let Value::Number(n1) = v1 { 205 | if let Value::Number(n2) = v2 { 206 | match n1 { 207 | crate::parser::expr::literal::Number::Integer(i1) => match n2 { 208 | crate::parser::expr::literal::Number::Integer(i2) => { 209 | UnsafeCell::new(Value::Bool((*i1).ne(i2))) 210 | } 211 | crate::parser::expr::literal::Number::Floating(f2) => { 212 | UnsafeCell::new(Value::Bool((*i1 as f64).ne(f2))) 213 | } 214 | }, 215 | crate::parser::expr::literal::Number::Floating(i2) => match n2 { 216 | crate::parser::expr::literal::Number::Floating(f2) => { 217 | UnsafeCell::new(Value::Bool((*i2).ne(f2))) 218 | } 219 | crate::parser::expr::literal::Number::Integer(i3) => { 220 | UnsafeCell::new(Value::Bool((*i2).ne(&(*i3 as f64)))) 221 | } 222 | }, 223 | } 224 | } else { 225 | UnsafeCell::new(Value::Error(format!( 226 | "TYPE MISMACHED IN RUNTIME with {:?}", 227 | v2 228 | ))) 229 | } 230 | } else { 231 | UnsafeCell::new(Value::Error(format!( 232 | "TYPE MISMACHED IN RUNTIME with {:?}", 233 | v1 234 | ))) 235 | } 236 | } 237 | 238 | unsafe extern "C" fn add(args_count: usize, va: *mut *mut Value) -> UnsafeCell { 239 | let mut vec = Vec::from_raw_parts(va, args_count, 2); 240 | let v1 = &mut *vec[1]; 241 | let v2 = &mut *vec[0]; 242 | if let Value::Number(n1) = v1 { 243 | if let Value::Number(n2) = v2 { 244 | match n1 { 245 | crate::parser::expr::literal::Number::Integer(i1) => match n2 { 246 | crate::parser::expr::literal::Number::Integer(i2) => { 247 | UnsafeCell::new(Value::Number(Number::Integer((*i1).add(*i2)))) 248 | } 249 | crate::parser::expr::literal::Number::Floating(f2) => { 250 | UnsafeCell::new(Value::Number(Number::Floating((*i1 as f64).add(*f2)))) 251 | } 252 | }, 253 | crate::parser::expr::literal::Number::Floating(f1) => match n2 { 254 | crate::parser::expr::literal::Number::Floating(f2) => { 255 | UnsafeCell::new(Value::Number(Number::Floating((*f1).add(*f2)))) 256 | } 257 | crate::parser::expr::literal::Number::Integer(i3) => { 258 | UnsafeCell::new(Value::Number(Number::Floating((*f1).add(*i3 as f64)))) 259 | } 260 | }, 261 | } 262 | } else { 263 | UnsafeCell::new(Value::Error(format!( 264 | "TYPE MISMACHED IN RUNTIME with {:?}", 265 | v2 266 | ))) 267 | } 268 | } else { 269 | UnsafeCell::new(Value::Error(format!( 270 | "TYPE MISMACHED IN RUNTIME with {:?}", 271 | v1 272 | ))) 273 | } 274 | } 275 | 276 | unsafe extern "C" fn sub(args_count: usize, va: *mut *mut Value) -> UnsafeCell { 277 | let mut vec = Vec::from_raw_parts(va, args_count, 2); 278 | let v1 = &mut *vec[1]; 279 | let v2 = &mut *vec[0]; 280 | if let Value::Number(n1) = v1 { 281 | if let Value::Number(n2) = v2 { 282 | match n1 { 283 | crate::parser::expr::literal::Number::Integer(i1) => match n2 { 284 | crate::parser::expr::literal::Number::Integer(i2) => { 285 | UnsafeCell::new(Value::Number(Number::Integer((*i1).sub(*i2)))) 286 | } 287 | crate::parser::expr::literal::Number::Floating(f2) => { 288 | UnsafeCell::new(Value::Number(Number::Floating((*i1 as f64).sub(*f2)))) 289 | } 290 | }, 291 | crate::parser::expr::literal::Number::Floating(f1) => match n2 { 292 | crate::parser::expr::literal::Number::Floating(f2) => { 293 | UnsafeCell::new(Value::Number(Number::Floating((*f1).sub(*f2)))) 294 | } 295 | crate::parser::expr::literal::Number::Integer(i3) => { 296 | UnsafeCell::new(Value::Number(Number::Floating((*f1).sub(*i3 as f64)))) 297 | } 298 | }, 299 | } 300 | } else { 301 | UnsafeCell::new(Value::Error(format!( 302 | "TYPE MISMACHED IN RUNTIME with {:?}", 303 | v2 304 | ))) 305 | } 306 | } else { 307 | UnsafeCell::new(Value::Error(format!( 308 | "TYPE MISMACHED IN RUNTIME with {:?}", 309 | v1 310 | ))) 311 | } 312 | } 313 | 314 | unsafe extern "C" fn mul(args_count: usize, va: *mut *mut Value) -> UnsafeCell { 315 | let mut vec = Vec::from_raw_parts(va, args_count, 2); 316 | let v1 = &mut *vec[1]; 317 | let v2 = &mut *vec[0]; 318 | if let Value::Number(n1) = v1 { 319 | if let Value::Number(n2) = v2 { 320 | match n1 { 321 | crate::parser::expr::literal::Number::Integer(i1) => match n2 { 322 | crate::parser::expr::literal::Number::Integer(i2) => { 323 | UnsafeCell::new(Value::Number(Number::Integer((*i1).mul(*i2)))) 324 | } 325 | crate::parser::expr::literal::Number::Floating(f2) => { 326 | UnsafeCell::new(Value::Number(Number::Floating((*i1 as f64).mul(*f2)))) 327 | } 328 | }, 329 | crate::parser::expr::literal::Number::Floating(f1) => match n2 { 330 | crate::parser::expr::literal::Number::Floating(f2) => { 331 | UnsafeCell::new(Value::Number(Number::Floating((*f1).mul(*f2)))) 332 | } 333 | crate::parser::expr::literal::Number::Integer(i3) => { 334 | UnsafeCell::new(Value::Number(Number::Floating((*f1).mul(*i3 as f64)))) 335 | } 336 | }, 337 | } 338 | } else { 339 | UnsafeCell::new(Value::Error(format!( 340 | "TYPE MISMACHED IN RUNTIME with {:?}", 341 | v2 342 | ))) 343 | } 344 | } else { 345 | UnsafeCell::new(Value::Error(format!( 346 | "TYPE MISMACHED IN RUNTIME with {:?}", 347 | v1 348 | ))) 349 | } 350 | } 351 | 352 | unsafe extern "C" fn div(args_count: usize, va: *mut *mut Value) -> UnsafeCell { 353 | let mut vec = Vec::from_raw_parts(va, args_count, 2); 354 | let v1 = &mut *vec[1]; 355 | let v2 = &mut *vec[0]; 356 | if let Value::Number(n1) = v1 { 357 | if let Value::Number(n2) = v2 { 358 | match n1 { 359 | crate::parser::expr::literal::Number::Integer(i1) => match n2 { 360 | crate::parser::expr::literal::Number::Integer(i2) => { 361 | UnsafeCell::new(Value::Number(Number::Integer((*i1).div(*i2)))) 362 | } 363 | crate::parser::expr::literal::Number::Floating(f2) => { 364 | UnsafeCell::new(Value::Number(Number::Floating((*i1 as f64).div(*f2)))) 365 | } 366 | }, 367 | crate::parser::expr::literal::Number::Floating(f1) => match n2 { 368 | crate::parser::expr::literal::Number::Floating(f2) => { 369 | UnsafeCell::new(Value::Number(Number::Floating((*f1).div(*f2)))) 370 | } 371 | crate::parser::expr::literal::Number::Integer(i3) => { 372 | UnsafeCell::new(Value::Number(Number::Floating((*f1).div(*i3 as f64)))) 373 | } 374 | }, 375 | } 376 | } else { 377 | UnsafeCell::new(Value::Error(format!( 378 | "TYPE MISMACHED IN RUNTIME with {:?}", 379 | v2 380 | ))) 381 | } 382 | } else { 383 | UnsafeCell::new(Value::Error(format!( 384 | "TYPE MISMACHED IN RUNTIME with {:?}", 385 | v1 386 | ))) 387 | } 388 | } 389 | 390 | unsafe extern "C" fn rem(args_count: usize, va: *mut *mut Value) -> UnsafeCell { 391 | let mut vec = Vec::from_raw_parts(va, args_count, 2); 392 | let v1 = &mut *vec[1]; 393 | let v2 = &mut *vec[0]; 394 | if let Value::Number(n1) = v1 { 395 | if let Value::Number(n2) = v2 { 396 | match n1 { 397 | crate::parser::expr::literal::Number::Integer(i1) => match n2 { 398 | crate::parser::expr::literal::Number::Integer(i2) => { 399 | UnsafeCell::new(Value::Number(Number::Integer((*i1).rem(*i2)))) 400 | } 401 | crate::parser::expr::literal::Number::Floating(f2) => { 402 | UnsafeCell::new(Value::Number(Number::Floating((*i1 as f64).rem(*f2)))) 403 | } 404 | }, 405 | crate::parser::expr::literal::Number::Floating(f1) => match n2 { 406 | crate::parser::expr::literal::Number::Floating(f2) => { 407 | UnsafeCell::new(Value::Number(Number::Floating((*f1).rem(*f2)))) 408 | } 409 | crate::parser::expr::literal::Number::Integer(i3) => { 410 | UnsafeCell::new(Value::Number(Number::Floating((*f1).rem(*i3 as f64)))) 411 | } 412 | }, 413 | } 414 | } else { 415 | UnsafeCell::new(Value::Error(format!( 416 | "TYPE MISMACHED IN RUNTIME with {:?}", 417 | v2 418 | ))) 419 | } 420 | } else { 421 | UnsafeCell::new(Value::Error(format!( 422 | "TYPE MISMACHED IN RUNTIME with {:?}", 423 | v1 424 | ))) 425 | } 426 | } 427 | 428 | pub(crate) fn add_std_numerical(r: &mut SapState) { 429 | r.add_and_wrap_native_function( 430 | 2, 431 | "lt".to_string(), 432 | lt, 433 | Some((vec![Type::Number, Type::Number], Box::new(Type::Bool))), 434 | ); 435 | r.add_and_wrap_native_function( 436 | 2, 437 | "gt".to_string(), 438 | gt, 439 | Some((vec![Type::Number, Type::Number], Box::new(Type::Bool))), 440 | ); 441 | r.add_and_wrap_native_function( 442 | 2, 443 | "le".to_string(), 444 | le, 445 | Some((vec![Type::Number, Type::Number], Box::new(Type::Bool))), 446 | ); 447 | r.add_and_wrap_native_function( 448 | 2, 449 | "ge".to_string(), 450 | ge, 451 | Some((vec![Type::Number, Type::Number], Box::new(Type::Bool))), 452 | ); 453 | r.add_and_wrap_native_function( 454 | 2, 455 | "eq".to_string(), 456 | eq, 457 | Some((vec![Type::Number, Type::Number], Box::new(Type::Bool))), 458 | ); 459 | r.add_and_wrap_native_function( 460 | 2, 461 | "ne".to_string(), 462 | ne, 463 | Some((vec![Type::Number, Type::Number], Box::new(Type::Bool))), 464 | ); 465 | r.add_and_wrap_native_function( 466 | 2, 467 | "add".to_string(), 468 | add, 469 | Some((vec![Type::Number, Type::Number], Box::new(Type::Number))), 470 | ); 471 | r.add_and_wrap_native_function( 472 | 2, 473 | "sub".to_string(), 474 | sub, 475 | Some((vec![Type::Number, Type::Number], Box::new(Type::Number))), 476 | ); 477 | r.add_and_wrap_native_function( 478 | 2, 479 | "mul".to_string(), 480 | mul, 481 | Some((vec![Type::Number, Type::Number], Box::new(Type::Number))), 482 | ); 483 | r.add_and_wrap_native_function( 484 | 2, 485 | "div".to_string(), 486 | div, 487 | Some((vec![Type::Number, Type::Number], Box::new(Type::Number))), 488 | ); 489 | r.add_and_wrap_native_function( 490 | 2, 491 | "rem".to_string(), 492 | rem, 493 | Some((vec![Type::Number, Type::Number], Box::new(Type::Number))), 494 | ); 495 | } 496 | -------------------------------------------------------------------------------- /src/state/std/serde.rs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sap-lang/sap-lang-archived/883d760b33e3329dca4947f0858add564ae196a5/src/state/std/serde.rs -------------------------------------------------------------------------------- /src/state/type_checker/elab.rs: -------------------------------------------------------------------------------- 1 | use std::cell::UnsafeCell; 2 | 3 | use std::{boxed::Box, collections::BTreeMap, rc::Rc, vec}; 4 | 5 | use crate::parser::ty::Type; 6 | 7 | use super::TypeCheckContext; 8 | 9 | pub fn type_elab( 10 | context: Rc>, 11 | a: Type, 12 | b: Type, 13 | ) -> Result { 14 | match (a.clone(), b.clone()) { 15 | (Type::Any, _) => Ok(b), 16 | (_, Type::Any) => Ok(a), 17 | (_, Type::Alias(alias)) => match unsafe { &mut *context.get() }.get_type_alias(&alias) { 18 | Some(bb) => { 19 | type_elab(context, a, bb)?; 20 | Ok(b) 21 | } 22 | None => Err("type mismatch"), 23 | }, 24 | (Type::Alias(alias), b) => match unsafe { &mut *context.get() }.get_type_alias(&alias) { 25 | Some(aa) => { 26 | type_elab(context, aa, b)?; 27 | Ok(a) 28 | } 29 | None => Err("type mismatch"), 30 | }, 31 | // number 32 | (Type::Number, Type::Number) => Ok(a), 33 | 34 | // string 35 | (Type::String, Type::String) => Ok(a), 36 | 37 | // bool 38 | (Type::Bool, Type::Bool) => Ok(a), 39 | 40 | // function 41 | (Type::Function(args1, ret1), Type::Function(args2, ret2)) => { 42 | match args1.len().cmp(&args2.len()) { 43 | std::cmp::Ordering::Equal => { 44 | let mut args = vec![]; 45 | for i in 0..args1.len() { 46 | args.push(type_elab( 47 | context.clone(), 48 | args1[i].clone(), 49 | args2[i].clone(), 50 | )?); 51 | } 52 | let r = type_elab(context, *ret1, *ret2)?; 53 | Ok(Type::Function(args, Box::new(r))) 54 | } 55 | _ => { 56 | return Err("type mismatch"); 57 | } 58 | } 59 | } 60 | // array 61 | (Type::Array, Type::Array) => Ok(a), 62 | // object 63 | (Type::Object(ass), Type::Object(bss)) => { 64 | let mut m = BTreeMap::new(); 65 | for (k, v) in ass { 66 | m.insert(k.clone(), v.clone()); 67 | } 68 | for (k, v) in bss { 69 | if m.contains_key(&k) { 70 | return type_elab(context, m.get_mut(&k).unwrap().clone(), v); 71 | } else { 72 | m.insert(k.clone(), v.clone()); 73 | } 74 | } 75 | Ok(Type::Object(m)) 76 | } 77 | // enum 78 | (Type::Enum(aa), Type::Enum(b)) => { 79 | for t in b { 80 | if aa 81 | .iter() 82 | .position(|x| type_elab(context.clone(), x.clone(), t.clone()).is_ok()) 83 | .is_some() 84 | { 85 | } else { 86 | return Err("type mismatch"); 87 | } 88 | } 89 | Ok(a) 90 | } 91 | (Type::Enum(us), t) => { 92 | if us 93 | .iter() 94 | .position(|x| type_elab(context.clone(), x.clone(), t.clone()).is_ok()) 95 | .is_some() 96 | { 97 | Ok(a) 98 | } else { 99 | Err("type mismatch") 100 | } 101 | } 102 | (_a, _b) => { 103 | // todo!("what happend with {:?} {:?}", a, b) 104 | Ok(Type::Any) 105 | } 106 | } 107 | } 108 | -------------------------------------------------------------------------------- /src/state/type_checker/mod.rs: -------------------------------------------------------------------------------- 1 | mod elab; 2 | 3 | use std::cell::UnsafeCell; 4 | 5 | use std::{boxed::Box, collections::BTreeMap, rc::Rc, string::String, vec, vec::Vec}; 6 | 7 | use crate::parser::top_level::TopLevel; 8 | use crate::{ 9 | parser::{ 10 | expr::{CommentedExpr, Expr}, 11 | ty::Type, 12 | }, 13 | state::type_checker::elab::type_elab, 14 | }; 15 | 16 | pub struct TypeCheckedImports { 17 | pub imports: BTreeMap>>, 18 | } 19 | 20 | #[derive(Debug, Clone)] 21 | pub struct TypeCheckContext { 22 | pub imports: Rc>, 23 | pub current_scope_import_alias: BTreeMap, 24 | pub(crate) type_check_parent_scope: Option>>, 25 | pub(crate) type_check_current_scope_variables: BTreeMap, 26 | pub(crate) type_check_current_scope_type_alias: BTreeMap, 27 | } 28 | 29 | fn get_var_from_imports(context: Rc>, s: &[String]) -> Option { 30 | let c = unsafe { &*context.get() }; 31 | match c.current_scope_import_alias.get(&s[0]) { 32 | Some(source) => unsafe { &*unsafe { &*c.imports.get() }.imports[&s[0]].get() } 33 | .get_variable_type_by_name(&s[1..]), 34 | None => get_var_from_imports(c.type_check_parent_scope.as_ref()?.clone(), s), 35 | } 36 | } 37 | fn get_alias_from_imports(context: Rc>, s: &[String]) -> Option { 38 | let c = unsafe { &*context.get() }; 39 | match c.current_scope_import_alias.get(&s[0]) { 40 | Some(source) => unsafe { &*unsafe { &*c.imports.get() }.imports[&s[0]].get() } 41 | .get_variable_type_by_name(&s[1..]), 42 | None => get_var_from_imports(c.type_check_parent_scope.as_ref()?.clone(), s), 43 | } 44 | } 45 | 46 | impl TypeCheckContext { 47 | fn get_type_alias<'a>(&self, k: &'a [String]) -> Option { 48 | if k.len() == 1 { 49 | if self 50 | .type_check_current_scope_type_alias 51 | .contains_key(k.last().unwrap()) 52 | { 53 | Some(self.type_check_current_scope_type_alias[k.last().unwrap()].clone()) 54 | } else { 55 | if let Some(p) = self.type_check_parent_scope.clone() { 56 | (unsafe { &*p.get() }).get_type_alias(k) 57 | } else { 58 | None 59 | } 60 | } 61 | } else { 62 | get_alias_from_imports(Rc::new(UnsafeCell::new(self.clone())), k) 63 | } 64 | } 65 | 66 | fn get_variable_type_by_name(&self, k: &[String]) -> Option { 67 | if k.len() == 1 { 68 | if self 69 | .type_check_current_scope_variables 70 | .contains_key(k.last().unwrap()) 71 | { 72 | Some(self.type_check_current_scope_variables[k.last().unwrap()].clone()) 73 | } else { 74 | if let Some(p) = self.type_check_parent_scope.clone() { 75 | (unsafe { &*p.get() }).get_variable_type_by_name(k) 76 | } else { 77 | None 78 | } 79 | } 80 | } else { 81 | get_var_from_imports(Rc::new(UnsafeCell::new(self.clone())), k) 82 | } 83 | } 84 | fn new_type_checking_sub_scope(context: Rc>) -> Self { 85 | Self { 86 | imports: unsafe { &*context.get() }.imports.clone(), 87 | type_check_parent_scope: Some(context), 88 | type_check_current_scope_variables: BTreeMap::new(), 89 | type_check_current_scope_type_alias: BTreeMap::new(), 90 | 91 | current_scope_import_alias: BTreeMap::new(), 92 | } 93 | } 94 | } 95 | 96 | pub fn type_check_toplevel( 97 | toplevel: &TopLevel, 98 | context: Rc>, 99 | ) -> Result, &'static str> { 100 | match toplevel { 101 | TopLevel::Comment(_) => Ok(None), 102 | TopLevel::TypeDef(s, e) => { 103 | let clos = type_check_expr(e, context.clone())?; 104 | if let Type::Function(args, r) = clos.clone() { 105 | unsafe { &mut *context.clone().get() } 106 | .type_check_current_scope_variables 107 | .insert( 108 | s.clone(), 109 | Type::Function(args, Box::new(Type::Alias(vec![s.clone()]))), 110 | ); 111 | unsafe { &mut *context.clone().get() } 112 | .type_check_current_scope_type_alias 113 | .insert(s.clone(), *r.clone()); 114 | Ok(Some(Type::Alias(vec![s.clone()]))) 115 | } else { 116 | Err("not f") 117 | } 118 | } 119 | TopLevel::EnumDef(_, _) => todo!(), 120 | TopLevel::ImportPath(_, _) => todo!(), 121 | TopLevel::Expr(e) => Ok(type_check_expr(&*e, context).ok()), 122 | } 123 | } 124 | 125 | pub fn type_check_expr( 126 | e: &CommentedExpr, 127 | context: Rc>, 128 | ) -> Result { 129 | let CommentedExpr { 130 | comment: _, 131 | expr: e, 132 | } = e; 133 | match e { 134 | Expr::Pair(s, e) => Ok(Type::Pair( 135 | s.clone(), 136 | Box::new(type_check_expr(&*e, context)?), 137 | )), 138 | Expr::Quoted(e) => type_check_expr(e, context), 139 | Expr::Block(es) => { 140 | let ct = Rc::new(UnsafeCell::new( 141 | TypeCheckContext::new_type_checking_sub_scope(context.clone()), 142 | )); 143 | let mut tys = es 144 | .iter() 145 | .map(|e| type_check_toplevel(e, ct.clone())) 146 | .collect::>(); 147 | tys.reverse(); 148 | for i in 0..tys.len() { 149 | if let Ok(Some(ty)) = tys[i].clone() { 150 | return Ok(ty); 151 | } 152 | } 153 | Err("block element has no expr") 154 | } 155 | Expr::Literal(l) => match l { 156 | crate::parser::expr::literal::Literal::Null => Ok(Type::Any), 157 | crate::parser::expr::literal::Literal::Bool(_) => Ok(Type::Bool), 158 | crate::parser::expr::literal::Literal::String(_) => Ok(Type::String), 159 | crate::parser::expr::literal::Literal::Number(_) => Ok(Type::Number), 160 | }, 161 | Expr::Ident(i) => { 162 | match unsafe { &mut *context.get() }.get_variable_type_by_name(i.as_slice()) { 163 | Some(fv) => Ok(fv.clone()), 164 | None => Ok(Type::Any), 165 | } 166 | } 167 | Expr::Array(_) => Ok(Type::Array), 168 | Expr::Object(es) => { 169 | let mut b = BTreeMap::new(); 170 | for ((_, k), v) in es { 171 | b.insert( 172 | k.clone(), 173 | type_check_expr(v, context.clone()).unwrap_or(Type::Any), 174 | ); 175 | } 176 | Ok(Type::Object(b)) 177 | } 178 | Expr::Closure(a, b, c) => { 179 | let ct = Rc::new(UnsafeCell::new( 180 | TypeCheckContext::new_type_checking_sub_scope(context.clone()), 181 | )); 182 | let mut aa = vec![]; 183 | for (k, v) in a { 184 | aa.push(v.clone().unwrap_or(Type::Any)); 185 | unsafe { &mut *ct.get() } 186 | .type_check_current_scope_variables 187 | .insert(k.clone(), v.clone().unwrap_or(Type::Any)); 188 | } 189 | 190 | let bb = type_check_expr(c, ct)?; 191 | 192 | Ok(Type::Function( 193 | aa, 194 | Box::new(type_elab(context, bb, b.clone().unwrap_or(Type::Any))?), 195 | )) 196 | } 197 | Expr::If(a, b, c) => { 198 | let aa = type_check_expr(a, context.clone())?; 199 | let bb = type_check_expr(b, context.clone())?; 200 | let cc = type_check_expr(c, context.clone())?; 201 | let _ = type_elab(context.clone(), aa, Type::Bool)?; 202 | type_elab(context, bb, cc) 203 | } 204 | Expr::MultiIf(_a, _b) => todo!(), 205 | Expr::For(_, _, _) => Ok(Type::Any), 206 | Expr::Call(func, args) => { 207 | let aaa = type_check_expr(func, context.clone())?; 208 | let mut bbbs = args 209 | .iter() 210 | .map(|b| type_check_expr(b, context.clone()).unwrap_or(Type::Any)) 211 | .collect::>(); 212 | match aaa { 213 | Type::Any => Ok(Type::Any), 214 | Type::Function(mut a, b) => { 215 | if a.len() > bbbs.len() { 216 | for i in 0..bbbs.len() { 217 | bbbs[i] = type_elab(context.clone(), a[i].clone(), bbbs[i].clone())?; 218 | } 219 | let args = a[bbbs.len()..] 220 | .iter() 221 | .map(|t| t.clone()) 222 | .collect::>(); 223 | Ok(Type::Function(args, b)) 224 | } else if a.len() < bbbs.len() { 225 | if let box _f @ Type::Function(_, _) = b { 226 | let mut expr = CommentedExpr::from_expr(Expr::Call( 227 | Box::new(CommentedExpr::from_expr(Expr::Call( 228 | func.clone(), 229 | args[0..a.len()] 230 | .iter() 231 | .map(|x| x.clone()) 232 | .collect::>(), 233 | ))), 234 | args[a.len()..] 235 | .iter() 236 | .map(|x| x.clone()) 237 | .collect::>(), 238 | )); 239 | type_check_expr(&mut expr, context) 240 | } else { 241 | Err("too much argument") 242 | } 243 | } else { 244 | for i in 0..a.len() { 245 | a[i] = type_elab( 246 | context.clone(), 247 | a[i].clone(), 248 | type_check_expr(&mut args[i].clone(), context.clone())?, 249 | )?; 250 | } 251 | Ok(*b) 252 | } 253 | } 254 | _ => Err("call with other expr"), 255 | } 256 | } 257 | Expr::ErrorHandle(e) => type_check_expr(e, context), 258 | // TODO: FUCK ME 259 | Expr::Bind(ba, bb) => { 260 | let aaa = type_check_expr(ba, context.clone())?; 261 | let bbb = type_check_expr(bb, context.clone())?; 262 | match bbb { 263 | Type::Any => Ok(Type::Any), 264 | Type::Function(a, _b) => match aaa { 265 | Type::Function(aa, bb) => { 266 | if a.len() < 1 { 267 | type_check_expr( 268 | &mut CommentedExpr::from_expr(Expr::Call(ba.clone(), vec![])), 269 | context, 270 | ) 271 | } else { 272 | let mut aa = aa; 273 | for i in 1..a.len() { 274 | aa.push(a[i].clone()); 275 | } 276 | type_elab(context, *bb, a[0].clone()) 277 | } 278 | } 279 | _nonf => type_check_expr( 280 | &mut CommentedExpr::from_expr(Expr::Call(bb.clone(), vec![*ba.clone()])), 281 | context, 282 | ), 283 | }, 284 | Type::Alias(_a) => { 285 | todo!() 286 | } 287 | _ => Err("not bindable"), 288 | } 289 | } 290 | // TODO: elab index 291 | Expr::Index(_a, _b) => Ok(Type::Any), 292 | Expr::Assign(a, b) => { 293 | let aaa = type_check_expr(a, context.clone())?; 294 | 295 | if let box CommentedExpr { 296 | comment: _, 297 | expr: Expr::Ident(aa), 298 | } = a 299 | { 300 | match unsafe { &mut *context.get() }.get_variable_type_by_name(aa.as_slice()) { 301 | Some(_fv) => { 302 | unsafe { &mut *context.get() } 303 | .type_check_current_scope_variables 304 | .insert(aa[0].clone(), Type::Any); 305 | let bbb = type_check_expr(b, context.clone())?; 306 | let r = type_elab(context.clone(), aaa, bbb.clone())?; 307 | unsafe { &mut *context.get() } 308 | .type_check_current_scope_variables 309 | .insert(aa[0].clone(), r.clone()); 310 | Ok(r) 311 | } 312 | None => { 313 | let bbb = type_check_expr(b, context.clone())?; 314 | let r = type_elab(context.clone(), Type::Any, bbb.clone())?; 315 | unsafe { &mut *context.get() } 316 | .type_check_current_scope_variables 317 | .insert(aa[0].clone(), r.clone()); 318 | Ok(r) 319 | } 320 | } 321 | } else { 322 | type_check_expr(b, context) 323 | } 324 | } 325 | Expr::SpecifyTyped(ex, ty) => { 326 | let tyy = type_check_expr(ex, context.clone())?; 327 | type_elab(context, tyy, ty.clone()) 328 | } 329 | } 330 | } 331 | --------------------------------------------------------------------------------