garrit
/
sabre
mirror of https://git.sr.ht/~garritfra/sabre
1
0
Fork 0
Code Issues Projects Releases Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
159 Commits
9 Branches
11 Tags
787 KiB
 
 
 
 
 
Tree: 2822fddfc1
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '2822fddfc1'
${ noResults }
sabre/src/parser/tests.rs

747 lines
14 KiB
Raw Blame History

use crate::lexer::*;
use crate::parser::node_type::*;
/**
* Copyright 2020 Garrit Franke
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
use crate::parser::parse;
#[test]
fn test_parse_empty_function() {
let raw = "fn main() {}";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_function_with_return() {
let raw = "
fn main() {
return 1
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_redundant_semicolon() {
let raw = "
fn main() {
return 1;
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_err())
}
#[test]
fn test_parse_no_function_context() {
let raw = "
let x = 1
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_err())
}
#[test]
fn test_parse_multiple_functions() {
let raw = "
fn foo() {
let x = 2
return x
}
fn bar() {
let y = 5
return y
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_variable_declaration() {
let raw = "
fn main() {
let x = 1
return x
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_variable_reassignment() {
let raw = "
fn main() {
let x = 1
x = x + 1
return x
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_variable_declaration_added() {
let raw = "
fn main() {
let x = 10
let y = 5
return x + y
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_function_with_args() {
let raw = "
fn main(foo: int) {
return foo
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_function_call() {
let raw = "
fn main(foo: int) {
foo()
}
fn foo() {
foo(2)
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_return_function_call() {
let raw = "
fn main() {
return fib(2)
}
fn fib() {
return fib(2)
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_function_call_multiple_arguments() {
let raw = "
fn main() {
fib(1, 2, 3)
}
fn fib() {
return 2
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_nexted_function_call() {
let raw = "
fn main() {
fib(fib(2), 2)
}
fn fib(n: int) {
return 2
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_basic_ops() {
let raw = "
fn main() {
return 2 * 5
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_compound_ops() {
let raw = "
fn main() {
2 * 5 / 3
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_compound_ops_with_function_call() {
let raw = "
fn main() {
return 2 * fib(1) / 3
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_compound_ops_with_strings() {
let raw = "
fn main() {
return 2 * \"Hello\"
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_compound_ops_with_identifier() {
let raw = "
fn main(n: int) {
return 2 * n
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_compound_ops_with_identifier_first() {
let raw = "
fn main(n: int) {
return n * 2
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_compound_ops_return() {
let raw = "
fn main(n: int) {
return 2 * n
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_basic_conditional() {
let raw = "
fn main(n: int) {
if n {
return n
}
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_basic_conditional_with_multiple_statements() {
let raw = "
fn main(n: int) {
if n {
let x = 2 * n
return x
}
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_conditional_else_if_branch() {
let raw = "
fn main(n: int) {
if n > 10 {
let x = 2 * n
return x
} else if n <= 10 {
return n
}
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_conditional_multiple_else_if_branch_branches() {
let raw = "
fn main(n: int) {
if n > 10 {
let x = 2 * n
return x
} else if n < 10 {
return n
} else if n == 10 {
return n + 1
}
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_conditional_else_branch() {
let raw = "
fn main(n: int) {
if n > 10 {
let x = 2 * n
return x
} else {
return n
}
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_parse_conditional_elseif_else_branch() {
let raw = "
fn main(n: int) {
if n > 10 {
let x = 2 * n
return x
} else if n < 10 {
return n
} else if n == 10 {
return n + 1
} else {
return n
}
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_int_array() {
let raw = "
fn main() {
let arr = [1, 2, 3]
return arr
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_string_array() {
let raw = "
fn main(n:int) {
return [\"Foo\", \"Bar\", \"Baz\"]
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_basic_while_loop() {
let raw = "
fn main() {
let x = 5 * 2
while x > 0 {
return x
}
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_while_loop_boolean_expression() {
let raw = "
fn main() {
let x = 5 * 2
while true && x {
return x
}
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_boolean_arithmetic() {
let raw = "
fn main() {
let x = true && false
let y = false && true || true
let z = x && true
while true && x {
return x
}
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_array_access_in_loop() {
let raw = "
fn main() {
let x = [1, 2, 3, 4, 5]
let i = 0
while i < 5 {
println(x[i])
i = i + 1
}
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_array_access_standalone() {
let raw = "
fn main() {
let x = [1, 2, 3, 4, 5]
x[0]
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_array_access_assignment() {
let raw = "
fn main() {
let arr = [1, 2, 3]
let x = arr[0]
return x
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_array_access_in_if() {
let raw = "
fn main() {
if arr[d] > arr[d+1] {
let swap = arr[d]
arr[d] = arr[d+1]
arr[d+1] = swap
}
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_uninitialized_variables() {
let raw = "
fn main() {
let x
let y
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_function_call_math() {
let raw = "
fn main(m: int) {
main(m - 1)
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_function_multiple_args() {
let raw = "
fn main(m: int, n: int) {
main(m, n)
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_array_position_assignment() {
let raw = "
fn main() {
new_arr[i] = 1
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_typed_declare() {
let raw = "
fn main() {
let x = 5
let y: int = 1
let z: bool = false
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok())
}
#[test]
fn test_no_function_args_without_type() {
let raw = "
fn main(x) {
return n
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_err())
}
#[test]
fn test_function_with_return_type() {
let raw = "
fn main(x: int): int {
return n
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok());
assert_eq!(tree.unwrap().func[0].ret_type, Some(Type::Int));
}
#[test]
fn test_booleans_in_function_call() {
let raw = "
fn main() {
if n > 2 {
_printf(true)
} else {
_printf(true)
}
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok());
}
#[test]
fn test_late_initializing_variable() {
let raw = "
fn main() {
let x: int
let y: string
x = 5
if x > 2 {
y = 'test'
}
_printf(x)
_printf(y)
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok());
}
#[test]
fn test_simple_for_loop() {
let raw = "
fn main() {
let x = [1, 2, 3]
for i in x {
_printf(i)
}
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok());
}
#[test]
fn test_nested_for_loop() {
let raw = "
fn main() {
let x = [1, 2, 3]
for i in x {
for j in x {
_printf(j)
}
}
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok());
}
#[test]
fn test_nested_array() {
let raw = "
fn main() {
let arr = [[11, 12, 13], [21, 22, 23], [31, 32, 33]]
for i in arr {
for j in i {
println(j)
}
}
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok());
}
#[test]
fn test_simple_nested_expression() {
let raw = "
fn main() {
let x = (1 + 2 * (3 + 2))
println(x)
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok());
}
#[test]
fn test_continue() {
let raw = "
fn main() {
let arr = [1, 2, 3]
for x in arr {
if x == 2 {
continue
} else {
println(x)
}
}
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok());
}
#[test]
fn test_break() {
let raw = "
fn main() {
let arr = [1, 2, 3]
for x in arr {
if x == 2 {
break
} else {
println(x)
}
}
}
";
let tokens = tokenize(raw);
let tree = parse(tokens, Some(raw.to_string()));
assert!(tree.is_ok());
}