Compare commits

..

18 Commits

Author SHA1 Message Date
14a0a36b7f remove workflow 2025-06-28 01:18:49 -04:00
5dedce8f6d update readme
Some checks failed
Trigger Bot Build / trigger-bot-build (push) Has been cancelled
2024-11-27 01:43:35 -05:00
b953a372c2 lol, fix error 2024-11-27 01:41:11 -05:00
eeacbc6473 implement parens for function calling syntax 2024-11-27 01:39:27 -05:00
fbd95ecafb idr lol 2024-10-29 00:57:07 -04:00
4c4c69d40b new operators for array manipulation 2024-10-28 21:30:58 -04:00
9e709c4cfc remove cargo.lock 2024-10-28 19:46:27 -04:00
c872cc9341 version 0.4.0 2024-10-28 19:37:37 -04:00
db08c6d0b5 update readme to use new export syntax 2024-10-28 19:37:10 -04:00
b00e1fd0b4 better syntax for exporting 2024-10-28 19:31:56 -04:00
48d2c009fb fix string parsing and error output 2024-10-28 18:44:05 -04:00
4c614c1937 Merge branch 'main' of https://github.com/minneelyyyy/lamm 2024-10-28 14:48:52 -04:00
a1ebbcac03 update to version 0.3.1 2024-10-28 14:48:08 -04:00
5ee06de1ba new error output, fix export 2024-10-28 13:51:23 -04:00
db6750c481 fix: exiting repl on newline and weird behaviour in discord bot 2024-10-27 23:21:13 -04:00
83ac160a42 fix tokenizer on string inputs 2024-10-27 22:56:10 -04:00
mins
c5dcf88f6b a standard library is planned 2024-10-26 01:27:03 -04:00
mins
7a76943120 update readme as // and (op) are now features 2024-10-26 01:26:25 -04:00
12 changed files with 496 additions and 439 deletions

View File

@@ -1,19 +0,0 @@
name: Trigger Bot Build
on:
push:
branches:
- dev
jobs:
trigger-bot-build:
runs-on: ubuntu-latest
steps:
- name: Send repository dispatch
env:
GITHUB_TOKEN: ${{ secrets.LAMM_TOKEN }}
run: |
curl -X POST -H "Accept: application/vnd.github.everest-preview+json" \
-H "Authorization: token $GITHUB_TOKEN" \
https://api.github.com/repos/minneelyyyy/bot/dispatches \
-d '{"event_type": "lamm-updated"}'

8
Cargo.lock generated
View File

