1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633
// Copyright (c) 2020 Weird Constructor <weirdconstructor@gmail.com> // This is a part of WLambda. See README.md and COPYING for details. /*! WLambda - Embeddable Scripting Language for Rust ================================================ This crate provides a small and simple embeddable scripting language. Its syntax gravitates around functions and argument composition for functions. A core concept is that everything is callable. It could be viewed as LISP without parenthesis, or as a mixture of Perl, JavaScript and LISP/Scheme. Here are some of its properties: - Simple but unique syntax. For a reference look at the [WLambda Language Reference](https://docs.rs/wlambda/newest/wlambda/prelude/index.html#wlambda-reference) and the [parser](https://docs.rs/wlambda/newest/wlambda/parser/index.html). - Easily embeddable into Rust programs due to a simple API. - The language is about getting things done quickly, so performance is not a main priority. Current performance is roughly in the ball park of (C)Python, which means the language is quite possibly too slow where speed is the focus, but fast enough if you do any heavy lifting in Rust. - No garbage collector. Memory and resource management relies only on reference counting and RAII. You can create your own drop functions. - Main data structures are Lists and Maps. - No exceptions, except panics. Error handling is accomplished by a specialized data type. It can be thought of as dynamic counterpart of Rust's Result type. - Prototyped object orientation. - Easy maintenance and hackability of the implementation. - Custom user data implementation using [VValUserData](https://docs.rs/wlambda/newest/wlambda/vval/trait.VValUserData.html). - Has a testable wasm32 version: [WASM WLambda Evaluator](http://wlambda.m8geil.de/#!/main). The embedding API and all internal operations rely on a data structure made of [VVal](https://docs.rs/wlambda/newest/wlambda/vval/index.html) nodes. Here you can find the [WLambda Language Reference](prelude/index.html#wlambda-reference). # API Hello World ``` use wlambda::*; match wlambda::compiler::eval("40 + 2") { Ok(v) => { println!("Output: {}", v.s()); }, Err(e) => { eprintln!("Error: {}", e); }, } ``` See further down below for more API usage examples! # WLambda Language Guide **Try out WLambda right away in the [WASM WLambda Evaluator](http://wlambda.m8geil.de/#!/main).** ## Variables ```wlambda !x = 10; # Variable definition .x = 20; # Variable assignment ``` ## Operators ```wlambda !x = (1 + 2) * (8 - 4) / 2; std:assert_eq x 6; ``` ## If ```wlambda $true { std:displayln "It's true!"; } { std:displayln "It's false!"; }; ``` ```wlambda !x = 10 / 2; (x == 5) { std:displayln "x == 5"; }; ``` ## While ```wlambda !x = 10; while { x > 0 } { std:displayln x; (x == 5) { break[]; }; .x = x - 1; }; ``` ```wlambda !x = 10; !r = while { x > 0 } { std:displayln x; (x == 5) { # break is a function, first arg # is the return value for `while`: break 5; }; .x = x - 1; }; std:assert_eq r 5; ``` ## Counting Loop ```wlambda range 1 10 1 { std:displayln "> " _; }; ``` With named counting variable: ```wlambda range 1 10 1 {!(i) = @; # or just `!i = _` std:displayln "> " i; }; ``` ## Endless loop ```wlambda !x = 10; while $true { std:displayln x; .x = x - 1; (x == 0) break; }; ``` ## Functions ```wlambda !add = { _ + _1 }; # argument names _, _1, _2, ... !result = add 2 3; std:assert_eq result 5; ``` Different function call syntaxes: ```wlambda !add = {!(x, y) = @; # named variables, @ evals to list of all args x + y }; std:displayln[add[2, 3]]; # [] parenthesis calling syntax std:displayln add[2, 3]; # less parenthesis std:displayln (add 2 3); # explicit expression delimiting with `( ... )` std:displayln ~ add 2 3; # `~` means: evaluate rest as one expression ``` ### Returning from nested functions: ```wlambda !test = \:ret_label_a {!(x) = @; # an `if` is actually a call to another function, so we need to # dynamically jump upwards the call stack to the given label: (x > 10) { return :ret_label_a x * 2; }; }; std:assert_eq (test 11) 22; ``` ## Arrays ```wlambda !v = $[1, 2, 3]; v.1 = 5; std:assert_eq v.1 5; std:assert_eq (std:pop v) 3; std:assert_eq (std:pop v) 5; std:assert_eq (std:pop v) 1; ``` ## Hash tables/maps ```wlambda !m = ${ a = 10, c = 2 }; m.b = m.a + m.c; std:assert_eq m.b 12; ``` ## Strings ```wlambda !name = "Mr. X"; std:assert_eq name.4 "X"; # index a character std:assert_eq (name 0 3) "Mr."; # substring !stuff = "日本人"; std:assert_eq stuff.0 "日"; # Unicode support ``` ## Unicode identifiers: ```wlambda !人 = "jin"; std:assert_eq 人 "jin"; ``` ## Object Oriented Programming with prototypes ```wlambda !MyClass = ${ new = { ${ _proto = $self, _data = ${ balance = 0, } } }, deposit = { $data.balance = $data.balance + _; }, }; !account1 = MyClass.new[]; account1.deposit 100; account1.deposit 50; std:assert_eq account1._data.balance 150; ``` ## Object Oriented Programming with closures ```wlambda !MyClass = { !self = ${ balance = 0, }; self.deposit = { self.balance = self.balance + _; }; $:self }; !account1 = MyClass[]; account1.deposit 100; account1.deposit 50; std:assert_eq account1.balance 150; ``` ## Modules ```txt # util.wl: !@import std std; !@wlambda; !@export print_ten = { std:displayln ~ str 10; }; ``` For import you do: ```txt !@import u util; u:print_ten[] ``` # Example WLambda Code Just a quick glance at the WLambda syntax and semantics. More details for the syntax and the provided global functions can be found in the [WLambda Language Reference](prelude/index.html#wlambda-reference). ```wlambda # This is a comment # Definition: !a = 10; # Assignment: .a = 20; # List variable definition: !a_list = $[1, 2, 3, 4]; # Map assignment: !a_map = ${a = 10, b = 20}; # Function definition/assignment: !a_func = { _ + _1 # Arguments are not named, they are put into _, _1, _2 }; a_func[2, 3]; # Function call a_func 2 3; # Equivalent function call # Shortened one statement function definition: !do_something_to = \_ * 2; # There is no `if` statement. Booleans can be called # with two arguments. The first one is called when the boolean # is true, the second one is called when the boolean is false. (a == 10) { # called if a == 10 } { # called if a != 10 }; # Counting loop: !sum = $&0; # Defining a reference that can be assignment # from inside a function. # `range` calls the given function for each iteration # and passes the counter as first argument in `_` range 0 10 1 { # This is a regular function. .*sum = $*sum + _; # $* is a dereferencing operator # and .* starts a reference assignment }; # `range` loop with `break` !break_value = range 0 10 1 { (_ == 5) { break 22 }; }; # Returning early from functions: !some_fun = \:some_fun_lbl { # \:xxx defines a function label for returning !x = 10; .x = do_something_to x; (x > 20) { return :some_fun_lbl 20; # explicit argument for return returns from # the specified block. } .x = 20; x }; # `return` implicitly jumps to the topmost $nul label # you may specify a small unused label like `_` to jump out some unnamed func: !some_fun = { !(x) = @; (x == 20) \:_{ return 30 } # returns from some_fun, not from the if-branch }; # Error reporting: # There are special error values, that will make the program panic # if they are not handled correctly at statement block level: !some_erroring_func = { return $error "An error happened!" }; !value = some_erroring_func[]; # on_error calls the first argument if the second argument # is an error value. on_error { # handle error here, eg. report, or make a new error value !(err_value, line, col, file) = @; std:displayln err_value; } value; !handle_err = { std:displayln _ }; # with the ~ operator, you can chain it nicely: on_error {|| handle_err[_] } ~ some_erroring_func[]; # or without ~: on_error {|| handle_err[_] } (some_erroring_func[]); # or with | some_erroring_func[] | on_error {|| handle_err[_] }; # _? transforms an error value, and returns it from the current # function. optionally jumping outwards. std:assert_eq (str ~ std:to_ref ~ { _? ~ $e "ok"; # is with an error value the same as: `return $e "ok"` }[]) "$&&$e[98,17:<wlambda::eval>(Err)] \"ok\""; _? 10; # passes the value through !report_my_error = { std:displayln _ }; !some_erroring_func = { on_error { report_my_error _; } block :outer { # do something... (_ != 10) { return :outer $error "Something really failed" # same as, with the difference, that _? only returns # from :outer if it is an error value. _? :outer $error "Something really failed" } # do more ... } # cleanup ... }; # Basic closure OOP: # $& to make any closure capture of some_obj a weak reference, so # we don't get any cyclic references: !some_obj = $&${}; some_obj.do_something = { # do something here with some_obj captured (weakly) # from the upper lexical scope. }; some_obj.do_something[]; # Method call # Basic prototyped OOP: !some_class = ${ new = { ${ _proto = $self, a = 10, } }, bang = { std:str:cat "bang!" _ ":" $self.a }, }; !o = some_class.new[]; !r = o.bang 22; std:assert_eq r "bang!22:10"; ``` Currently there are many more examples in the test cases in `compiler.rs`. # API Usage Examples ## Basic API Usage Here is how you can quickly evaluate a piece of WLambda code: ``` let s = "$[1,2,3]"; let r = wlambda::compiler::eval(&s).unwrap(); println!("Res: {}", r.s()); ``` ## More Advanced API Usage If you want to quickly add some of your own functions, you can use the GlobalEnv `add_func` method: ``` use wlambda::vval::{VVal, VValFun, Env}; let global_env = wlambda::GlobalEnv::new_default(); global_env.borrow_mut().add_func( "my_crazy_add", |env: &mut Env, _argc: usize| { Ok(VVal::Int( env.arg(0).i() * 11 + env.arg(1).i() * 13 )) }, Some(2), Some(2)); let mut ctx = wlambda::compiler::EvalContext::new(global_env); // Please note, you can also add functions later on, // but this time directly to the EvalContext: ctx.set_global_var( "my_crazy_mul", &VValFun::new_fun(|env: &mut Env, _argc: usize| { Ok(VVal::Int( (env.arg(0).i() + 11) * (env.arg(1).i() + 13))) }, Some(2), Some(2), false)); let res_add : VVal = ctx.eval("my_crazy_add 2 4").unwrap(); assert_eq!(res_add.i(), 74); let res_mul : VVal = ctx.eval("my_crazy_mul 2 4").unwrap(); assert_eq!(res_mul.i(), 221); ``` ## Maintaining state ``` use wlambda::*; let mut ctx = EvalContext::new_default(); ctx.eval("!x = 10").unwrap(); ctx.set_global_var("y", &VVal::Int(32)); let r = ctx.eval("x + y").unwrap(); assert_eq!(r.s(), "42"); ``` # Possible Roadmap There are several things that can be added more or less easily to WLambda. But I am currently working on making the language more complete for real world use. So my current goals are: - Improve and further document the VVal API for interacting with WLambda. - Improve reference documentation. - DONE: Add proper module support (via !@import and !@export). - DONE: Add prototyped inheritance for OOP paradigm. - There are no plans to change the internal evaluator to a VM and/or JIT speedup. It's one of WLambda's goals to have a simple and easily hackable implementation. # License This project is licensed under the GNU General Public License Version 3 or later. ## Conversion to MIT / Apache-2.0 I (WeirdConstructor) herby promise to release WLambda under MIT / Apache-2.0 license if you use it in an open source / free software game (licensed under MIT and/or Apache-2.0) written in Rust (and WLambda) with a playable beta release, non trivial amount of content and enough gameplay to keep me occupied for at least 2 hours. You may use WLambda for your release as if it was released under MIT and/or Apache-2.0. Proper attribution as required by MIT and/or Apache-2.0. ## Why GPL? Picking a license for my code bothered me for a long time. I read many discussions about this topic. Read the license explanations. And discussed this matter with other developers. First about _why I write code for free_ at all: - It's my passion to write computer programs. In my free time I can write the code I want, when I want and the way I want. I can freely allocate my time and freely choose the projects I want to work on. - To help a friend or member of my family. - To solve a problem I have. Those are the reasons why I write code for free. Now the reasons _why I publish the code_, when I could as well keep it to myself: - So that it may bring value to users and the free software community. - Show my work as an artist. - To get into contact with other developers. - And it's a nice change to put some more polish on my private projects. Most of those reasons don't yet justify GPL. The main point of the GPL, as far as I understand: The GPL makes sure the software stays free software until eternity. That the user of the software always stays in control. That the users have _at least the means_ to adapt the software to new platforms or use cases. Even if the original authors don't maintain the software anymore. It ultimately prevents _"vendor lock in"_. I really dislike vendor lock in, especially as developer. Especially as developer I want and need to stay in control of the computers I use. Another point is, that my work has a value. If I give away my work without _any_ strings attached, I effectively work for free. Work for free for companies. I would compromise the price I can demand for my skill, workforce and time. This makes two reasons for me to choose the GPL: 1. I do not want to support vendor lock in scenarios. At least not for free. I want to prevent those when I have a choice. And before you ask, yes I work for a company that sells closed source software. I am not happy about the closed source fact. But it pays my bills and gives me the freedom to write free software in my free time. 2. I don't want to low ball my own wage and prices by giving away free software with no strings attached (for companies). ## If you need a permissive or private license (MIT) Please contact me if you need a different license and really want to use my code. As long as I am the only author, I can change the license. We might find an agreement. # Contribution Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in WLambda by you, shall be licensed as GPLv3 or later, without any additional terms or conditions. # Author * Weird Constructor <weirdconstructor@gmail.com> (WeirdConstructor on GitHub) (You may find me as `WeirdConstructor` on the Rust Discord.) # Contributors * Cedric Hutchings <cedhut02@gmail.com> (cedric-h on GitHub) */ pub mod vval; pub mod parser; pub mod compiler; pub mod prelude; pub mod threads; pub mod util; pub mod vval_user_obj; pub mod csv; pub use vval::VVal; pub use vval::Env; pub use vval::StackAction; pub use vval::VValUserData; pub use compiler::GlobalEnv; pub use compiler::EvalContext; pub use compiler::eval; pub use compiler::SymbolTable;