frg 2.1.0

Compiled programming language with frogs!
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

pub use nodes::*;
use tree_sitter::{Tree, TreeCursor};

mod builtins;
mod expressions;
mod nodes;
mod statements;
mod types;

#[must_use] 
pub fn build(ts_tree: &Tree, code: &str) -> Vec<Statement> {
    let mut cursor = ts_tree.walk();
    parse_block(&mut cursor, code)
}

#[must_use] 
pub fn transpile(statements: &Vec<Statement>) -> String {
    let mut code = String::new();
    for statement in statements {
        let new_line = statements::transpile(statement);
        code.push_str(&new_line);
        code.push('\n');
    }
    code.pop();
    code
}

fn parse_block(cursor: &mut TreeCursor, code: &str) -> Vec<Statement> {
    let mut statements = vec![];
    if !cursor.goto_first_child() {
        return vec![];
    }
    loop {
        let current_node_kind = cursor.node().kind();

        statements.push(match current_node_kind {
            "statement" => statements::parse(cursor, code),
            "expression" => Statement::Expression(expressions::parse(cursor, code)),
            "{" | "comment" => {
                if !cursor.goto_next_sibling() {
                    break;
                }
                continue;
            }
            "}" => break,
            _ => unreachable!("{current_node_kind}"),
        });

        if !cursor.goto_next_sibling() {
            break;
        }
    }
    cursor.goto_parent();
    statements
}

fn skip_repeats(cursor: &mut TreeCursor, code: &str, repeat: &str) {
    while &code[cursor.node().byte_range()] == repeat {
        cursor.goto_next_sibling();
    }
}