@@ -1,6 +1,6 @@
# This file is automatically @generated by Cargo.
# It is not intended for manual editing.
version = 4
version = 3
[[package]]
name = "aho-corasick"
@@ -13,7 +13,7 @@ dependencies = [
[[package]]
name = "lamm"
version = "0.1.0"
version = "0.4.0"
dependencies = [
"regex",
]
@@ -26,9 +26,9 @@ checksum = "78ca9ab1a0babb1e7d5695e3530886289c18cf2f87ec19a575a0abdce112e3a3"
[[package]]
name = "regex"
version = "1.11.0"
version = "1.11.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "38200e5ee88914975b69f657f0801b6f6dccafd44fd9326302a4aaeecfacb1d8"
checksum = "b544ef1b4eac5dc2db33ea63606ae9ffcfac26c1416a2806ae0bf5f56b201191"
dependencies = [
"aho-corasick",
"memchr",

View File

@@ -1,6 +1,6 @@
[package]
name = "lamm"
version = "0.3.0"
version = "0.4.0"
edition = "2021"
license = "MIT"
description = "a simple, functional paradigm programming language which uses Polish notation"

View File

@@ -64,12 +64,12 @@ You can introduce a variable to global scope using the `export` builtin function
```
# A very useful constant
= pi 3.1415926
export ["pi"]
export pi
# Some more useful constants
= e 2.71828
= phi 1.6180339887
export ["e" "phi"]
export (e phi)
```
## Functions
@@ -77,43 +77,53 @@ export ["e" "phi"]
All functions in Lamm are **scoped** similarly to variables. Functions are declared using the `:` operator, which can be extended with more `:` and `.` characters to let Lamm know how many arguments the function takes.
```
: inc x + x 1
inc 24 # => 25
: inc x
+ x 1
(inc 24) # => 25
:. pythag a b sqrt + ** a 2.0 ** b 2.0
pythag 3 4 # => 5
: sqrt x
** x 0.5
:. pythag a b
(sqrt + ** a 2.0 ** b 2.0)
(pythag 3 4) # => 5
:::::. ten'args a b c d e f g h i j
[a b c d e f g h i j]
```
The parameter types and return type of functions can be declared using a special syntax unique to function and lambda definitions.
Calling a function requires parenthises around the call.
```
# Takes an x of `Any` type
: inc x + x 1
inc 12 # => 13
: inc x
+ x 1
(inc 12) # => 13
# Takes an x of `Int` and returns an `Int`
: inc ?. x Int -> Int + x 1
inc 9 # => 10
: inc ?. x Int -> Int
+ x 1
(inc 9) # => 10
```
The `?.` operator is unique to function declarations and is used to specify the type of an argument. There are also first class functions, here is the syntax for it.
```
# Applies a function to any value
:. apply : f x f x
apply \sqrt 9 # => 3
:. apply : f x
(f x)
(apply sqrt 9) # => 3
# Applies a function f which maps an Int to an Int to x
:. apply'int ?: f Int -> Int ?. x Int -> Int f x
apply'int \sqrt 36 # => 6
:. apply'int ?: f Int -> Int ?. x Int -> Int
(f x)
(apply'int sqrt 36) # => 6
```
The `:` operator inside of a function prototype tells Lamm that this argument must be a function where every argument and it's return type are all `Any`. This means that `: f` is essentially syntactic sugar for `?: f Any -> Any`. Also, in order to pass a function to a function, you must use the `\` operator, which tells Lamm not to call the function.
The `:` operator inside of a function prototype tells Lamm that this argument must be a function where every argument and it's return type are all `Any`. This means that `: f` is essentially syntactic sugar for `?: f Any -> Any`. You can pass a function with just it's identifier.
And off course, `:` and `?:` in function prototypes can also be extended depending on the number of arguments the function must take.
And of course, `:` and `?:` in function prototypes can also be extended depending on the number of arguments the function must take.
## Branching
@@ -172,27 +182,27 @@ Using these, you can build a lot of fundamental functional paradigm functions.
```
:. map : f ?. x [] -> []
?? bool x
+ f head x map \f tail x
[+ (f head x) (map f tail x)
empty
map ;x ** x 2 [1 2 3 4 5 6 7 8 9 10] # => [1 4 9 16 25 36 49 64 81 100]
(map ;x ** x 2 [1 2 3 4 5 6 7 8 9 10]) # => [1 4 9 16 25 36 49 64 81 100]
:: iterate : f i count -> []
?? > count 0
+ i iterate \f f i - count 1
[+ i (iterate f (f i) - count 1)
empty
iterate (+ 1) 0 10 # => [0 1 2 3 4 5 6 7 8 9]
(iterate (+ 1) 0 10) # => [0 1 2 3 4 5 6 7 8 9]
:. take ?. n Int ?. x [] -> []
?? > n 0
+ head x take - n 1 tail x
[+ head x (take - n 1 tail x)
empty
take 3 [1 2 3 4 5] # => [1 2 3]
(take 3 [1 2 3 4 5]) # => [1 2 3]
:. take'while ?: pred Any -> Bool ?. x [] -> []
?? && bool x pred head x
+ head x take'while \pred tail x
?? && bool x (pred head x)
[+ head x (take'while pred tail x)
empty
take'while (> 10) [1 3 5 7 9 11 13 15 16] # => [1 3 5 7 9]
(take'while (> 10) [1 3 5 7 9 11 13 15 16]) # => [1 3 5 7 9]
```
## Lambdas

View File

@@ -9,14 +9,10 @@
- tuples
- `extern "C"` functions
- modules (`import` function)
- a standard library
- structs
- data types (need an IO object for stateful functions to return)
- unpacking type parameters (`(x:xs)` in Haskell for example)
- type variables in function parameters and data types
- automatic Int to Float casting if a parameter expects a float
- `[x..y]` array generators
- `(+)` = `;.x y + x y`
## Maybe Add
- `/` for float division and `//` for integer division

View File

@@ -54,17 +54,21 @@ impl fmt::Display for Error {
if let Some(code) = &self.code {
let mut lines = code.lines();
let linect = match lines.nth(*line) {
let linect = match lines.nth(*line - 1) {
Some(l) => l,
None => return Ok(()), // there should probably be an error if the line number is somehow out of range
};
write!(f, "\n| --> {filename}:{line}:{}\n| {linect}\n", loc.start)?;
let numspaces = " ".repeat((*line as f64).log10() as usize + 1);
write!(f, "\n --> {filename}:{line}:{}\n", loc.start)?;
write!(f, "{numspaces} |\n")?;
write!(f, "{line} | {linect}\n")?;
let spaces = " ".repeat(loc.start);
let pointers: String = loc.clone().map(|_| '^').collect();
write!(f, "|{spaces}{pointers}")?;
write!(f, "{numspaces} |{spaces}{pointers}")?;
if let Some(note) = &self.note {
write!(f, " {note}")?;

View File

@@ -20,7 +20,7 @@ impl Executor {
}
}
pub(crate) fn values<I>(mut self, iter: I) -> impl Iterator<Item = Result<Value, Error>>
pub(crate) fn _values<I>(mut self, iter: I) -> impl Iterator<Item = Result<Value, Error>>
where
I: Iterator<Item = Result<ParseTree, Error>>
{
@@ -46,6 +46,11 @@ impl Executor {
self
}
pub(crate) fn add_local_mut(&mut self, k: String, v: Arc<Mutex<Object>>) -> &mut Self {
self.locals.insert(k, v);
self
}
fn _get_object(&self, ident: &String) -> Result<&Arc<Mutex<Object>>, Error> {
self.locals.get(ident).or(self.globals.get(ident))
.ok_or(Error::new(format!("undefined identifier {}", ident.clone())))
@@ -84,227 +89,217 @@ impl Executor {
locals
}
fn op_error(op: &Op, args: &[Value]) -> Error {
Error::new(format!("no overload of {op} matches the arguments {}",
args.iter().map(|x| format!("{x}")).collect::<Vec<_>>().join(", ")))
}
pub(crate) fn exec(&mut self, tree: ParseTree) -> Result<Value, Error> {
match tree {
ParseTree::Operator(op, args) => {
let args: Vec<Value> = args.into_iter()
.map(|x| self.exec(x)).collect::<Result<_, _>>()?;
match op {
Op::Add => match &args[..] {
[Value::Int(x), Value::Int(y)] => Ok(Value::Int(x + y)),
[Value::Float(x), Value::Int(y)] => Ok(Value::Float(x + *y as f64)),
[Value::Int(x), Value::Float(y)] => Ok(Value::Float(*x as f64 + y)),
[Value::Float(x), Value::Float(y)] => Ok(Value::Float(x + y)),
[Value::String(x), Value::String(y)] => Ok(Value::String(format!("{x}{y}"))),
[Value::Array(xtype, x), Value::Array(ytype, y)] => {
match (&op, &args[..]) {
(Op::Add, [x, y]) => match (x, y) {
(Value::Int(x), Value::Int(y)) => Ok(Value::Int(x + y)),
(Value::Float(x), Value::Int(y)) => Ok(Value::Float(x + *y as f64)),
(Value::Int(x), Value::Float(y)) => Ok(Value::Float(*x as f64 + y)),
(Value::Float(x), Value::Float(y)) => Ok(Value::Float(x + y)),
(Value::String(x), Value::String(y)) => Ok(Value::String(format!("{x}{y}"))),
_ => Err(Self::op_error(&op, &args)),
},
(Op::Neg, [x]) => match x {
Value::Int(x) => Ok(Value::Int(-x)),
Value::Float(x) => Ok(Value::Float(-x)),
_ => Err(Self::op_error(&op, &args)),
},
(Op::Concat, [x, y]) => match (x, y) {
(Value::Array(xtype, x), Value::Nil) => Ok(Value::Array(xtype.clone(), x.clone())),
(Value::Nil, Value::Array(xtype, x)) => Ok(Value::Array(xtype.clone(), x.clone())),
(Value::Array(xtype, x), Value::Array(ytype, y)) =>
if xtype != ytype {
return Err(Error::new(format!("expected type {} but found {}", xtype, ytype)));
}
Err(Error::new(format!("expected type {} but found {}", xtype, ytype)))
} else {
Ok(Value::Array(xtype.clone(), [x.clone(), y.clone()].concat()))
},
[Value::Nil, x] => Ok(x.clone()),
[x, Value::Nil] => Ok(x.clone()),
[Value::Array(t, x), y] => {
let ytype = y.get_type();
if *t != ytype {
return Err(Error::new(format!("expected type {} but found {}", t, ytype)));
}
// NOTE: use y's type instead of the arrays type.
// an `empty` array has Any type, but any value will have a fixed type.
// this converts the empty array into a typed array.
Ok(Value::Array(ytype, [x.clone(), vec![y.clone()]].concat()))
_ => Err(Self::op_error(&op, &args)),
},
[x, Value::Array(t, y)] => {
(Op::Prepend, [x, y]) => match (x, y) {
(Value::Nil, Value::Array(xtype, x)) => Ok(Value::Array(xtype.clone(), x.clone())),
(x, Value::Array(t, y)) => {
let xtype = x.get_type();
if *t != xtype {
return Err(Error::new(format!("expected type {} but found {}", t, xtype)));
}
// NOTE: read above
Err(Error::new(format!("expected type {} but found {}", t, xtype)))
} else {
Ok(Value::Array(xtype, [vec![x.clone()], y.clone()].concat()))
}
},
_ => Err(Error::new("todo: add".into())),
_ => Err(Self::op_error(&op, &args)),
},
(Op::Append, [x, y]) => match (x, y) {
(Value::Array(xtype, x), Value::Nil) => Ok(Value::Array(xtype.clone(), x.clone())),
(Value::Array(t, y), x) => {
let xtype = x.get_type();
if *t != xtype {
Err(Error::new(format!("expected type {} but found {}", t, xtype)))
} else {
Ok(Value::Array(xtype, [y.clone(), vec![x.clone()]].concat()))
}
Op::Sub => match &args[..] {
[Value::Int(x), Value::Int(y)] => Ok(Value::Int(x - y)),
[Value::Int(x), Value::Float(y)] => Ok(Value::Float(*x as f64 - y)),
[Value::Float(x), Value::Int(y)] => Ok(Value::Float(x - *y as f64)),
[Value::Float(x), Value::Float(y)] => Ok(Value::Float(x - y)),
[Value::Nil, x] => Ok(x.clone()),
[x, Value::Nil] => Ok(x.clone()),
_ => Err(Error::new("todo: actual error output".into())),
},
_ => Err(Self::op_error(&op, &args)),
},
(Op::Insert, [Value::Int(idx), x, Value::Array(t, y)]) => {
let mut y = y.clone();
let xtype = x.get_type();
if *t != xtype {
Err(Error::new(format!("expected type {} but found {}", t, xtype)))
} else if *idx as usize > y.len() {
Err(Error::new("attempt to insert out of array len".into()))
} else {
y.insert(*idx as usize, x.clone());
Ok(Value::Array(t.clone(), y))
}
Op::Mul => match &args[..] {
[Value::Int(x), Value::Int(y)] => Ok(Value::Int(x * y)),
[Value::Int(x), Value::Float(y)] => Ok(Value::Float(*x as f64 * y)),
[Value::Float(x), Value::Int(y)] => Ok(Value::Float(x * *y as f64)),
[Value::Float(x), Value::Float(y)] => Ok(Value::Float(x * y)),
[Value::Nil, x] => Ok(x.clone()),
[x, Value::Nil] => Ok(x.clone()),
_ => Err(Error::new("todo: actual error output".into())),
}
Op::Div => match &args[..] {
[Value::Int(x), Value::Int(y)] => Ok(Value::Float(*x as f64 / *y as f64)),
[Value::Float(x), Value::Int(y)] => Ok(Value::Float(x / *y as f64)),
[Value::Int(x), Value::Float(y)] => Ok(Value::Float(*x as f64 / y)),
[Value::Float(x), Value::Float(y)] => Ok(Value::Float(x / y)),
[Value::Nil, x] => Ok(x.clone()),
[x, Value::Nil] => Ok(x.clone()),
_ => Err(Error::new("todo: actual error output".into())),
}
Op::FloorDiv => match &args[..] {
[Value::Int(x), Value::Int(y)] => Ok(Value::Int(x / y)),
[Value::Float(x), Value::Int(y)] => Ok(Value::Int(*x as i64 / y)),
[Value::Int(x), Value::Float(y)] => Ok(Value::Int(x / *y as i64)),
[Value::Float(x), Value::Float(y)] => Ok(Value::Int(*x as i64 / *y as i64)),
[Value::Nil, x] => Ok(x.clone()),
[x, Value::Nil] => Ok(x.clone()),
_ => Err(Error::new("todo: actual error output".into())),
}
Op::Exp => match &args[..] {
[Value::Int(x), Value::Int(y)] => Ok(Value::Float((*x as f64).powf(*y as f64))),
[Value::Float(x), Value::Int(y)] => Ok(Value::Float(x.powf(*y as f64))),
[Value::Int(x), Value::Float(y)] => Ok(Value::Float((*x as f64).powf(*y))),
[Value::Float(x), Value::Float(y)] => Ok(Value::Float(x.powf(*y))),
[Value::Nil, x] => Ok(x.clone()),
[x, Value::Nil] => Ok(x.clone()),
_ => Err(Error::new("todo: fsadfdsf".into())),
}
Op::Mod => match &args[..] {
[Value::Int(x), Value::Int(y)] => Ok(Value::Int(x % y)),
[Value::Float(x), Value::Int(y)] => Ok(Value::Float(x % *y as f64)),
[Value::Int(x), Value::Float(y)] => Ok(Value::Float(*x as f64 % y)),
[Value::Float(x), Value::Float(y)] => Ok(Value::Float(x % y)),
[Value::Nil, x] => Ok(x.clone()),
[x, Value::Nil] => Ok(x.clone()),
_ => Err(Error::new("todo: actual error output".into())),
}
Op::GreaterThan => match &args[..] {
[Value::Int(x), Value::Int(y)] => Ok(Value::Bool(x > y)),
[Value::Float(x), Value::Int(y)] => Ok(Value::Bool(*x > *y as f64)),
[Value::Int(x), Value::Float(y)] => Ok(Value::Bool(*x as f64 > *y)),
[Value::Float(x), Value::Float(y)] => Ok(Value::Bool(x > y)),
_ => Err(Error::new("todo: actual error output".into())),
}
Op::GreaterThanOrEqualTo => match &args[..] {
[Value::Int(x), Value::Int(y)] => Ok(Value::Bool(x >= y)),
[Value::Float(x), Value::Int(y)] => Ok(Value::Bool(*x >= *y as f64)),
[Value::Int(x), Value::Float(y)] => Ok(Value::Bool(*x as f64 >= *y)),
[Value::Float(x), Value::Float(y)] => Ok(Value::Bool(x >= y)),
_ => Err(Error::new("todo: actual error output".into())),
}
Op::LessThan => match &args[..] {
[Value::Int(x), Value::Int(y)] => Ok(Value::Bool(x < y)),
[Value::Float(x), Value::Int(y)] => Ok(Value::Bool(*x < *y as f64)),
[Value::Int(x), Value::Float(y)] => Ok(Value::Bool((*x as f64) < *y)),
[Value::Float(x), Value::Float(y)] => Ok(Value::Bool(x < y)),
_ => Err(Error::new("todo: actual error output".into())),
}
Op::LessThanOrEqualTo => match &args[..] {
[Value::Int(x), Value::Int(y)] => Ok(Value::Bool(x <= y)),
[Value::Float(x), Value::Int(y)] => Ok(Value::Bool(*x <= *y as f64)),
[Value::Int(x), Value::Float(y)] => Ok(Value::Bool(*x as f64 <= *y)),
[Value::Float(x), Value::Float(y)] => Ok(Value::Bool(x <= y)),
_ => Err(Error::new("todo: actual error output".into())),
}
Op::EqualTo => match &args[..] {
[Value::Int(x), Value::Int(y)] => Ok(Value::Bool(x == y)),
[Value::Float(x), Value::Int(y)] => Ok(Value::Bool(*x == *y as f64)),
[Value::Int(x), Value::Float(y)] => Ok(Value::Bool(*x as f64 == *y)),
[Value::Float(x), Value::Float(y)] => Ok(Value::Bool(x == y)),
_ => Err(Error::new("todo: actual error output".into())),
}
Op::NotEqualTo => match &args[..] {
[Value::Int(x), Value::Int(y)] => Ok(Value::Bool(x != y)),
[Value::Float(x), Value::Int(y)] => Ok(Value::Bool(*x != *y as f64)),
[Value::Int(x), Value::Float(y)] => Ok(Value::Bool(*x as f64 != *y)),
[Value::Float(x), Value::Float(y)] => Ok(Value::Bool(x != y)),
_ => Err(Error::new("todo: actual error output".into())),
}
Op::Not => match &args[0] {
Value::Bool(b) => Ok(Value::Bool(!b)),
_ => Err(Error::new("todo: actual error output".into())),
}
Op::Or => match &args[..] {
[Value::Bool(x), Value::Bool(y)] => Ok(Value::Bool(*x || *y)),
[Value::Nil, x] => Ok(x.clone()),
[x, Value::Nil] => Ok(x.clone()),
_ => Err(Error::new("todo: actual error output".into())),
}
Op::And => match &args[..] {
[Value::Bool(x), Value::Bool(y)] => Ok(Value::Bool(*x && *y)),
[Value::Nil, x] => Ok(x.clone()),
[x, Value::Nil] => Ok(x.clone()),
_ => Err(Error::new("todo: actual error output".into())),
}
Op::Compose => match &args[..] {
[_, v] => Ok(v.clone()),
_ => Err(Error::new("todo: actual error output".into())),
}
Op::Head => match &args[0] {
Value::Array(_, x) => Ok(x.first().ok_or(Error::new(format!("passed an empty array to head")))?.clone()),
_ => Err(Error::new("head".into())),
}
Op::Tail => match &args[0] {
Value::Array(t, x) => Ok(Value::Array(t.clone(), if x.len() > 0 { x[1..].to_vec() } else { vec![] })),
_ => Err(Error::new("tail".into())),
}
Op::Init => match &args[0] {
Value::Array(t, x) => Ok(Value::Array(t.clone(), if x.len() > 0 { x[..x.len() - 1].to_vec() } else { vec![] })),
_ => Err(Error::new("init".into())),
}
Op::Fini => match &args[0] {
Value::Array(_, x) => Ok(x.last().ok_or(Error::new(format!("passed an empty array to fini")))?.clone()),
_ => Err(Error::new("fini".into())),
}
Op::Id => match &args[0] {
x => Ok(x.clone()),
}
Op::IntCast => match &args[0] {
},
(Op::Sub, [x, y]) => match (x, y) {
(Value::Int(x), Value::Int(y)) => Ok(Value::Int(x - y)),
(Value::Int(x), Value::Float(y)) => Ok(Value::Float(*x as f64 - y)),
(Value::Float(x), Value::Int(y)) => Ok(Value::Float(x - *y as f64)),
(Value::Float(x), Value::Float(y)) => Ok(Value::Float(x - y)),
_ => Err(Self::op_error(&op, &args)),
},
(Op::Mul, [x, y]) => match (x, y) {
(Value::Int(x), Value::Int(y)) => Ok(Value::Int(x * y)),
(Value::Int(x), Value::Float(y)) => Ok(Value::Float(*x as f64 * y)),
(Value::Float(x), Value::Int(y)) => Ok(Value::Float(x * *y as f64)),
(Value::Float(x), Value::Float(y)) => Ok(Value::Float(x * y)),
_ => Err(Self::op_error(&op, &args)),
},
(Op::Div, [x, y]) => match (x, y) {
(Value::Int(x), Value::Int(y)) => Ok(Value::Float(*x as f64 / *y as f64)),
(Value::Float(x), Value::Int(y)) => Ok(Value::Float(x / *y as f64)),
(Value::Int(x), Value::Float(y)) => Ok(Value::Float(*x as f64 / y)),
(Value::Float(x), Value::Float(y)) => Ok(Value::Float(x / y)),
_ => Err(Self::op_error(&op, &args)),
},
(Op::FloorDiv, [x, y]) => match (x, y) {
(Value::Int(x), Value::Int(y)) => Ok(Value::Int(x / y)),
(Value::Float(x), Value::Int(y)) => Ok(Value::Int(*x as i64 / y)),
(Value::Int(x), Value::Float(y)) => Ok(Value::Int(x / *y as i64)),
(Value::Float(x), Value::Float(y)) => Ok(Value::Int(*x as i64 / *y as i64)),
_ => Err(Self::op_error(&op, &args)),
},
(Op::Exp, [x, y]) => match (x, y) {
(Value::Int(x), Value::Int(y)) => Ok(Value::Float((*x as f64).powf(*y as f64))),
(Value::Float(x), Value::Int(y)) => Ok(Value::Float(x.powf(*y as f64))),
(Value::Int(x), Value::Float(y)) => Ok(Value::Float((*x as f64).powf(*y))),
(Value::Float(x), Value::Float(y)) => Ok(Value::Float(x.powf(*y))),
_ => Err(Self::op_error(&op, &args)),
},
(Op::Mod, [x, y]) => match (x, y) {
(Value::Int(x), Value::Int(y)) => Ok(Value::Int(x % y)),
(Value::Float(x), Value::Int(y)) => Ok(Value::Float(x % *y as f64)),
(Value::Int(x), Value::Float(y)) => Ok(Value::Float(*x as f64 % y)),
(Value::Float(x), Value::Float(y)) => Ok(Value::Float(x % y)),
_ => Err(Self::op_error(&op, &args)),
},
(Op::GreaterThan, [x, y]) => match (x, y) {
(Value::Int(x), Value::Int(y)) => Ok(Value::Bool(x > y)),
(Value::Float(x), Value::Int(y)) => Ok(Value::Bool(*x > *y as f64)),
(Value::Int(x), Value::Float(y)) => Ok(Value::Bool(*x as f64 > *y)),
(Value::Float(x), Value::Float(y)) => Ok(Value::Bool(x > y)),
_ => Err(Self::op_error(&op, &args)),
},
(Op::GreaterThanOrEqualTo, [x, y]) => match (x, y) {
(Value::Int(x), Value::Int(y)) => Ok(Value::Bool(x >= y)),
(Value::Float(x), Value::Int(y)) => Ok(Value::Bool(*x >= *y as f64)),
(Value::Int(x), Value::Float(y)) => Ok(Value::Bool(*x as f64 >= *y)),
(Value::Float(x), Value::Float(y)) => Ok(Value::Bool(x >= y)),
_ => Err(Self::op_error(&op, &args)),
},
(Op::LessThan, [x, y]) => match (x, y) {
(Value::Int(x), Value::Int(y)) => Ok(Value::Bool(x < y)),
(Value::Float(x), Value::Int(y)) => Ok(Value::Bool(*x < *y as f64)),
(Value::Int(x), Value::Float(y)) => Ok(Value::Bool((*x as f64) < *y)),
(Value::Float(x), Value::Float(y)) => Ok(Value::Bool(x < y)),
_ => Err(Self::op_error(&op, &args)),
},
(Op::LessThanOrEqualTo, [x, y]) => match (x, y) {
(Value::Int(x), Value::Int(y)) => Ok(Value::Bool(x <= y)),
(Value::Float(x), Value::Int(y)) => Ok(Value::Bool(*x <= *y as f64)),
(Value::Int(x), Value::Float(y)) => Ok(Value::Bool(*x as f64 <= *y)),
(Value::Float(x), Value::Float(y)) => Ok(Value::Bool(x <= y)),
_ => Err(Self::op_error(&op, &args)),
},
(Op::EqualTo, [x, y]) => match (x, y) {
(Value::Int(x), Value::Int(y)) => Ok(Value::Bool(x == y)),
(Value::Float(x), Value::Int(y)) => Ok(Value::Bool(*x == *y as f64)),
(Value::Int(x), Value::Float(y)) => Ok(Value::Bool(*x as f64 == *y)),
(Value::Float(x), Value::Float(y)) => Ok(Value::Bool(x == y)),
_ => Err(Self::op_error(&op, &args)),
},
(Op::NotEqualTo, [x, y]) => match (x, y) {
(Value::Int(x), Value::Int(y)) => Ok(Value::Bool(x != y)),
(Value::Float(x), Value::Int(y)) => Ok(Value::Bool(*x != *y as f64)),
(Value::Int(x), Value::Float(y)) => Ok(Value::Bool(*x as f64 != *y)),
(Value::Float(x), Value::Float(y)) => Ok(Value::Bool(x != y)),
_ => Err(Self::op_error(&op, &args)),
},
(Op::Not, [Value::Bool(b)]) => Ok(Value::Bool(!b)),
(Op::Or, [x, y]) => match (x, y) {
(Value::Bool(x), Value::Bool(y)) => Ok(Value::Bool(*x || *y)),
_ => Err(Self::op_error(&op, &args)),
},
(Op::And, [x, y]) => match (x, y) {
(Value::Bool(x), Value::Bool(y)) => Ok(Value::Bool(*x && *y)),
_ => Err(Self::op_error(&op, &args)),
},
(Op::Compose, [_, v]) => Ok(v.clone()),
(Op::Head, [Value::Array(_, x)]) => Ok(x.first().ok_or(Error::new("passed an empty array to head".into()))?.clone()),
(Op::Tail, [Value::Array(t, x)]) => Ok(Value::Array(t.clone(), if x.len() > 0 { x[1..].to_vec() } else { vec![] })),
(Op::Init, [Value::Array(t, x)]) => Ok(Value::Array(t.clone(), if x.len() > 0 { x[..x.len() - 1].to_vec() } else { vec![] })),
(Op::Fini, [Value::Array(_, x)]) => Ok(x.last().ok_or(Error::new("passed an empty array to fini".into()))?.clone()),
(Op::Id, [x]) => Ok(x.clone()),
(Op::IntCast, [x]) => match x {
Value::Int(x) => Ok(Value::Int(*x)),
Value::Float(x) => Ok(Value::Int(*x as i64)),
Value::Bool(x) => Ok(Value::Int(if *x { 1 } else { 0 })),
Value::String(x) => {
let r: i64 = x.parse().map_err(|_| Error::new(format!("failed to parse {} into {}", x, Type::Int)))?;
Ok(Value::Int(r))
}
x => Err(Error::new(format!("no possible conversion from {} into {}", x, Type::Int))),
}
Op::FloatCast => match &args[0] {
},
_ => Err(Error::new(format!("no possible conversion from {} into {}", x, Type::Int))),
},
(Op::FloatCast, [x]) => match x {
Value::Int(x) => Ok(Value::Float(*x as f64)),
Value::Float(x) => Ok(Value::Float(*x)),
Value::Bool(x) => Ok(Value::Float(if *x { 1.0 } else { 0.0 })),
Value::String(x) => {
let r: f64 = x.parse().map_err(|_| Error::new(format!("failed to parse {} into {}", x, Type::Float)))?;
Ok(Value::Float(r))
}
x => Err(Error::new(format!("no possible conversion from {} into {}", x, Type::Float))),
}
Op::BoolCast => match &args[0] {
},
_ => Err(Error::new(format!("no possible conversion from {} into {}", x, Type::Float))),
},
(Op::BoolCast, [x]) => match x {
Value::Int(x) => Ok(Value::Bool(*x != 0)),
Value::Float(x) => Ok(Value::Bool(*x != 0.0)),
Value::Bool(x) => Ok(Value::Bool(*x)),
Value::String(x) => Ok(Value::Bool(!x.is_empty())),
Value::Array(_, vec) => Ok(Value::Bool(!vec.is_empty())),
x => Err(Error::new(format!("no possible conversion from {} into {}", x, Type::Bool))),
}
Op::StringCast => Ok(Value::String(format!("{}", &args[0]))),
Op::Print => match &args[0] {
_ => Err(Error::new(format!("no possible conversion from {} into {}", x, Type::Bool))),
},
(Op::StringCast, [x]) => Ok(Value::String(format!("{}", x))),
(Op::Print, [x]) => match x {
Value::String(s) => {
println!("{s}");
Ok(Value::Nil)
}
x => {
_ => {
println!("{x}");
Ok(Value::Nil)
}
}
_ => unreachable!(),
},
_ => Err(Self::op_error(&op, &args)),
}
}
ParseTree::Equ(ident, body, scope) => {
@@ -314,10 +309,14 @@ impl Executor {
let value = self.exec(*body)?;
let g = self.globals.clone();
Executor::new()
.locals(self.locals.clone())
.add_local(ident, Arc::new(Mutex::new(Object::value(value, g, self.locals.to_owned()))))
.exec(*scope)
let r = self.add_local_mut(
ident.clone(),
Arc::new(Mutex::new(Object::value(value, g, self.locals.to_owned()))))
.exec(*scope);
self.locals.remove(&ident);
r
}
},
ParseTree::LazyEqu(ident, body, scope) => {
@@ -325,22 +324,27 @@ impl Executor {
Err(Error::new(format!("attempt to override value of variable {ident}")))
} else {
let g = self.globals.clone();
Executor::new()
.locals(self.locals.clone())
.add_local(ident, Arc::new(Mutex::new(Object::variable(*body, g, self.locals.to_owned()))))
.exec(*scope)
let r = self.add_local_mut(ident.clone(), Arc::new(Mutex::new(Object::variable(*body, g, self.locals.to_owned()))))
.exec(*scope);
self.locals.remove(&ident);
r
}
},
ParseTree::FunctionDefinition(func, scope) => {
let name = func.name().unwrap().to_string();
let g = self.globals.clone();
Executor::new()
.locals(self.locals.clone())
.add_local(func.name().unwrap().to_string(),
let r = self.add_local_mut(name.clone(),
Arc::new(Mutex::new(Object::function(
func
.globals(g)
.locals(self.locals.clone()), HashMap::new(), HashMap::new()))))
.exec(*scope)
.exec(*scope);
self.locals.remove(&name);
r
},
ParseTree::FunctionCall(ident, args) => {
let obj = self.get_object_mut(&ident)?;
@@ -406,13 +410,6 @@ impl Executor {
Ok(Value::Nil)
}
ParseTree::NonCall(name) => {
let obj = self.get_object_mut(&name)?;
let v = obj.lock().unwrap().eval()?;
Ok(v)
}
ParseTree::_Local(_idx) => todo!(),
ParseTree::GeneratedFunction(function) => Ok(Value::Function(function.globals(self.globals.clone()).locals(self.locals.clone()))),
}

View File

@@ -119,12 +119,6 @@ impl Function {
ParseTree::Value(_) => body,
ParseTree::Nop => body,
ParseTree::Export(_) => body,
ParseTree::NonCall(ref var) => if let Some(idx) =
args.into_iter().position(|r| *r == *var) {
Box::new(ParseTree::_Local(idx))
} else {
body
}
ParseTree::GeneratedFunction(_) => todo!(),
}
}

View File

@@ -196,7 +196,7 @@ impl<R: BufRead> CodeIter<R> {
reader,
code: String::new(),
pos: 0,
line: 0,
line: 1,
column: 0,
}
}
@@ -246,7 +246,7 @@ impl<R: BufRead> Iterator for CodeIter<R> {
self.column = 0;
self.pos += 1;
None
Some('\n')
},
c => {
self.column += 1;
@@ -305,27 +305,18 @@ impl<R: BufRead> Runtime<R> {
self
}
}
impl<R: BufRead> Iterator for Runtime<R> {
type Item = Result<Value, Error>;
pub fn add_globals<Globals: IntoIterator<Item = (String, Value)>>(self, globals: Globals) -> Self {
globals.into_iter().fold(self, |acc, (key, value)| acc.add_global(&key, value))
}
fn next(&mut self) -> Option<Self::Item> {
pub fn values(&self) -> impl Iterator<Item = Result<Value, Error>> + use<'_, R> {
let tokenizer = Tokenizer::new(self.reader.clone());
let parser = Parser::new().add_globals(self.global_types.clone());
let tree = Parser::new()
.add_globals(self.global_types.clone())
.parse(&mut tokenizer.peekable());
let tree = match tree.map_err(|e| e
.code(self.code())
.file(self.filename.clone()))
{
Ok(Some(tree)) => tree,
Ok(None) => return None,
Err(e) => return Some(Err(e))
};
Some(Executor::new().add_globals(self.globals.clone()).exec(tree))
Executor::new()
.add_globals(self.globals.clone())
._values(parser.trees(tokenizer.peekable()))
.map(|r| r.map_err(|e| e.code(self.code()).file(self.filename.clone())))
}
}

View File

@@ -3,7 +3,7 @@ use std::io::{self, BufReader};
fn main() {
let runtime = lamm::Runtime::new(BufReader::new(io::stdin()), "<stdin>");
for value in runtime {
for value in runtime.values() {
match value {
Ok(v) => println!("=> {v}"),
Err(e) => eprintln!("error: {e}"),

View File

@@ -1,10 +1,10 @@
use super::{Value, Type, Function, FunctionType};
use super::tokenizer::{Token, TokenType, Op};
use super::error::Error;
use std::collections::HashMap;
use std::iter::Peekable;
use std::cmp::Ordering;
#[derive(Clone, Debug)]
pub(crate) enum ParseTree {
@@ -29,7 +29,6 @@ pub(crate) enum ParseTree {
GeneratedFunction(Function),
Nop,
NonCall(String),
Export(Vec<String>),
}
@@ -67,20 +66,25 @@ impl Parser {
items.into_iter().fold(self, |acc, (k, v)| acc.add_global(k, v))
}
pub(crate) fn locals(mut self, locals: HashMap<String, Type>) -> Self {
self.locals = locals;
self
}
pub(crate) fn add_local(mut self, k: String, v: Type) -> Self {
pub(crate) fn _add_local(mut self, k: String, v: Type) -> Self {
self.locals.insert(k, v);
self
}
pub(crate) fn _add_locals<Items: Iterator<Item = (String, Type)>>(mut self, items: Items) -> Self {
items.for_each(|(name, t)| {
pub(crate) fn _add_locals<Items: Iterator<Item = (String, Type)>>(self, items: Items) -> Self {
items.fold(self, |acc, (key, value)| acc._add_local(key, value))
}
fn add_local_mut(&mut self, k: String, v: Type) -> &mut Self {
self.locals.insert(k, v);
self
}
fn add_locals_mut<Items: IntoIterator<Item = (String, Type)>>(&mut self, items: Items) -> &mut Self {
for (name, t) in items {
self.locals.insert(name, t);
});
}
self
}
@@ -105,6 +109,7 @@ impl Parser {
let operators: HashMap<Op, FunctionType> = HashMap::from([
(Op::Add, FunctionType(Box::new(Type::Any), vec![Type::Any, Type::Any])),
(Op::Sub, FunctionType(Box::new(Type::Any), vec![Type::Any, Type::Any])),
(Op::Neg, FunctionType(Box::new(Type::Any), vec![Type::Any])),
(Op::Mul, FunctionType(Box::new(Type::Any), vec![Type::Any, Type::Any])),
(Op::Div, FunctionType(Box::new(Type::Float), vec![Type::Any, Type::Any])),
(Op::FloorDiv, FunctionType(Box::new(Type::Int), vec![Type::Any, Type::Any])),
@@ -121,6 +126,10 @@ impl Parser {
(Op::And, FunctionType(Box::new(Type::Bool), vec![Type::Bool, Type::Bool])),
(Op::Or, FunctionType(Box::new(Type::Bool), vec![Type::Bool, Type::Bool])),
(Op::Head, FunctionType(Box::new(Type::Any), vec![Type::Array(Box::new(Type::Any))])),
(Op::Concat, FunctionType(Box::new(Type::Array(Box::new(Type::Any))), vec![Type::Array(Box::new(Type::Any)), Type::Array(Box::new(Type::Any))])),
(Op::Prepend, FunctionType(Box::new(Type::Array(Box::new(Type::Any))), vec![Type::Any, Type::Array(Box::new(Type::Any))])),
(Op::Append, FunctionType(Box::new(Type::Array(Box::new(Type::Any))), vec![Type::Array(Box::new(Type::Any)), Type::Any])),
(Op::Insert, FunctionType(Box::new(Type::Array(Box::new(Type::Any))), vec![Type::Int, Type::Any, Type::Array(Box::new(Type::Any))])),
(Op::Tail, FunctionType(Box::new(Type::Array(Box::new(Type::Any))), vec![Type::Array(Box::new(Type::Any))])),
(Op::Init, FunctionType(Box::new(Type::Array(Box::new(Type::Any))), vec![Type::Array(Box::new(Type::Any))])),
(Op::Fini, FunctionType(Box::new(Type::Any), vec![Type::Array(Box::new(Type::Any))])),
@@ -167,40 +176,7 @@ impl Parser {
match token.token() {
TokenType::Constant(c) => Ok(Some(ParseTree::Value(c))),
TokenType::Identifier(ident) => {
match self.get_object_type(&ident).ok_or(
Error::new(format!("undefined identifier {ident}"))
.location(token.line, token.location))? {
Type::Function(f) => {
let f = f.clone();
let args = self.get_args(tokens, f.1.len())?;
if args.len() < f.1.len() {
let mut counter = 0;
let func_args: Vec<Type> = f.1.iter().skip(args.len()).cloned().collect();
let (names, types): (Vec<String>, Vec<Type>) = func_args
.into_iter()
.map(|t| {
counter += 1;
(format!("{counter}"), t)
}).unzip();
let function_type = FunctionType(f.0.clone(), types);
Ok(Some(ParseTree::Value(Value::Function(Function::lambda(
function_type,
names.clone(),
Box::new(ParseTree::FunctionCall(ident,
vec![
args,
names.into_iter().map(|x| ParseTree::Variable(x)).collect()
].concat())))))))
} else {
Ok(Some(ParseTree::FunctionCall(ident, args)))
}
}
_ => Ok(Some(ParseTree::Variable(ident))),
}
},
TokenType::Identifier(ident) => Ok(Some(ParseTree::Variable(ident))),
TokenType::Operator(op) => match op {
Op::OpenArray => {
let mut depth = 1;
@@ -229,14 +205,12 @@ impl Parser {
.into_iter()
.peekable();
let trees: Vec<ParseTree> = Parser::new()
.locals(self.locals.to_owned())
.trees(array_tokens)
let trees: Vec<ParseTree> = self.clone().trees(array_tokens)
.collect::<Result<_, Error>>()?;
let tree = trees.into_iter().fold(
ParseTree::Value(Value::Array(Type::Any, vec![])),
|acc, x| ParseTree::Operator(Op::Add, vec![acc, x.clone()]),
|acc, x| ParseTree::Operator(Op::Append, vec![acc, x.clone()]),
);
Ok(Some(tree))
@@ -246,7 +220,7 @@ impl Parser {
// take tokens until we reach the end of this array
// if we don't collect them here it causes rust to overflow computing the types
let array_tokens = tokens.by_ref().take_while(|t| match t {
let tokens = tokens.by_ref().take_while(|t| match t {
Ok(t) => match t.token() {
TokenType::Operator(Op::OpenStatement) => {
depth += 1;
@@ -261,17 +235,51 @@ impl Parser {
_ => true,
}).collect::<Result<Vec<_>, Error>>()?;
let array_tokens = array_tokens
let mut tokens = tokens
.into_iter()
.map(|t| Ok(t))
.collect::<Vec<Result<Token, Error>>>()
.into_iter()
.peekable();
let trees: Vec<ParseTree> = Parser::new()
.locals(self.locals.to_owned())
.trees(array_tokens)
.collect::<Result<_, Error>>()?;
if let Some(Ok(Some(Type::Function(f)))) = tokens.peek()
.map(|t| t.clone().and_then(|t| match t.token() {
TokenType::Identifier(ident) =>
Ok(Some(self.get_object_type(&ident).ok_or(
Error::new(format!("undefined identifier {ident}"))
.location(token.line, token.location))?)),
_ => Ok(None),
}))
{
let token = tokens.next().unwrap().unwrap();
let params: Vec<ParseTree> = self.clone().trees(tokens).collect::<Result<_, Error>>()?;
match params.len().cmp(&f.1.len()) {
Ordering::Equal => Ok(Some(ParseTree::FunctionCall(token.lexeme, params))),
Ordering::Greater => Err(Error::new(format!("too many arguments to {}", token.lexeme)).location(token.line, token.location)),
Ordering::Less => {
let mut counter = 0;
let func_args: Vec<Type> = f.1.iter().skip(params.len()).cloned().collect();
let (names, types): (Vec<String>, Vec<Type>) = func_args
.into_iter()
.map(|t| {
counter += 1;
(format!("{counter}"), t)
}).unzip();
let function_type = FunctionType(f.0.clone(), types);
Ok(Some(ParseTree::Value(Value::Function(Function::lambda(
function_type,
names.clone(),
Box::new(ParseTree::FunctionCall(token.lexeme,
vec![
params,
names.into_iter().map(|x| ParseTree::Variable(x)).collect()
].concat())))))))
}
}
} else {
let trees: Vec<ParseTree> = self.clone().trees(tokens).collect::<Result<_, Error>>()?;
let tree = trees.into_iter().fold(
ParseTree::Nop,
@@ -279,6 +287,7 @@ impl Parser {
);
Ok(Some(tree))
}
},
Op::Equ => {
let token = tokens.next()
@@ -287,21 +296,24 @@ impl Parser {
.note("expected an identifier after this token".into()))??;
if let TokenType::Identifier(ident) = token.token() {
let body = Box::new(self.parse(tokens)?.ok_or(Error::new(format!("the variable `{ident}` has no value"))
let body = self.parse(tokens)?.ok_or(Error::new(format!("the variable `{ident}` has no value"))
.location(token.line, token.location.clone())
.note("expected a value after this identifier".into()))?);
.note("expected a value after this identifier".into()))?;
let scope = Parser::new()
.locals(self.locals.clone())
.add_local(ident.clone(), Type::Any)
let scope = self.add_local_mut(ident.clone(), Type::Any)
.parse(tokens)?
.ok_or(Error::new("variable declaration requires a scope defined after it".into())
.location(token.line, token.location)
.note(format!("this variable {ident} has no scope")))?;
// temporary fix: just remove the identifier
// ignore errors removing, in the case that the symbol was already exported, it won't be present in locals
// this comes down to a basic architectural error. globals need to stick to the parser while locals need to be scoped.
self.locals.remove(&ident);
Ok(Some(ParseTree::Equ(
ident.clone(),
body,
Box::new(body),
Box::new(scope))
))
} else {
@@ -310,7 +322,7 @@ impl Parser {
},
Op::LazyEqu => {
let token = tokens.next()
.ok_or(Error::new("no identifier given for = expression".into())
.ok_or(Error::new("no identifier given for . expression".into())
.location(token.line, token.location)
.note("expected an identifier after this token".into()))??;
@@ -319,14 +331,16 @@ impl Parser {
.location(token.line, token.location.clone())
.note("expected a value after this identifier".into()))?);
let scope = Parser::new()
.locals(self.locals.clone())
.add_local(ident.clone(), Type::Any)
let scope = self.add_local_mut(ident.clone(), Type::Any)
.parse(tokens)?
.ok_or(Error::new("variable declaration requires a scope defined after it".into())
.location(token.line, token.location)
.note(format!("this variable {ident} has no scope")))?;
// temporary fix: just remove the identifier
// ignore errors removing, in the case that the symbol was already exported, it won't be present in locals
self.locals.remove(&ident);
Ok(Some(ParseTree::LazyEqu(
ident.clone(),
body,
@@ -339,22 +353,18 @@ impl Parser {
Op::FunctionDefine(arg_count) => {
let f = self.parse_function_definition(tokens, arg_count)?;
let scope = Parser::new()
.locals(self.locals.clone())
.add_local(f.name().unwrap().to_string(), Type::Function(f.get_type()))
let scope = self.add_local_mut(f.name().unwrap().to_string(), Type::Function(f.get_type()))
.parse(tokens)?
.ok_or(Error::new("function declaration requires a scope defined after it".into())
.location(token.line, token.location)
.note(format!("this function {} has no scope", f.name().unwrap())))?;
self.locals.remove(f.name().unwrap());
Ok(Some(ParseTree::FunctionDefinition( f.clone(), Box::new(scope))))
},
Op::LambdaDefine(arg_count) => Ok(Some(ParseTree::LambdaDefinition(self.parse_lambda_definition(tokens, arg_count)?))),
Op::Empty => Ok(Some(ParseTree::Value(Value::Array(Type::Any, vec![])))),
Op::NonCall => {
let name = Self::get_identifier(tokens.next())?;
Ok(Some(ParseTree::NonCall(name)))
},
Op::If => {
let cond = self.parse(tokens)?
.ok_or(Error::new("? statement requires a condition".into())
@@ -379,7 +389,37 @@ impl Parser {
Ok(Some(ParseTree::IfElse(
Box::new(cond), Box::new(truebranch), Box::new(falsebranch))))
},
Op::Export => todo!(),
Op::Export => {
let token = tokens.next()
.ok_or(Error::new("export expects an identifer or multiple inside of parens".into())
.location(token.line, token.location.clone()))??;
let names = match token.token() {
TokenType::Identifier(ident) => vec![ident],
TokenType::Operator(Op::OpenStatement) => {
tokens
.take_while(|token| !matches!(token.clone().map(|token| token.token()), Ok(TokenType::Operator(Op::CloseStatement))))
.map(|token| token.map(|token| match token.token() {
TokenType::Identifier(ident) => Ok(ident),
_ => Err(Error::new(format!("expected an identifier")).location(token.line, token.location))
})?)
.collect::<Result<_, Error>>()?
}
_ => return Err(Error::new("export expects one or more identifiers".into()).location(token.line, token.location)),
};
for name in &names {
let (name, t) = self.locals.remove_entry(name)
.ok_or(
Error::new(format!("attempt to export {name}, which is not in local scope"))
.location(token.line, token.location.clone())
)?;
self.globals.insert(name, t);
}
Ok(Some(ParseTree::Export(names)))
},
op => self.parse_operator(tokens, op).map(|x| Some(x)),
},
_ => Err(Error::new(format!("the token {} was unexpected", token.lexeme)).location(token.line, token.location)),
@@ -396,8 +436,7 @@ impl Parser {
}
Ok(Function::lambda(t, args, Box::new(
Parser::new()
.locals(locals).parse(tokens)?.ok_or(Error::new("lambda requires a body".into()))?)))
self.clone().add_locals_mut(locals).parse(tokens)?.ok_or(Error::new("lambda requires a body".into()))?)))
}
fn parse_function_definition<I: Iterator<Item = Result<Token, Error>>>(&mut self, tokens: &mut Peekable<I>, arg_count: usize) -> Result<Function, Error> {
@@ -413,8 +452,7 @@ impl Parser {
locals.insert(name.clone(), Type::Function(t.clone()));
Ok(Function::named(&name, t, args, Box::new(
Parser::new()
.locals(locals).parse(tokens)?.ok_or(Error::new("function requires a body".into()))?)))
self.clone().add_locals_mut(locals).parse(tokens)?.ok_or(Error::new("function requires a body".into()))?)))
}
fn parse_function_declaration<I: Iterator<Item = Result<Token, Error>>>(

View File

@@ -1,4 +1,4 @@
use std::collections::{VecDeque, HashMap};
use std::collections::HashMap;
use std::sync::{Arc, Mutex};
use crate::{CodeIter, Type};
@@ -7,6 +7,8 @@ use crate::error::Error;
use super::Value;
use std::io::BufRead;
use std::ops::Range;
use std::fmt;
use std::fmt::Formatter;
#[derive(Debug, Clone, PartialEq, Eq, Hash)]
pub enum Op {
@@ -17,6 +19,7 @@ pub enum Op {
FloorDiv,
Exp,
Equ,
Neg,
Mod,
LazyEqu,
TypeDeclaration,
@@ -42,6 +45,10 @@ pub enum Op {
Print,
OpenArray,
CloseArray,
Concat,
Prepend,
Append,
Insert,
OpenStatement,
CloseStatement,
Empty,
@@ -52,7 +59,62 @@ pub enum Op {
Init,
Fini,
Export,
NonCall,
}
impl fmt::Display for Op {
fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
let s = match self {
Op::Add => "+",
Op::Sub => "-",
Op::Mul => "*",
Op::Div => "/",
Op::FloorDiv => "//",
Op::Exp => "**",
Op::Equ => "=",
Op::Neg => "_",
Op::Mod => "%",
Op::LazyEqu => ".",
Op::TypeDeclaration => "?.",
Op::FunctionDefine(_n) => ":",
Op::FunctionDeclare(_n) => "?:",
Op::LambdaDefine(_n) => ";",
Op::Arrow => "->",
Op::Compose => "~",
Op::Id => ",",
Op::If => "?",
Op::IfElse => "??",
Op::GreaterThan => ">",
Op::LessThan => "<",
Op::EqualTo => "==",
Op::NotEqualTo => "!=",
Op::GreaterThanOrEqualTo => ">=",
Op::LessThanOrEqualTo => ">=",
Op::Not => "!",
Op::IntCast => "int",
Op::FloatCast => "float",
Op::BoolCast => "bool",
Op::StringCast => "string",
Op::Print => "print",
Op::OpenArray => "[",
Op::CloseArray => "]",
Op::Concat => "++",
Op::Prepend => "[+",
Op::Append => "+]",
Op::Insert => "[+]",
Op::OpenStatement => "(",
Op::CloseStatement => ")",
Op::Empty => "empty",
Op::And => "&&",
Op::Or => "||",
Op::Head => "head",
Op::Tail => "tail",
Op::Init => "init",
Op::Fini => "fini",
Op::Export => "export",
};
write!(f, "{s}")
}
}
#[derive(Debug, Clone, PartialEq)]
@@ -83,7 +145,7 @@ impl TokenType {
"fini" => TokenType::Operator(Op::Fini),
"export" => TokenType::Operator(Op::Export),
// Types
// Built-in Types
"Any" => TokenType::Type(Type::Any),
"Int" => TokenType::Type(Type::Int),
"Float" => TokenType::Type(Type::Float),
@@ -137,14 +199,12 @@ impl Token {
#[derive(Clone)]
pub(crate) struct Tokenizer<R: BufRead> {
reader: Arc<Mutex<CodeIter<R>>>,
tokens: VecDeque<Token>,
}
impl<R: BufRead> Tokenizer<R> {
pub fn new(reader: Arc<Mutex<CodeIter<R>>>) -> Self {
Self {
reader,
tokens: VecDeque::new(),
}
}
@@ -181,7 +241,7 @@ impl<R: BufRead> Tokenizer<R> {
}
/// Tokenizes more input and adds them to the internal queue
fn tokenize(&mut self) -> Result<(), Error> {
fn tokenize(&mut self) -> Result<Option<Token>, Error> {
let operators: HashMap<&'static str, Op> = HashMap::from([
("+", Op::Add),
("-", Op::Sub),
@@ -191,6 +251,7 @@ impl<R: BufRead> Tokenizer<R> {
("**", Op::Exp),
("%", Op::Mod),
("=", Op::Equ),
("_", Op::Neg),
(".", Op::LazyEqu),
("?.", Op::TypeDeclaration),
(":", Op::FunctionDefine(1)),
@@ -209,32 +270,33 @@ impl<R: BufRead> Tokenizer<R> {
("!=", Op::NotEqualTo),
("[", Op::OpenArray),
("]", Op::CloseArray),
("++", Op::Concat),
("[+", Op::Prepend),
("+]", Op::Append),
("[+]", Op::Insert),
("(", Op::OpenStatement),
(")", Op::CloseStatement),
("!", Op::Not),
("&&", Op::And),
("||", Op::Or),
("\\", Op::NonCall),
]);
let c = if let Some(c) = self.next_char() {
c
} else {
return Ok(());
return Ok(None);
};
if c.is_alphanumeric() {
let mut token = String::from(c);
while let Some(c) = self.next_char_if(|&c| c.is_alphanumeric() || c == '.' || c == '\'') {
while let Some(c) = self.next_char_if(|&c| c.is_alphanumeric() || c == '.' || c == '\'' || c == '_') {
token.push(c);
}
let (line, column) = self.getpos();
self.tokens.push_back(Token::new(TokenType::parse(&token)
.map_err(|e| e.location(line, column - token.len() + 1..column + 1))?, token.clone(), line, column - token.len() + 1));
self.tokenize()
Ok(Some(Token::new(TokenType::parse(&token).map_err(|e| e.location(line, column - token.len() + 1..column + 1))?, token.clone(), line, column - token.len() + 1)))
} else if c == '#' {
while self.next_char_if(|&c| c != '\n').is_some() {}
self.tokenize()
@@ -244,10 +306,15 @@ impl<R: BufRead> Tokenizer<R> {
while let Some(c) = self.next_char() {
match c {
'"' => break,
'"' => {
let (line, col) = self.getpos();
return Ok(Some(Token::new(TokenType::Constant(
Value::String(token.clone())), token, line, col)));
}
'\n' => return Err(
Error::new("Unclosed string literal".into())
.location(line, col..self.getpos().1)
.location(line, col..col+token.len()+1)
.note("newlines are not allowed in string literals (try \\n)".into())),
'\\' => match self.next_char() {
Some('\\') => token.push('\\'),
@@ -258,20 +325,16 @@ impl<R: BufRead> Tokenizer<R> {
Some(c) => token.push(c),
None => return Err(
Error::new("Unclosed string literal".into())
.location(line, col..self.getpos().1)
.location(line, col..token.len()+1)
.note("end of file found before \"".into())),
}
_ => token.push(c),
}
};
}
let (line, col) = self.getpos();
self.tokens.push_back(
Token::new(TokenType::Constant(
Value::String(token.clone())), token, line, col));
self.tokenize()
Err(Error::new("Unclosed string literal".into())
.location(line, col..self.getpos().1+1)
.note("end of file found before \"".into()))
} else if operators.keys().any(|x| x.starts_with(c)) {
let mut token = String::from(c);
@@ -309,9 +372,7 @@ impl<R: BufRead> Tokenizer<R> {
let token = Token::new(t, token, line, col);
self.tokens.push_back(token);
break;
return Ok(Some(token));
} else {
let next = match self.next_char_if(is_expected) {
Some(c) => c,
@@ -345,8 +406,7 @@ impl<R: BufRead> Tokenizer<R> {
let token = Token::new(t, token, line, col);
self.tokens.push_back(token);
break;
return Ok(Some(token))
}
};
@@ -354,16 +414,13 @@ impl<R: BufRead> Tokenizer<R> {
}
}
}
self.tokenize()
} else if c.is_whitespace() {
self.tokenize()
} else {
let (line, col) = self.getpos();
return Err(
Error::new(format!("an unidentified character {c} was found"))
.location(line, col - 1..col));
Err(Error::new(format!("an unidentified character {c} was found"))
.location(line, col..col+1))
}
}
}
@@ -372,16 +429,7 @@ impl<R: BufRead> Iterator for Tokenizer<R> {
type Item = Result<Token, Error>;
fn next(&mut self) -> Option<Self::Item> {
if let Some(token) = self.tokens.pop_front() {
return Some(Ok(token));
} else {
match self.tokenize() {
Ok(_) => (),
Err(e) => return Some(Err(e)),
};
self.next()
}
self.tokenize().transpose()
}
}
@@ -391,13 +439,11 @@ mod tests {
use std::io::Cursor;
#[test]
fn a() {
let program = ": f a * 12 a f 12";
fn meow() {
let program = "[+] 0 1 [2 3]";
let tokenizer = Tokenizer::new(Arc::new(Mutex::new(CodeIter::new(Cursor::new(program)))));
let tokens: Vec<_> = Tokenizer::new(Arc::new(Mutex::new(CodeIter::new(Cursor::new(program))))).collect();
let t: Vec<_> = tokenizer.collect();
println!("{t:#?}");
println!("{tokens:#?}");
}
}