scala 0.1.1

A experimental Scala interpreter written in Rust: lexer, parser, type inference, and tree-walking evaluation with a REPL.
Documentation 
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

// List operations and for-comprehensions
val nums = List(10, 20, 30, 40, 50)

println("List Operations")
println("nums = " + nums.mkString(", "))
println("head = " + nums.head)
println("length = " + nums.length)
println("isEmpty = " + nums.isEmpty)
println("contains(30) = " + nums.contains(30))
println("indexOf(30) = " + nums.indexOf(30))

// Transformations
val doubled = nums.map((x) => x * 2)
println("doubled = " + doubled.mkString(", "))

val big = nums.filter((x) => x > 25)
println("big = " + big.mkString(", "))

val sum = nums.reduce((a, b) => a + b)
println("sum = " + sum)

val reversed = nums.reverse
println("reversed = " + reversed.mkString(", "))

val sorted = List(5, 3, 1, 4, 2).sorted
println("sorted = " + sorted.mkString(", "))

// For comprehensions
val squares = for (x <- List(1, 2, 3, 4, 5)) yield x * x
println("squares = " + squares.mkString(", "))

val evenSquares = for {
  x <- List(1, 2, 3, 4, 5, 6, 7, 8, 9, 10)
  if x % 2 == 0
} yield x * x
println("evenSquares = " + evenSquares.mkString(", "))

// Nested for
val pairs = for {
  x <- List(1, 2)
  y <- List(10, 20)
} yield x + y
println("pairs = " + pairs.mkString(", "))

// String operations
val greeting = "Hello, Scala!"
println("String Operations")
println("greeting = " + greeting)
println("length = " + greeting.length)
println("toUpperCase = " + greeting.toUpperCase)
println("contains(\"Scala\") = " + greeting.contains("Scala"))